{"id":"https://openalex.org/W2124649180","doi":"https://doi.org/10.1145/1276958.1277341","title":"Multiobjective network design for realistic traffic models","display_name":"Multiobjective network design for realistic traffic models","publication_year":2007,"publication_date":"2007-07-07","ids":{"openalex":"https://openalex.org/W2124649180","doi":"https://doi.org/10.1145/1276958.1277341","mag":"2124649180"},"language":"en","primary_location":{"id":"doi:10.1145/1276958.1277341","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1276958.1277341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th annual conference on Genetic and evolutionary computation","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/A5012819177","display_name":"Nilanjan Banerjee","orcid":"https://orcid.org/0000-0003-4466-0898"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nilanjan Banerjee","raw_affiliation_strings":["University of Massachusetts, Amherst, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103387228","display_name":"Rajeev Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rajeev Kumar","raw_affiliation_strings":["Indian Institute of Technology Kharagpur, Kharagpur, WB, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, Kharagpur, WB, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1904","last_page":"1911"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9972000122070312,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9965999722480774,"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/network-topology","display_name":"Network topology","score":0.8485639691352844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7290933132171631},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6504842042922974},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.647993803024292},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5999954342842102},{"id":"https://openalex.org/keywords/traffic-generation-model","display_name":"Traffic generation model","score":0.45785650610923767},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.42606037855148315},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4216267168521881},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3937150537967682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1835745871067047},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16670164465904236}],"concepts":[{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.8485639691352844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7290933132171631},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6504842042922974},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.647993803024292},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5999954342842102},{"id":"https://openalex.org/C176715033","wikidata":"https://www.wikidata.org/wiki/Q2080768","display_name":"Traffic generation model","level":2,"score":0.45785650610923767},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.42606037855148315},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4216267168521881},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3937150537967682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1835745871067047},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16670164465904236},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1276958.1277341","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1276958.1277341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.319.8966","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.319.8966","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.york.ac.uk/rts/docs/GECCO_2007/docs/p1904.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W42649658","https://openalex.org/W181092438","https://openalex.org/W1479771599","https://openalex.org/W1483353037","https://openalex.org/W1553373771","https://openalex.org/W1595498733","https://openalex.org/W1665846492","https://openalex.org/W1886330095","https://openalex.org/W1990313671","https://openalex.org/W1998141189","https://openalex.org/W2011039300","https://openalex.org/W2029419908","https://openalex.org/W2077823485","https://openalex.org/W2082620437","https://openalex.org/W2086586141","https://openalex.org/W2090275183","https://openalex.org/W2099223156","https://openalex.org/W2148275477","https://openalex.org/W2155019998","https://openalex.org/W2161232116","https://openalex.org/W2165985601","https://openalex.org/W2166775052","https://openalex.org/W2169704388","https://openalex.org/W2746742885","https://openalex.org/W2753693129","https://openalex.org/W2997776631","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W4292408320","https://openalex.org/W7026635939","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2086397253","https://openalex.org/W2133122801","https://openalex.org/W600422426","https://openalex.org/W2007156430","https://openalex.org/W2170882281","https://openalex.org/W3081478936","https://openalex.org/W2785612136","https://openalex.org/W2132320513","https://openalex.org/W2063056766","https://openalex.org/W2068394611"],"abstract_inverted_index":{"Network":[0],"topology":[1,52],"design":[2,53,103],"problems":[3],"find":[4],"application":[5],"in":[6,14,38],"several":[7],"real":[8,131],"life":[9],"scenarios.":[10],"However,":[11],"most":[12],"designs":[13],"the":[15,35,39,71,94,115,125,147],"past":[16],"either":[17],"optimize":[18,69],"for":[19,55,70,130,146],"a":[20,49,56,87,104],"single":[21],"criterion":[22],"like":[23,30],"delay":[24,75],"or":[25],"assume":[26],"simplistic":[27],"traffic":[28,59,150],"models":[29],"Poisson.":[31],"Such":[32],"assumptions":[33],"make":[34],"solutions":[36],"inapplicable":[37],"practical":[40],"world.":[41],"In":[42],"this":[43],"paper,":[44],"we":[45,102,113],"formulate":[46],"and":[47,76,136],"solve":[48],"multiobjective":[50,88,105],"network":[51,77,83,97],"problem":[54],"realistic":[57,82],"Internet":[58],"model":[60],"which":[61],"is":[62],"assumed":[63],"to":[64,80,92],"be":[65],"self":[66,148],"similar.":[67],"We":[68,85,121],"average":[72],"packet":[73],"delivery":[74],"layout":[78],"cost":[79],"construct":[81],"topologies.":[84,98],"present":[86],"evolutionary":[89],"algorithm":[90],"(MOEA)":[91],"obtain":[93],"diverse":[95],"near-optimal":[96],"For":[99],"fair":[100],"comparison,":[101],"deterministic":[106],"heuristic":[107,116],"based":[108],"on":[109],"branch":[110],"exchange":[111],"\u2013":[112],"call":[114],"Pareto":[117],"Branch":[118],"Exchange":[119],"(PBE).":[120],"empirically":[122],"show":[123],"that":[124],"MOEA":[126],"used":[127],"performs":[128],"well":[129],"networks":[132],"of":[133],"various":[134],"sizes,":[135],"generated":[137],"topologies":[138],"are":[139],"quite":[140],"different":[141],"with":[142],"significantly":[143],"larger":[144],"delays":[145],"similar":[149],"model.":[151]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}