{"corpus_id":7588762,"paper_sha":"be66f2098b436e27e53664a42526756501d32aa3","doi":"10.1109/65.145161","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":1971705599,"dblp_id":"journals/network/Mukherjee92a","acl_id":null,"title":"WDM-based local lightwave networks. II. Multihop systems","year":1992,"publication_date":"1992-07-01","venue":"IEEE Network","journal":{"name":"IEEE Network","pages":"20-32","volume":"6"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle","Review"],"pubmed_pub_types":null,"s2_fields_of_study":["Physics","Computer Science","Engineering"],"reference_count":55,"citation_count":461,"influential_citation_count":12,"is_open_access":false,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":null,"s2_open_access_landing_url":null,"s2_open_access_license":null,"s2_open_access_status":null,"pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"For pt.I see ibid., vol.6, no.3, p.12-27, 1992. A survey of wavelength-division-multiplexing (WDM)-based local lightwave networks is presented. The general characteristics of multihop systems are discussed, and various multihop approaches are reviewed. The construction of optimal structures based on minimizing the maximum link flow and optimizations based on minimization of the mean network packet delay are also reviewed. Regular topologies that have been studied as candidates for multihop lightwave networks, including the perfect shuffle, the de Bruijn graph, the toroid, and the hypercube, are discussed. Near-optimal node placement algorithms and shared-channel multihop systems are also discussed.< <ETX xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">&gt;</ETX>","claims":[{"public_id":"cl_32168743b067997f5692756d833ab8a0","status":"active","text":"Multihop wavelength-division-multiplexing local lightwave networks are surveyed, including their general characteristics and major multihop approaches.","confidence":0.98,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_32168743b067997f5692756d833ab8a0"},{"public_id":"cl_f634253e171622f89ded4a8fcc95300f","status":"active","text":"Near-optimal node placement algorithms and shared-channel multihop systems are also reviewed.","confidence":0.93,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_f634253e171622f89ded4a8fcc95300f"},{"public_id":"cl_29cdcc433511d4d5f4f6c01ebdfd91a7","status":"active","text":"Optimal multihop structures are reviewed using objectives of minimizing maximum link flow and minimizing mean network packet delay.","confidence":0.94,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_29cdcc433511d4d5f4f6c01ebdfd91a7"},{"public_id":"cl_036fcc8d9353373baf1c185b715a6c6c","status":"active","text":"Perfect shuffle, de Bruijn graph, toroid, and hypercube are discussed as regular topologies studied for multihop lightwave networks.","confidence":0.97,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_036fcc8d9353373baf1c185b715a6c6c"}],"concepts":[{"public_id":"co_03ac7611469946776fcb446d89176167","status":"active","name":"shared-channel multihop systems","description":"Multihop network systems in which multiple nodes share communication channels.","types":["network system"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_03ac7611469946776fcb446d89176167"},{"public_id":"co_1997ea3fa69be66d49b500aa2d7526d2","status":"active","name":"wavelength-division-multiplexing","description":"A multiplexing technique that carries multiple optical channels on different wavelengths over the same medium.","types":["communication technique"],"aliases":["WDM"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_1997ea3fa69be66d49b500aa2d7526d2"},{"public_id":"co_19e1608a2e61b68f2adf4d714c78fa70","status":"active","name":"perfect shuffle","description":"A regular network topology with a structured permutation-based interconnection pattern.","types":["network topology"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_19e1608a2e61b68f2adf4d714c78fa70"},{"public_id":"co_2354dfb95ab9805f652402a5cd1f84f4","status":"active","name":"local lightwave networks","description":"Local-area optical networks that use lightwave transmission for communication.","types":["network type"],"aliases":["lightwave networks"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_2354dfb95ab9805f652402a5cd1f84f4"},{"public_id":"co_5b696d87bb06dc914f4d76269d16eabd","status":"active","name":"near-optimal node placement algorithms","description":"Algorithms for positioning network nodes so that the resulting structure is close to optimal under a chosen criterion.","types":["algorithm"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_5b696d87bb06dc914f4d76269d16eabd"},{"public_id":"co_6502ae716c4c359d0181f1164edaeb4b","status":"active","name":"toroid","description":"A regular network topology with wraparound connections in two dimensions.","types":["network topology"],"aliases":["torus"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_6502ae716c4c359d0181f1164edaeb4b"},{"public_id":"co_80b6abb4defb2311a123a9cfc0281e76","status":"active","name":"multihop systems","description":"Network architectures in which messages are forwarded through intermediate nodes rather than sent directly.","types":["network architecture"],"aliases":["multihop networks"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_80b6abb4defb2311a123a9cfc0281e76"},{"public_id":"co_8a958873030a2993e4ef0d5a3b459e71","status":"active","name":"de Bruijn graph","description":"A regular graph topology often studied for efficient routing and communication.","types":["graph topology"],"aliases":["de Bruijn network"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_8a958873030a2993e4ef0d5a3b459e71"},{"public_id":"co_dd4552d65a5c5d4a23e67f33b7a77b93","status":"active","name":"mean network packet delay","description":"The average time a packet spends in the network before reaching its destination.","types":["performance metric"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_dd4552d65a5c5d4a23e67f33b7a77b93"},{"public_id":"co_df4922538eba53fbb5826267dff8f21f","status":"active","name":"hypercube","description":"A regular network topology whose nodes correspond to binary strings connected by single-bit differences.","types":["network topology"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_df4922538eba53fbb5826267dff8f21f"},{"public_id":"co_e82a92f5ca55f83b217d547a3b623358","status":"active","name":"optimal structures","description":"Network designs selected to optimize a specified performance criterion.","types":["network design"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_e82a92f5ca55f83b217d547a3b623358"},{"public_id":"co_fd28891435348dd0197062ce9bd50822","status":"active","name":"maximum link flow","description":"The largest traffic load carried by any single network link.","types":["performance metric"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_fd28891435348dd0197062ce9bd50822"}],"external_ids":{"DOI":"10.1109/65.145161","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":1971705599,"DBLP":"journals/network/Mukherjee92a","ACL":null},"open_access":{"is_open_access":false,"pdf_url":null,"landing_url":"https://sah.borca.ai/papers/7588762","source":null,"pdf_url_source":null,"license":null,"reason":"pdf_url_not_indexed"},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":631847,"paper_uid":"69b52315-9ae8-4c53-a3a5-a2581c62f9cd","canonical_identity":{"paper_id":631847,"paper_uid":"69b52315-9ae8-4c53-a3a5-a2581c62f9cd","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/7588762"}