{"id":"https://openalex.org/W2114216117","doi":"https://doi.org/10.1109/icccn.2003.1284150","title":"Single and multipath logical topology design and traffic grooming algorithm in IP over WDM networks","display_name":"Single and multipath logical topology design and traffic grooming algorithm in IP over WDM networks","publication_year":2004,"publication_date":"2004-06-03","ids":{"openalex":"https://openalex.org/W2114216117","doi":"https://doi.org/10.1109/icccn.2003.1284150","mag":"2114216117"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2003.1284150","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2003.1284150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107977502","display_name":"K. Lee","orcid":"https://orcid.org/0000-0003-3175-1336"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Lee","raw_affiliation_strings":["Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","Dept. of Electr. & Comput. Eng. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082603174","display_name":"Mark A. Shayman","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Shayman","raw_affiliation_strings":["Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","Dept. of Electr. & Comput. Eng. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.4137,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60225917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"42","issue":null,"first_page":"59","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7408382892608643},{"id":"https://openalex.org/keywords/multipath-propagation","display_name":"Multipath propagation","score":0.6258633732795715},{"id":"https://openalex.org/keywords/traffic-grooming","display_name":"Traffic grooming","score":0.6037043929100037},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5463523864746094},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5225909948348999},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.521399974822998},{"id":"https://openalex.org/keywords/logical-topology","display_name":"Logical topology","score":0.5108632445335388},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5075329542160034},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5020921230316162},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47918617725372314},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4682990610599518},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.4608874022960663},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.45634257793426514},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3235604166984558},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18531084060668945},{"id":"https://openalex.org/keywords/wavelength-division-multiplexing","display_name":"Wavelength-division multiplexing","score":0.18449190258979797},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1480582356452942},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12421807646751404},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08173921704292297},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.06679600477218628}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7408382892608643},{"id":"https://openalex.org/C161218011","wikidata":"https://www.wikidata.org/wiki/Q11827794","display_name":"Multipath propagation","level":3,"score":0.6258633732795715},{"id":"https://openalex.org/C162396882","wikidata":"https://www.wikidata.org/wiki/Q7832502","display_name":"Traffic grooming","level":4,"score":0.6037043929100037},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5463523864746094},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5225909948348999},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.521399974822998},{"id":"https://openalex.org/C117729477","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Logical topology","level":3,"score":0.5108632445335388},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5075329542160034},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5020921230316162},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47918617725372314},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4682990610599518},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.4608874022960663},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.45634257793426514},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3235604166984558},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18531084060668945},{"id":"https://openalex.org/C160724564","wikidata":"https://www.wikidata.org/wiki/Q1620670","display_name":"Wavelength-division multiplexing","level":3,"score":0.18449190258979797},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1480582356452942},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12421807646751404},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08173921704292297},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.06679600477218628},{"id":"https://openalex.org/C49040817","wikidata":"https://www.wikidata.org/wiki/Q193091","display_name":"Optoelectronics","level":1,"score":0.0},{"id":"https://openalex.org/C6260449","wikidata":"https://www.wikidata.org/wiki/Q41364","display_name":"Wavelength","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2003.1284150","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2003.1284150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W27073611","https://openalex.org/W31324235","https://openalex.org/W128097245","https://openalex.org/W1608635866","https://openalex.org/W1990653246","https://openalex.org/W2103590164","https://openalex.org/W2127703844","https://openalex.org/W2135628480","https://openalex.org/W2150684657","https://openalex.org/W2151652350","https://openalex.org/W2151979817","https://openalex.org/W2165385439","https://openalex.org/W6601291047","https://openalex.org/W6605169482"],"related_works":["https://openalex.org/W4232008900","https://openalex.org/W2177526578","https://openalex.org/W2141444529","https://openalex.org/W1551639801","https://openalex.org/W2138390167","https://openalex.org/W2096062220","https://openalex.org/W2116055628","https://openalex.org/W2111029389","https://openalex.org/W1997741957","https://openalex.org/W2126984569"],"abstract_inverted_index":{"In":[0,48,66],"this":[1],"paper":[2],"we":[3,30,190],"investigate":[4],"single-":[5],"and":[6,11,91,126,138,146,160,187,198],"multipath":[7,68,147,193,200],"logical":[8,21,33,135],"topology":[9,22,34,136],"design":[10,23,31,137],"traffic":[12,26,84,139],"grooming":[13,140],"algorithms.":[14,214],"Since":[15],"the":[16,19,38,49,53,67,83,107,143,165,206],"problem":[17],"of":[18,151,156,183],"optimal":[20],"for":[24,41,55,96,134],"all":[25],"demands":[27],"is":[28,72,86,94,101,162],"NP-complete,":[29],"a":[32,46,63,77,80,92,102,172,199],"by":[35],"sequentially":[36],"constructing":[37],"shortest":[39],"path":[40,51,93,100,105,145,175,213],"one":[42],"source-destination":[43,57],"pair":[44,58],"at":[45],"time.":[47],"single":[50,64,81,144,174,212],"case,":[52,69],"demand":[54,78,85],"each":[56,97],"must":[59],"be":[60,121],"routed":[61],"on":[62,79],"path.":[65],"if":[70],"it":[71],"not":[73],"feasible":[74],"to":[75,211],"route":[76],"path,":[82],"divided":[87],"into":[88],"multiple":[89],"subdemands":[90],"provided":[95],"subdemand.":[98],"Each":[99],"locally":[103],"optimized":[104],"in":[106,141,154,181],"sense":[108],"that":[109,119,171,192],"there":[110],"are":[111],"no":[112],"other":[113,178],"paths":[114,204],"with":[115,202],"less":[116],"hop":[117,158,185,208],"count":[118,159,186,209],"may":[120],"constructed":[122],"from":[123],"existing":[124],"links":[125],"newly":[127],"created":[128],"links.":[129],"We":[130],"propose":[131],"heuristic":[132],"algorithms":[133,153,180,194],"both":[142],"cases.":[148],"The":[149,168],"performance":[150],"these":[152],"terms":[155,182],"weighted":[157,184,207],"throughput":[161,197],"evaluated":[163],"using":[164],"GLASS/SSF":[166],"simulator.":[167],"results":[169],"indicate":[170],"proposed":[173],"algorithm":[176,201],"outperforms":[177],"known":[179],"throughput.":[188],"Also,":[189],"observed":[191],"improve":[195],"network":[196],"widest-shortest":[203],"reduces":[205],"compared":[210]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}