[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_326b2596-f16f-4d0d-9bd6-09c73228413d":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:326b2596-f16f-4d0d-9bd6-09c73228413d,\"}":107},{"code":4,"data":5,"meta":24},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":26,"manageAffiliations":43,"indexDatabases":66,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},"326b2596-f16f-4d0d-9bd6-09c73228413d","2023-05-29T11:45:47.006+00:00","2025-11-21T10:05:13.756+00:00",[],"Computer-Communication-Review",{"country":12,"issn":14,"introduce":16,"eissn":18,"title":20},{"VOID":13},"US",{"VOID":15},"19435819",{"EN":17},"Computer Communication Review (CCR) is an online publication of the ACM Special Interest Group on Data Communication (SIGCOMM) and publishes articles on topics within the SIG's field of interest. Technical papers accepted to CCR typically report on practical advances or the practical applications of theoretical advances. CCR serves as a forum for interesting and novel ideas at an early stage in their development. The focus is on timely dissemination of new ideas that may help trigger additional investigations. While the innovation and timeliness are the major criteria for its acceptance, technical robustness and readability will also be considered in the review process. We particularly encourage papers with early evaluation or feasibility studies.",{"VOID":19},"01464833",{"EN":21},"Computer Communication Review","PUBLISHER","PENDING",null,0,[27,35],{"id":28,"createTime":29,"updateTime":30,"relativeEntities":31,"label":32,"description":34,"parentId":24,"standard":24,"scholarHubFieldId":24},"f0f0ec9c-bb68-4288-a6f1-ee3d47dc35eb","2023-05-29T10:24:08.348+00:00","2023-11-21T07:29:12.845+00:00",[],{"EN":33},"Computer Networks and Communications",{},{"id":36,"createTime":37,"updateTime":38,"relativeEntities":39,"label":40,"description":42,"parentId":24,"standard":24,"scholarHubFieldId":24},"aae089e7-8b62-4df4-ab86-aada3693b3f8","2023-05-29T10:24:07.736+00:00","2023-11-21T07:29:12.850+00:00",[],{"EN":41},"Software",{},[44,56],{"id":45,"createTime":46,"updateTime":47,"relativeEntities":48,"slug":49,"properties":50,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":54,"url":24,"parentIds":55,"statistic":24},"e413bfb3-d7e1-44b7-91f5-e2c2169ea732","2023-05-29T12:06:10.964+00:00","2024-02-11T02:11:46.468+00:00",[],"ASSOC-COMPUTING-MACHINERY",{"title":51},{"EN":52},"ASSOC COMPUTING MACHINERY","AFFILIATION",1,[],{"id":57,"createTime":58,"updateTime":59,"relativeEntities":60,"slug":61,"properties":62,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":54,"url":24,"parentIds":65,"statistic":24},"3e1064b5-61a8-4ca3-bf0f-108007c66507","2023-05-29T10:24:25.162+00:00","2025-11-21T10:07:07.489+00:00",[],"Association-for-Computing-Machinery-ACM-",{"title":63},{"EN":64},"Association for Computing Machinery (ACM)",[],[67,87],{"id":68,"indexDatabase":69,"url":81,"indexYears":82,"academicFieldIds":83,"indexDatabaseRanking":86},"1d333f2c-6fd7-42e3-8747-9e02753d8633",{"id":70,"createTime":71,"updateTime":72,"relativeEntities":73,"label":74,"description":76,"key":78,"publicationTags":79,"standard":24},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":75,"VI":75},"Scopus - Elsevier",{"EN":75,"VI":77},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[80],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F13683","1995-2025",[84,85],"f8ab36fc-bc72-48f2-a425-9f3e042f2272","b4ee5f56-1514-428f-b517-37576cea076b","SCOPUS__Q1",{"id":88,"indexDatabase":89,"url":103,"indexYears":24,"academicFieldIds":104,"indexDatabaseRanking":24},"36e3c6d7-28d0-4fa1-a031-4fb28952d0a0",{"id":90,"createTime":91,"updateTime":92,"relativeEntities":93,"label":94,"description":96,"key":99,"publicationTags":100,"standard":24},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":95,"VI":95},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":97,"EN":98},"Cơ sở dữ liệu SCIE","SCIE database","scie",[101,102],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0146-4833",[105],"5e7ab733-08f6-4bda-8a2e-55af36fcbd05","https:\u002F\u002Fwww.sigcomm.org\u002Fpublications\u002Fcomputer-communication-review",{"meta":108,"data":110},{"total":109},"18",[111,352,632,788,1002,1170,1364,1577,1677,1832],{"id":112,"createTime":113,"updateTime":113,"relativeEntities":114,"slug":115,"properties":116,"entityType":128,"verifyStatus":129,"verifyTime":130,"verifyNote":131,"syncStatus":23,"languages":132,"translateLanguages":24,"viewCount":25,"primaryUrl":134,"fullTextUrl":24,"authors":135,"publicationType":211,"publisherRelationship":212,"citationCount":245,"citationInfo":246,"publishDate":261,"publishYear":262,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":263,"isForceReanalyzing":351},"05a1b099-da77-422b-969a-83a28f0f5d0d","2024-10-02T23:33:17.133+00:00",[],"Rethinking-virtual-network-embedding",{"mag":117,"keywords":119,"openalex":120,"abstract":122,"title":124,"doi":126},{"VOID":118},"2114298221",{},{"VOID":121},"W2114298221",{"EN":123},"\u003Cjats:p>Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying resources requires effective techniques for virtual network embedding--mapping each virtual network to specific nodes and links in the substrate network. Since the general embedding problem is computationally intractable, past research restricted the problem space to allow efficient solutions, or focused on designing heuristic algorithms. In this paper, we advocate a different approach: rethinking the design of the substrate network to enable simpler embedding algorithms and more efficient use of resources, without restricting the problem space. In particular, we simplify virtual link embedding by: i) allowing the substrate network to split a virtual link over multiple substrate paths and ii) employing path migration to periodically re-optimize the utilization of the substrate network. We also explore node-mapping algorithms that are customized to common classes of virtual-network topologies. Our simulation experiments show that path splitting, path migration,and customized embedding algorithms enable a substrate network to satisfy a much larger mix of virtual networks\u003C\u002Fjats:p>",{"EN":125},"Rethinking virtual network embedding",{"VOID":127},"10.1145\u002F1355734.1355737","PUBLICATION","VERIFIED","2024-10-02T23:33:17.132+00:00","Auto Verify",[133],"EN","https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1355734.1355737",[136,158,176,194],{"id":137,"sortIndex":25,"researcher":24,"roles":138,"affiliations":139,"properties":151},"75c15c70-991a-4efb-9723-815bf928b8c2",[],[140],{"id":141,"sortIndex":25,"affiliation":142,"properties":24},"c212b61b-6e73-4ed0-9e74-95e070f94f77",{"id":143,"createTime":144,"updateTime":145,"relativeEntities":146,"slug":147,"properties":148,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"b3f77c96-b332-48cc-85f7-c61b9ca8703b","2024-01-21T02:47:57.167+00:00","2025-01-28T07:31:36.516+00:00",[],"Princeton-University-Princeton-NJ",{"title":149},{"VI":150},"Princeton University, Princeton, NJ",{"openalex":152,"orcid":154,"title":156},{"VOID":153},"A5035157838",{"VOID":155},"https:\u002F\u002Forcid.org\u002F0000-0002-2381-0212",{"EN":157},"Minlan Yu",{"id":159,"sortIndex":160,"researcher":24,"roles":161,"affiliations":162,"properties":169},"209ade69-3589-4432-bbf8-a9d3423a0902",2,[],[163],{"id":164,"sortIndex":25,"affiliation":165,"properties":24},"9dd629bc-6cd3-4cf8-ade3-9a987104ccec",{"id":143,"createTime":144,"updateTime":145,"relativeEntities":166,"slug":147,"properties":167,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":168},{"VI":150},{"openalex":170,"orcid":172,"title":174},{"VOID":171},"A5003914268",{"VOID":173},"https:\u002F\u002Forcid.org\u002F0000-0002-0231-8165",{"EN":175},"Jennifer Rexford",{"id":177,"sortIndex":178,"researcher":24,"roles":179,"affiliations":180,"properties":187},"30e58552-c18f-4f4a-8af5-d81f9fafb166",3,[],[181],{"id":182,"sortIndex":25,"affiliation":183,"properties":24},"3665bb6b-df91-48f9-99fd-42382eca7461",{"id":143,"createTime":144,"updateTime":145,"relativeEntities":184,"slug":147,"properties":185,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":186},{"VI":150},{"openalex":188,"orcid":190,"title":192},{"VOID":189},"A5052709754",{"VOID":191},"https:\u002F\u002Forcid.org\u002F0000-0002-2319-9142",{"EN":193},"Mung Chiang",{"id":195,"sortIndex":54,"researcher":24,"roles":196,"affiliations":197,"properties":204},"0ce00fd2-6c4a-4248-857f-66eb0d4270b4",[],[198],{"id":199,"sortIndex":25,"affiliation":200,"properties":24},"182a4e68-410e-4cc3-b4d0-830562c9083e",{"id":143,"createTime":144,"updateTime":145,"relativeEntities":201,"slug":147,"properties":202,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":203},{"VI":150},{"openalex":205,"orcid":207,"title":209},{"VOID":206},"A5037245619",{"VOID":208},"https:\u002F\u002Forcid.org\u002F0000-0002-6955-3135",{"EN":210},"Yung Yi","ARTICLE",{"url":24,"publisher":213,"properties":238},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":214,"slug":10,"properties":215,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":221,"manageAffiliations":222,"indexDatabases":223,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":216,"issn":217,"introduce":218,"eissn":219,"title":220},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[224,231],{"id":88,"indexDatabase":225,"url":103,"indexYears":24,"academicFieldIds":230,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":226,"label":227,"description":228,"key":99,"publicationTags":229,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":232,"url":81,"indexYears":82,"academicFieldIds":237,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":233,"label":234,"description":235,"key":78,"publicationTags":236,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":239,"pages":241,"issue":243},{"VOID":240},"38",{"VOID":242},"17-29",{"VOID":244},"2",1218,{"total":245,"publishYear":24,"statisticByYear":247},{"2012":248,"2013":249,"2014":250,"2015":251,"2016":252,"2017":253,"2018":254,"2019":255,"2020":256,"2021":257,"2022":258,"2023":259,"2024":260},103,111,123,124,126,101,102,89,68,61,27,35,11,"2008-03-31",2008,[264,267,270,273,276,279,282,285,288,291,294,297,300,303,306,309,312,315,318,321,324,327,330,333,336,339,342,345,348],{"id":24,"text":265,"url":24,"identifiers":266},"Akamai content distribution network. http:\u002F\u002Fwww.akamai.com\u002F.  Akamai content distribution network. http:\u002F\u002Fwww.akamai.com\u002F.",{},{"id":24,"text":268,"url":24,"identifiers":269},"GENI.http:\u002F\u002Fwww.geni.net\u002F.  GENI.http:\u002F\u002Fwww.geni.net\u002F.",{},{"id":24,"text":271,"url":24,"identifiers":272},"Planetlab.https:\u002F\u002Fwww.planet-lab.org\u002F.  Planetlab.https:\u002F\u002Fwww.planet-lab.org\u002F.",{},{"id":24,"text":274,"url":24,"identifiers":275},"Virtual Network Embedding Simulator. http:\u002F\u002Fwww.cs.princeton.edu\u002F~minlanyu\u002Fembed.tar.gz  Virtual Network Embedding Simulator. http:\u002F\u002Fwww.cs.princeton.edu\u002F~minlanyu\u002Fembed.tar.gz",{},{"id":24,"text":277,"url":24,"identifiers":278},"R.K. Ahuja T.L. Magnanti and J.B. Orlin. Network Flows: Theory Algorithms and Applications Prentice Hall 1993.   R.K. Ahuja T.L. Magnanti and J.B. Orlin. Network Flows: Theory Algorithms and Applications Prentice Hall 1993.",{},{"id":24,"text":280,"url":24,"identifiers":281},"D.G. Andersen. Theoretical approaches to node assignment. Unpublished Manuscript http:\u002F\u002Fwww.cs.cmu.edu\u002F~dga\u002Fpapers\u002Fandersen-assign.ps 2002.  D.G. Andersen. Theoretical approaches to node assignment. Unpublished Manuscript http:\u002F\u002Fwww.cs.cmu.edu\u002F~dga\u002Fpapers\u002Fandersen-assign.ps 2002.",{},{"id":24,"text":283,"url":24,"identifiers":284},"10.1109\u002FMC.2005.136",{"doi":283},{"id":24,"text":286,"url":24,"identifiers":287},"10.1145\u002F1177080.1177100",{"doi":286},{"id":24,"text":289,"url":24,"identifiers":290},"10.1145\u002F1159913.1159916",{"doi":289},{"id":24,"text":292,"url":24,"identifiers":293},"10.1109\u002FTNET.2002.803918",{"doi":292},{"id":24,"text":295,"url":24,"identifiers":296},"Eppstein D., 1994, Proc. IEEE Symposium on Foundations of Computer Science",{},{"id":24,"text":298,"url":24,"identifiers":299},"10.1109\u002FINFOCOM.2006.139",{"doi":298},{"id":24,"text":301,"url":24,"identifiers":302},"10.1145\u002F1198255.1198265",{"doi":301},{"id":24,"text":304,"url":24,"identifiers":305},"10.1109\u002F65.826367",{"doi":304},{"id":24,"text":307,"url":24,"identifiers":308},"10.1145\u002F380752.380830",{"doi":307},{"id":24,"text":310,"url":24,"identifiers":311},"10.1145\u002F263326.263344",{"doi":310},{"id":24,"text":313,"url":24,"identifiers":314},"10.1109\u002FMNET.2008.4476066",{"doi":313},{"id":24,"text":316,"url":24,"identifiers":317},"10.1109\u002FINFCOM.2007.25",{"doi":316},{"id":24,"text":319,"url":24,"identifiers":320},"Kirkpatrick S., 1983, Optimization by simulated annealing. Science, Number, 4598, 220",{},{"id":24,"text":322,"url":24,"identifiers":323},"Kleinberg J., 1996, MIT",{},{"id":24,"text":325,"url":24,"identifiers":326},"10.5555\u002F795663.796365",{"doi":325},{"id":24,"text":328,"url":24,"identifiers":329},"10.1109\u002F71.963420",{"doi":328},{"id":24,"text":331,"url":24,"identifiers":332},"10.1145\u002F1028788.1028836",{"doi":331},{"id":24,"text":334,"url":24,"identifiers":335},"10.1145\u002F956981.956988",{"doi":334},{"id":24,"text":337,"url":24,"identifiers":338},"10.1109\u002FGLOCOM.2005.1577741",{"doi":337},{"id":24,"text":340,"url":24,"identifiers":341},"Webb K., 2004, Workshop on Real, Large Distributed Systems (WORLDS)",{},{"id":24,"text":343,"url":24,"identifiers":344},"Wood T., 2007, Proc. Networked Systems Design and Implementation",{},{"id":24,"text":346,"url":24,"identifiers":347},"10.5555\u002F1895868.1895900",{"doi":346},{"id":24,"text":349,"url":24,"identifiers":350},"10.1109\u002FINFOCOM.2006.322",{"doi":349},false,{"id":353,"createTime":354,"updateTime":354,"relativeEntities":355,"slug":356,"properties":357,"entityType":128,"verifyStatus":129,"verifyTime":354,"verifyNote":131,"syncStatus":23,"languages":369,"translateLanguages":24,"viewCount":25,"primaryUrl":370,"fullTextUrl":24,"authors":371,"publicationType":211,"publisherRelationship":504,"citationCount":536,"citationInfo":537,"publishDate":551,"publishYear":552,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":553,"isForceReanalyzing":351},"880af528-8a29-4dc7-8b5c-334aad3cce77","2024-10-02T23:33:12.189+00:00",[],"Virtual-network-embedding-through-topology-aware-node-ranking",{"mag":358,"keywords":360,"openalex":361,"abstract":363,"title":365,"doi":367},{"VOID":359},"2130267070",{},{"VOID":362},"W2130267070",{"EN":364},"\u003Cjats:p>Virtualizing and sharing networked resources have become a growing trend that reshapes the computing and networking architectures. Embedding multiple virtual networks (VNs) on a shared substrate is a challenging problem on cloud computing platforms and large-scale sliceable network testbeds. In this paper we apply the Markov Random Walk (RW) model to rank a network node based on its resource and topological attributes. This novel topology-aware node ranking measure reflects the relative importance of the node. Using node ranking we devise two VN embedding algorithms. The first algorithm maps virtual nodes to substrate nodes according to their ranks, then embeds the virtual links between the mapped nodes by finding shortest paths with unsplittable paths and solving the multi-commodity flow problem with splittable paths. The second algorithm is a backtracking VN embedding algorithm based on breadth-first search, which embeds the virtual nodes and links during the same stage using node ranks. Extensive simulation experiments show that the topology-aware node rank is a better resource measure and the proposed RW-based algorithms increase the long-term average revenue and acceptance ratio compared to the existing embedding algorithms.\u003C\u002Fjats:p>",{"EN":366},"Virtual network embedding through topology-aware node ranking",{"VOID":368},"10.1145\u002F1971162.1971168",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1971162.1971168",[372,394,417,434,451,468,486],{"id":373,"sortIndex":54,"researcher":24,"roles":374,"affiliations":375,"properties":387},"83094c45-b88a-401a-b7f0-6fb2fefe09ee",[],[376],{"id":377,"sortIndex":25,"affiliation":378,"properties":24},"b43337a6-b7ed-49ec-95e1-730a928303ca",{"id":379,"createTime":380,"updateTime":381,"relativeEntities":382,"slug":383,"properties":384,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"c923695f-a03b-4d19-9df2-777f8d5cfbc4","2024-01-04T16:48:17.943+00:00","2025-02-09T15:30:06.201+00:00",[],"Beijing-University-of-Posts-and-Telecommunications-Beijing-China",{"title":385},{"VI":386},"Beijing University of Posts and Telecommunications, Beijing, China",{"openalex":388,"orcid":390,"title":392},{"VOID":389},"A5036865453",{"VOID":391},"https:\u002F\u002Forcid.org\u002F0000-0003-4266-7527",{"EN":393},"Sen Su",{"id":395,"sortIndex":396,"researcher":24,"roles":397,"affiliations":398,"properties":410},"76f4bcd1-7525-4f06-b7bd-b609f19d158e",6,[],[399],{"id":400,"sortIndex":25,"affiliation":401,"properties":24},"50b39abe-a167-4588-9ce3-4b245458154c",{"id":402,"createTime":403,"updateTime":404,"relativeEntities":405,"slug":406,"properties":407,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"d38bfdab-d399-44a8-89df-0da62237e1f8","2024-04-17T21:46:29.364+00:00","2024-10-16T01:07:30.626+00:00",[],"-University-of-Massachusetts-Lowell-Lowell-USA-",{"title":408},{"EN":409},"[University of Massachusetts Lowell, Lowell, USA]",{"openalex":411,"orcid":413,"title":415},{"VOID":412},"A5100440164",{"VOID":414},"https:\u002F\u002Forcid.org\u002F0000-0003-1172-1551",{"EN":416},"Jie Wang",{"id":418,"sortIndex":25,"researcher":24,"roles":419,"affiliations":420,"properties":427},"994b6198-293b-4ec3-94e6-57f8284c7be9",[],[421],{"id":422,"sortIndex":25,"affiliation":423,"properties":24},"104d8501-e5b6-4957-9795-a40128e14628",{"id":379,"createTime":380,"updateTime":381,"relativeEntities":424,"slug":383,"properties":425,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":426},{"VI":386},{"openalex":428,"orcid":430,"title":432},{"VOID":429},"A5062327704",{"VOID":431},"https:\u002F\u002Forcid.org\u002F0000-0001-6556-2264",{"EN":433},"Xiang Cheng",{"id":435,"sortIndex":160,"researcher":24,"roles":436,"affiliations":437,"properties":444},"bbf80f5a-a054-4ee3-bfea-bc609c4caa45",[],[438],{"id":439,"sortIndex":25,"affiliation":440,"properties":24},"32410e8d-92a5-41e1-8efa-f60597756b53",{"id":379,"createTime":380,"updateTime":381,"relativeEntities":441,"slug":383,"properties":442,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":443},{"VI":386},{"openalex":445,"orcid":447,"title":449},{"VOID":446},"A5101759820",{"VOID":448},"https:\u002F\u002Forcid.org\u002F0000-0002-3242-150X",{"EN":450},"Zhongbao Zhang",{"id":452,"sortIndex":178,"researcher":24,"roles":453,"affiliations":454,"properties":461},"916c1e87-2e8e-4ba0-a0c6-473f2811c593",[],[455],{"id":456,"sortIndex":25,"affiliation":457,"properties":24},"3029f85d-69c3-4c45-a014-8b459f21d628",{"id":379,"createTime":380,"updateTime":381,"relativeEntities":458,"slug":383,"properties":459,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":460},{"VI":386},{"openalex":462,"orcid":464,"title":466},{"VOID":463},"A5068218622",{"VOID":465},"https:\u002F\u002Forcid.org\u002F0000-0003-3405-1183",{"EN":467},"Hanchi Wang",{"id":469,"sortIndex":470,"researcher":24,"roles":471,"affiliations":472,"properties":479},"5f6ea006-d666-46d5-9ea0-8d321e65e1fa",5,[],[473],{"id":474,"sortIndex":25,"affiliation":475,"properties":24},"33ed9df4-fed1-4e84-a127-3ab0b61fb9d6",{"id":402,"createTime":403,"updateTime":404,"relativeEntities":476,"slug":406,"properties":477,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":478},{"EN":409},{"openalex":480,"orcid":482,"title":484},{"VOID":481},"A5003621523",{"VOID":483},"https:\u002F\u002Forcid.org\u002F0000-0002-5301-5092",{"EN":485},"Yan Luo",{"id":487,"sortIndex":488,"researcher":24,"roles":489,"affiliations":490,"properties":497},"b270e967-3ae9-40c9-a9d8-73b51c5745a1",4,[],[491],{"id":492,"sortIndex":25,"affiliation":493,"properties":24},"a4d717b7-1a93-485e-aea2-860b6d896f22",{"id":379,"createTime":380,"updateTime":381,"relativeEntities":494,"slug":383,"properties":495,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":496},{"VI":386},{"openalex":498,"orcid":500,"title":502},{"VOID":499},"A5011978021",{"VOID":501},"https:\u002F\u002Forcid.org\u002F0000-0002-6978-1787",{"EN":503},"Fangchun Yang",{"url":24,"publisher":505,"properties":530},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":506,"slug":10,"properties":507,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":513,"manageAffiliations":514,"indexDatabases":515,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":508,"issn":509,"introduce":510,"eissn":511,"title":512},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[516,523],{"id":88,"indexDatabase":517,"url":103,"indexYears":24,"academicFieldIds":522,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":518,"label":519,"description":520,"key":99,"publicationTags":521,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":524,"url":81,"indexYears":82,"academicFieldIds":529,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":525,"label":526,"description":527,"key":78,"publicationTags":528,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":531,"pages":533,"issue":535},{"VOID":532},"41",{"VOID":534},"38-47",{"VOID":244},506,{"total":536,"publishYear":24,"statisticByYear":538},{"2012":539,"2013":540,"2014":541,"2015":542,"2016":543,"2017":544,"2018":545,"2019":540,"2020":546,"2021":547,"2022":548,"2023":549,"2024":550},16,38,48,59,72,46,51,39,30,24,29,10,"2011-04-15",2011,[554,557,560,563,566,569,572,575,578,581,584,587,590,592,594,597,600,603,605,608,611,614,617,619,622,625,628,630],{"id":24,"text":555,"url":24,"identifiers":556},"Amazonec2 http:\u002F\u002Faws.amazon.com\u002Fec2\u002F.  Amazonec2 http:\u002F\u002Faws.amazon.com\u002Fec2\u002F.",{},{"id":24,"text":558,"url":24,"identifiers":559},"VNE-RW Simulator http:\u002F\u002Fint.bupt.edu.cn\u002F~sensu\u002Fvne-rw.html.  VNE-RW Simulator http:\u002F\u002Fint.bupt.edu.cn\u002F~sensu\u002Fvne-rw.html.",{},{"id":24,"text":561,"url":24,"identifiers":562},"VNE Simulator http:\u002F\u002Fwww.cs.princeton.edu\u002F~minlanyu\u002Fembed.tar.gz.  VNE Simulator http:\u002F\u002Fwww.cs.princeton.edu\u002F~minlanyu\u002Fembed.tar.gz.",{},{"id":24,"text":564,"url":24,"identifiers":565},"R.K. Ahuja T.L. Magnanti J.B. Orlin and K. Weihe. Network fows: theory algorithms and applications. Prentice hall Englewood Cliffs NJ 1993.   R.K. Ahuja T.L. Magnanti J.B. Orlin and K. Weihe. Network fows: theory algorithms and applications. Prentice hall Englewood Cliffs NJ 1993.",{},{"id":24,"text":567,"url":24,"identifiers":568},"Andersen David G., 2002, Unpublished Manuscript",{},{"id":24,"text":570,"url":24,"identifiers":571},"10.1145\u002F1052934.1052938",{"doi":570},{"id":24,"text":573,"url":24,"identifiers":574},"10.1007\u002F978-3-642-12963-6_3",{"doi":573},{"id":24,"text":576,"url":24,"identifiers":577},"10.1109\u002FMCOM.2009.5183468",{"doi":576},{"id":24,"text":579,"url":24,"identifiers":580},"10.1109\u002FINFCOM.2009.5061987",{"doi":579},{"id":24,"text":582,"url":24,"identifiers":583},"Cordella L.P., 2001, 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, 149",{},{"id":24,"text":585,"url":24,"identifiers":586},"10.1109\u002FTKDE.2004.1264818",{"doi":585},{"id":24,"text":588,"url":24,"identifiers":589},"10.1109\u002FSFCS.1994.365697",{"doi":588},{"id":24,"text":298,"url":24,"identifiers":591},{"doi":298},{"id":24,"text":301,"url":24,"identifiers":593},{"doi":301},{"id":24,"text":595,"url":24,"identifiers":596},"Global Environment for Network Innovations. National Science Foundation http:\u002F\u002Fwww.geni.net\u002F August 2005.  Global Environment for Network Innovations. National Science Foundation http:\u002F\u002Fwww.geni.net\u002F August 2005.",{},{"id":24,"text":598,"url":24,"identifiers":599},"10.1109\u002FTPAMI.2005.138",{"doi":598},{"id":24,"text":601,"url":24,"identifiers":602},"C. Guo G. Lu H.J. Wang S. Yang C. Kong P. Sun W. Wu Y. Zhang MSR Asia and MSR Redmond. SecondNet: A Data Center Network Virtualization Architecture with Bandwidth Guarantees.  C. Guo G. Lu H.J. Wang S. Yang C. Kong P. Sun W. Wu Y. Zhang MSR Asia and MSR Redmond. SecondNet: A Data Center Network Virtualization Architecture with Bandwidth Guarantees.",{},{"id":24,"text":307,"url":24,"identifiers":604},{"doi":307},{"id":24,"text":606,"url":24,"identifiers":607},"10.1145\u002F1544012.1544027",{"doi":606},{"id":24,"text":609,"url":24,"identifiers":610},"10.1109\u002FICC.2008.1056",{"doi":609},{"id":24,"text":612,"url":24,"identifiers":613},"10.1145\u002F1592648.1592662",{"doi":612},{"id":24,"text":615,"url":24,"identifiers":616},"Page L., 1998, Stanford Digital Library Technologies Project",{},{"id":24,"text":334,"url":24,"identifiers":618},{"doi":334},{"id":24,"text":620,"url":24,"identifiers":621},"Seneta E., 2006, Springer Verlag",{},{"id":24,"text":623,"url":24,"identifiers":624},"10.1109\u002FGLOCOM.2003.1258787",{"doi":623},{"id":24,"text":626,"url":24,"identifiers":627},"Turner JS, IEEE Global Telecommunications Conference, 2005. GLOBECOM'05, 2",{},{"id":24,"text":127,"url":24,"identifiers":629},{"doi":127},{"id":24,"text":349,"url":24,"identifiers":631},{"doi":349},{"id":633,"createTime":634,"updateTime":634,"relativeEntities":635,"slug":636,"properties":637,"entityType":128,"verifyStatus":129,"verifyTime":649,"verifyNote":131,"syncStatus":23,"languages":650,"translateLanguages":24,"viewCount":25,"primaryUrl":651,"fullTextUrl":24,"authors":652,"publicationType":211,"publisherRelationship":709,"citationCount":741,"citationInfo":742,"publishDate":744,"publishYear":552,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":745,"isForceReanalyzing":351},"868dfadb-13ae-4292-bb47-4090603b8367","2024-09-24T22:39:24.202+00:00",[],"On-demand-time-decaying-bloom-filters-for-telemarketer-detection",{"mag":638,"keywords":640,"openalex":641,"abstract":643,"title":645,"doi":647},{"VOID":639},"2128274460",{},{"VOID":642},"W2128274460",{"EN":644},"\u003Cjats:p>Several traffic monitoring applications may benefit from the availability of efficient mechanisms for approximately tracking smoothed time averages rather than raw counts. This paper provides two contributions in this direction. First, our analysis of Time-decaying Bloom filters, formerly proposed data structures devised to perform approximate Exponentially Weighted Moving Averages on streaming data, reveals two major shortcomings: biased estimation when measurements are read in arbitrary time instants, and slow operation resulting from the need to periodically update all the filter's counters at once. We thus propose a new construction, called On-demand Time-decaying Bloom filter, which relies on a continuous-time operation to overcome the accuracy\u002Fperformance limitations of the original window-based approach. Second, we show how this new technique can be exploited in thedesign of high performance stream-based monitoring applications, by developing VoIPSTREAM, a proof-of-concept real-time analysis version of a formerly proposed system for telemarketing call detection. Our validation results, carried out over real telephony data, show how VoIPSTREAM closely mimics the feature extraction process and traffic analysis techniques implemented in the offline system, at a significantly higher processing speed, and without requiring any storage of per-user call detail records.\u003C\u002Fjats:p>",{"EN":646},"On-demand time-decaying bloom filters for telemarketer detection",{"VOID":648},"10.1145\u002F2043165.2043167","2024-09-24T22:39:24.201+00:00",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F2043165.2043167",[653,673,688],{"id":654,"sortIndex":160,"researcher":24,"roles":655,"affiliations":656,"properties":668},"eee8d361-1ffa-4004-be9a-9d5f1210ada7",[],[657],{"id":658,"sortIndex":25,"affiliation":659,"properties":24},"7043ba7e-347f-4938-964d-94034e23b65d",{"id":660,"createTime":661,"updateTime":662,"relativeEntities":663,"slug":664,"properties":665,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"5e0f3c2e-8540-414d-aad2-1803e5cb56f1","2023-11-30T05:41:42.817+00:00","2024-09-24T22:39:24.229+00:00",[],"NEC-Laboratories-Europe-NEC-Europe-Ltd-Heidelberg-Germany",{"title":666},{"VI":667},"NEC Laboratories Europe, NEC Europe Ltd., Heidelberg, Germany",{"openalex":669,"title":671},{"VOID":670},"A5075993798",{"EN":672},"Saverio Niccolini",{"id":674,"sortIndex":54,"researcher":24,"roles":675,"affiliations":676,"properties":683},"79dfca1f-bdb6-4ce3-96c5-124527253a3a",[],[677],{"id":678,"sortIndex":25,"affiliation":679,"properties":24},"ef74fd22-1adf-45a3-bb33-2920132ac5f3",{"id":660,"createTime":661,"updateTime":662,"relativeEntities":680,"slug":664,"properties":681,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":682},{"VI":667},{"openalex":684,"title":686},{"VOID":685},"A5081348293",{"EN":687},"Nico d’Heureuse",{"id":689,"sortIndex":25,"researcher":24,"roles":690,"affiliations":691,"properties":702},"03f03161-434f-472d-9e79-74965ad38b9d",[],[692],{"id":693,"sortIndex":25,"affiliation":694,"properties":24},"fb063005-479c-478b-8fe8-13602899187e",{"id":695,"createTime":696,"updateTime":696,"relativeEntities":697,"slug":698,"properties":699,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"ec809dc6-59de-48e8-928e-4a8a51835117","2024-09-24T22:39:24.216+00:00",[],"CNIT-University-of-Roma-Tor-Vergata-Roma-Italy",{"title":700},{"EN":701},"CNIT \u002F University of Roma Tor Vergata, Roma, Italy",{"openalex":703,"orcid":705,"title":707},{"VOID":704},"A5007176500",{"VOID":706},"https:\u002F\u002Forcid.org\u002F0000-0001-7277-7423",{"EN":708},"Giuseppe Bianchi",{"url":24,"publisher":710,"properties":735},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":711,"slug":10,"properties":712,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":718,"manageAffiliations":719,"indexDatabases":720,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":713,"issn":714,"introduce":715,"eissn":716,"title":717},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[721,728],{"id":88,"indexDatabase":722,"url":103,"indexYears":24,"academicFieldIds":727,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":723,"label":724,"description":725,"key":99,"publicationTags":726,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":729,"url":81,"indexYears":82,"academicFieldIds":734,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":730,"label":731,"description":732,"key":78,"publicationTags":733,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":736,"pages":737,"issue":739},{"VOID":532},{"VOID":738},"5-12",{"VOID":740},"5",18,{"total":741,"publishYear":24,"statisticByYear":743},{"2012":54,"2013":488,"2014":54,"2015":160,"2017":488,"2018":160,"2020":54,"2022":178},"2011-10-22",[746,749,752,755,758,761,764,767,770,773,776,779,782,785],{"id":24,"text":747,"url":24,"identifiers":748},"10.1145\u002F510726.510749",{"doi":747},{"id":24,"text":750,"url":24,"identifiers":751},"10.1145\u002F872757.872787",{"doi":750},{"id":24,"text":753,"url":24,"identifiers":754},"10.1016\u002Fj.jalgor.2003.12.001",{"doi":753},{"id":24,"text":756,"url":24,"identifiers":757},"N. d' Heureuse , S. Tartarelli , and S. Niccolini , \" Analyzing telemarketer behavior in massive telecom data records,\" in 21st Tyrrhenian Workshop on Digital Communications: Trustworthy Internet , 2010 . N. d'Heureuse, S. Tartarelli, and S. Niccolini, \"Analyzing telemarketer behavior in massive telecom data records,\" in 21st Tyrrhenian Workshop on Digital Communications: Trustworthy Internet, 2010.",{},{"id":24,"text":759,"url":24,"identifiers":760},"10.1109\u002FRIDE.2005.15",{"doi":759},{"id":24,"text":762,"url":24,"identifiers":763},"R. Martin and M. Menth , \" Improving the timeliness of rate measurements.\" in 12th GI\u002FITG Conference on measuring, modelling and evaluation of computer and communication systems , 2004 . R. Martin and M. Menth, \"Improving the timeliness of rate measurements.\" in 12th GI\u002FITG Conference on measuring, modelling and evaluation of computer and communication systems, 2004.",{},{"id":24,"text":765,"url":24,"identifiers":766},"10.1145\u002F362686.362692",{"doi":765},{"id":24,"text":768,"url":24,"identifiers":769},"A. Broder and M. Mitzenmacher , \" Network applications of bloom filters: A survey ,\" in Internet Mathematics , 2002 , pp. 636 -- 646 . A. Broder and M. Mitzenmacher, \"Network applications of bloom filters: A survey,\" in Internet Mathematics, 2002, pp. 636--646.",{},{"id":24,"text":771,"url":24,"identifiers":772},"10.1145\u002F285243.285287",{"doi":771},{"id":24,"text":774,"url":24,"identifiers":775},"S. Pontarelli , S. Teofili , and G. Bianchi , \" Hardware-based on-the-fly per-flow scan detector prefilter.\" in Third COST TMA International Workshop on Traffic Monitoring and Analysis , 2011 . S. Pontarelli, S. Teofili, and G. Bianchi, \"Hardware-based on-the-fly per-flow scan detector prefilter.\" in Third COST TMA International Workshop on Traffic Monitoring and Analysis, 2011.",{},{"id":24,"text":777,"url":24,"identifiers":778},"G. Bianchi , E. Boschi , S. Teofili , and B. Trammell , \" Measurement data reduction through variation rate metering.\" in INFOCOM'10 , 2010 , pp. 2187 -- 2195 . G. Bianchi, E. Boschi, S. Teofili, and B. Trammell, \"Measurement data reduction through variation rate metering.\" in INFOCOM'10, 2010, pp. 2187--2195.",{},{"id":24,"text":780,"url":24,"identifiers":781},"J. Rosenberg , H. Schulzrinne , G. Camarillo , A. Johnston , J. Peterson , R. Sparks , M. Handley , and E. Schooler , \" SIP: Session Initiation Protocol,\" RFC 3261 (Proposed Standard) , Jun. 2002 , updated by RFCs 3265, 3853, 4320, 4916. J. Rosenberg, H. Schulzrinne, G. Camarillo, A. Johnston, J. Peterson, R. Sparks, M. Handley, and E. Schooler, \"SIP: Session Initiation Protocol,\" RFC 3261 (Proposed Standard), Jun. 2002, updated by RFCs 3265, 3853, 4320, 4916.",{},{"id":24,"text":783,"url":24,"identifiers":784},"ITU-T , \"{Usage of cause and location in the Digital Subscriber Signalling System No . 1 and the Signalling System No. 7 ISDN User Part,\" ITU-T Recommendation Q.850 , May 1998 . ITU-T, \"{Usage of cause and location in the Digital Subscriber Signalling System No. 1 and the Signalling System No. 7 ISDN User Part,\" ITU-T Recommendation Q.850, May 1998.",{},{"id":24,"text":786,"url":24,"identifiers":787},"10.1007\u002F978-3-642-00975-4_20",{"doi":786},{"id":789,"createTime":790,"updateTime":790,"relativeEntities":791,"slug":792,"properties":793,"entityType":128,"verifyStatus":129,"verifyTime":805,"verifyNote":131,"syncStatus":23,"languages":806,"translateLanguages":24,"viewCount":25,"primaryUrl":807,"fullTextUrl":24,"authors":808,"publicationType":211,"publisherRelationship":868,"citationCount":900,"citationInfo":901,"publishDate":905,"publishYear":906,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":907,"isForceReanalyzing":351},"ee38ca65-d6f8-4aed-aee3-5e7a2afde3c5","2024-10-16T22:36:29.999+00:00",[],"Guidelines-for-interdomain-traffic-engineering",{"mag":794,"keywords":796,"openalex":797,"abstract":799,"title":801,"doi":803},{"VOID":795},"2139573484",{},{"VOID":798},"W2139573484",{"EN":800},"\u003Cjats:p>\n            Network operators must have control over the flow of traffic into, out of, and across their networks. However, the Border Gateway Protocol (BGP) does not facilitate common traffic engineering tasks, such as balancing load across multiple links to a neighboring AS or directing traffic to a different neighbor. Solving these problems is difficult because the number of possible changes to routing policies is too large to exhaustively test all possibilities, some changes in routing policy can have an unpredictable effect on the flow of traffic, and the BGP decision process implemented by router vendors limits an operator's control over path selection.We propose\n            \u003Cjats:italic>fundamental objectives\u003C\u002Fjats:italic>\n            for interdomain traffic engineering and specific guidelines for achieving these objectives\n            \u003Cjats:italic>within the context of BGP\u003C\u002Fjats:italic>\n            . Using routing and traffic data from the AT&T backbone we show how certain BGP policy changes can move traffic in a predictable fashion, despite limited knowledge about the routing policies in neighboring AS's. Then, we show how operators can gain greater flexibility by relaxing some steps in the BGP decision process and ensuring that neighboring AS's send consistent advertisements at each peering location. Finally, we show that an operator can manipulate traffic efficiently by changing the routes for a small number of prefixes (or groups of related prefixes) that consistently receive a large amount of traffic.\n          \u003C\u002Fjats:p>",{"EN":802},"Guidelines for interdomain traffic engineering",{"VOID":804},"10.1145\u002F963985.963988","2024-10-16T22:36:29.998+00:00",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F963985.963988",[809,827,846],{"id":810,"sortIndex":160,"researcher":24,"roles":811,"affiliations":812,"properties":823},"ba1c95ad-38ab-4309-a9a7-84f782e3a1c4",[],[813],{"id":814,"sortIndex":25,"affiliation":815,"properties":24},"c50043ff-304c-4d0b-b9a1-1a424655193b",{"id":816,"createTime":817,"updateTime":817,"relativeEntities":818,"slug":819,"properties":820,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"ec4e2cf8-5457-4cd5-b8d0-53a893178b40","2024-10-16T22:36:30.040+00:00",[],"Internet-and-Networking-Systems-Florham-Park-NJ",{"title":821},{"EN":822},"Internet and Networking Systems, Florham Park, NJ",{"openalex":824,"orcid":825,"title":826},{"VOID":171},{"VOID":173},{"EN":175},{"id":828,"sortIndex":54,"researcher":24,"roles":829,"affiliations":830,"properties":841},"75ce37d9-5a1a-4e95-9882-74635cca7b46",[],[831],{"id":832,"sortIndex":25,"affiliation":833,"properties":24},"2c558631-3703-49fe-9fe1-a572689f91fe",{"id":834,"createTime":835,"updateTime":835,"relativeEntities":836,"slug":837,"properties":838,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"4592f273-fa5f-4aea-a72f-e5b4280594f6","2024-10-16T22:36:30.033+00:00",[],"AT-amp-T-IP-Services-Middletown-NJ",{"title":839},{"EN":840},"AT&T IP Services, Middletown, NJ",{"openalex":842,"title":844},{"VOID":843},"A5004539604",{"EN":845},"Jay Borkenhagen",{"id":847,"sortIndex":25,"researcher":24,"roles":848,"affiliations":849,"properties":861},"0f3dbbd4-5459-4d76-8efb-de34bebc74ef",[],[850],{"id":851,"sortIndex":25,"affiliation":852,"properties":24},"62ca9107-5ecd-401c-96a1-d0ff18401664",{"id":853,"createTime":854,"updateTime":855,"relativeEntities":856,"slug":857,"properties":858,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"386ac85c-aa5e-40dc-8a09-3596fd5df3e7","2024-01-16T00:14:10.266+00:00","2025-01-03T07:19:13.697+00:00",[],"Massachusetts-Institute-of-Technology-Cambridge-MA",{"title":859},{"VI":860},"Massachusetts Institute of Technology, Cambridge, MA",{"openalex":862,"orcid":864,"title":866},{"VOID":863},"A5068586837",{"VOID":865},"https:\u002F\u002Forcid.org\u002F0000-0001-9315-5201",{"EN":867},"Nick Feamster",{"url":24,"publisher":869,"properties":894},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":870,"slug":10,"properties":871,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":877,"manageAffiliations":878,"indexDatabases":879,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":872,"issn":873,"introduce":874,"eissn":875,"title":876},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[880,887],{"id":88,"indexDatabase":881,"url":103,"indexYears":24,"academicFieldIds":886,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":882,"label":883,"description":884,"key":99,"publicationTags":885,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":888,"url":81,"indexYears":82,"academicFieldIds":893,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":889,"label":890,"description":891,"key":78,"publicationTags":892,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":895,"pages":897,"issue":899},{"VOID":896},"33",{"VOID":898},"19-30",{"VOID":740},189,{"total":900,"publishYear":24,"statisticByYear":902},{"2012":903,"2013":904,"2014":488,"2015":396,"2016":178,"2017":470,"2018":54,"2019":470,"2020":470,"2021":488,"2022":488,"2023":178,"2024":54},15,7,"2003-10-01",2003,[908,911,915,918,920,923,926,929,932,935,938,941,944,947,950,953,956,959,962,965,968,971,974,977,980,983,986,989,992,995,998],{"id":24,"text":909,"url":24,"identifiers":910},"D. O. Awduche , A. Chiu , A. Elwalid , I. Widjaja , and X. Xiao , \" Overview and principles of Internet traffic engineering.\" Request for Comments 3272, May 2002 . D. O. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao, \"Overview and principles of Internet traffic engineering.\" Request for Comments 3272, May 2002.",{},{"id":24,"text":912,"url":24,"identifiers":913},"D. O. Awduche J. Malcolm J. Agogbua M. O'Dell and J. McManus \"Requirements for traffic engineering over MPLS.\" Request for Comments 2702 September 1999.   D. O. Awduche J. Malcolm J. Agogbua M. O'Dell and J. McManus \"Requirements for traffic engineering over MPLS.\" Request for Comments 2702 September 1999.",{"doi":914},"10.17487\u002Frfc2702",{"id":24,"text":916,"url":24,"identifiers":917},"10.1109\u002F35.809383",{"doi":916},{"id":24,"text":304,"url":24,"identifiers":919},{"doi":304},{"id":24,"text":921,"url":24,"identifiers":922},"10.1109\u002FMCOM.2003.1200112",{"doi":921},{"id":24,"text":924,"url":24,"identifiers":925},"J. Wepman and J. Abley , \" Inter-domain Traffic Engineering: Principles, Applications, and Case Studies.\" http:\u002F\u002Fwww.nanog.org\u002Fmtg-0202\u002Fte.html , February 2002 . Tutorial at NANOG 24. Miami, FL. J. Wepman and J. Abley, \"Inter-domain Traffic Engineering: Principles, Applications, and Case Studies.\" http:\u002F\u002Fwww.nanog.org\u002Fmtg-0202\u002Fte.html, February 2002. Tutorial at NANOG 24. Miami, FL.",{},{"id":24,"text":927,"url":24,"identifiers":928},"Z. Kerravala , N. Maynard , and A. Phull , \" Intelligent routing: The high IQ Internet ,\" July 2002 . The Yankee Group . http:\u002F\u002Fwww.sockeye.com\u002Fpdf\u002FYankee_IntellRouting_July02.pdf. Z. Kerravala, N. Maynard, and A. Phull, \"Intelligent routing: The high IQ Internet,\" July 2002. The Yankee Group. http:\u002F\u002Fwww.sockeye.com\u002Fpdf\u002FYankee_IntellRouting_July02.pdf.",{},{"id":24,"text":930,"url":24,"identifiers":931},"Y. Rekhter and T. Li , \" A Border Gateway Protocol.\" Request for Comments 1771, March 1995 . Y. Rekhter and T. Li, \"A Border Gateway Protocol.\" Request for Comments 1771, March 1995.",{},{"id":24,"text":933,"url":24,"identifiers":934},"S. Halabi and D. McPherson , Internet Routing Architectures . Cisco Press , second ed., 2001 . S. Halabi and D. McPherson, Internet Routing Architectures. Cisco Press, second ed., 2001.",{},{"id":24,"text":936,"url":24,"identifiers":937},"J. W. Stewart , BGP4: Inter-Domain Routing in the Internet . Addison-Wesley , 1998 . J. W. Stewart, BGP4: Inter-Domain Routing in the Internet. Addison-Wesley, 1998.",{},{"id":24,"text":939,"url":24,"identifiers":940},"G. Huston , \"Interconnection, peering, and settlements,\" In Proc. INET , June 1999 . G. Huston, \"Interconnection, peering, and settlements,\" In Proc. INET, June 1999.",{},{"id":24,"text":942,"url":24,"identifiers":943},"\"BGP Best Path Selection Algorithm.\" http:\u002F\u002Fwww.cisco.com\u002Fwarp\u002Fpublic\u002F459\u002F25.shtml.  \"BGP Best Path Selection Algorithm.\" http:\u002F\u002Fwww.cisco.com\u002Fwarp\u002Fpublic\u002F459\u002F25.shtml.",{},{"id":24,"text":945,"url":24,"identifiers":946},"\"How the Active Route Is Determined.\" http:\u002F\u002Farachne3.juniper.net\u002Ftechpubs\u002Fsoftware\u002Fjunos42\u002Fswconfig-routing42\u002Fhtml\u002Fprotocols-overview4.html#1045417.  \"How the Active Route Is Determined.\" http:\u002F\u002Farachne3.juniper.net\u002Ftechpubs\u002Fsoftware\u002Fjunos42\u002Fswconfig-routing42\u002Fhtml\u002Fprotocols-overview4.html#1045417.",{},{"id":24,"text":948,"url":24,"identifiers":949},"\"Foundry Switch and Router Installation and Configuration Guide Chapter 19 Configuring BGP4.\" http:\u002F\u002Fwww.foundrynet.com\u002Fservices\u002Fdocumentation\u002FSRguide\u002FFoundryManual_BGP4.html.  \"Foundry Switch and Router Installation and Configuration Guide Chapter 19 Configuring BGP4.\" http:\u002F\u002Fwww.foundrynet.com\u002Fservices\u002Fdocumentation\u002FSRguide\u002FFoundryManual_BGP4.html.",{},{"id":24,"text":951,"url":24,"identifiers":952},"C. Labovitz , A. Ahuja , and F. Jahanian , \" Experimental study of Internet stability and wide-area network failures,\" In Proc . International Symposium on Fault-Tolerant Computing , June 1999 . C. Labovitz, A. Ahuja, and F. Jahanian, \"Experimental study of Internet stability and wide-area network failures,\" In Proc. International Symposium on Fault-Tolerant Computing, June 1999.",{},{"id":24,"text":954,"url":24,"identifiers":955},"10.1145\u002F637201.637232",{"doi":954},{"id":24,"text":957,"url":24,"identifiers":958},"10.1117\u002F12.475284",{"doi":957},{"id":24,"text":960,"url":24,"identifiers":961},"10.1109\u002F90.929850",{"doi":960},{"id":24,"text":963,"url":24,"identifiers":964},"\"Cisco Netflow.\" http:\u002F\u002Fwww.cisco.com\u002Fwarp\u002Fpublic\u002F732\u002Fnetflow\u002Findex.html.  \"Cisco Netflow.\" http:\u002F\u002Fwww.cisco.com\u002Fwarp\u002Fpublic\u002F732\u002Fnetflow\u002Findex.html.",{},{"id":24,"text":966,"url":24,"identifiers":967},"\"Sampled Netflow.\" http:\u002F\u002Fwww.cisco.com\u002Funivercd\u002Fcc\u002Ftd\u002Fdoc\u002Fproduct\u002Fsoftware\u002Fios120\u002F120newft\u002F120limit\u002F120s\u002F120s11\u002F12s_sanf.htm.  \"Sampled Netflow.\" http:\u002F\u002Fwww.cisco.com\u002Funivercd\u002Fcc\u002Ftd\u002Fdoc\u002Fproduct\u002Fsoftware\u002Fios120\u002F120newft\u002F120limit\u002F120s\u002F120s11\u002F12s_sanf.htm.",{},{"id":24,"text":969,"url":24,"identifiers":970},"10.1145\u002F505202.505232",{"doi":969},{"id":24,"text":972,"url":24,"identifiers":973},"A. Broido and K. Claffy , \" Analysis of RouteViews BGP data: Policy atoms,\" In Workshop on Network-Related Data Management , May 2001 . A. Broido and K. Claffy, \"Analysis of RouteViews BGP data: Policy atoms,\" In Workshop on Network-Related Data Management, May 2001.",{},{"id":24,"text":975,"url":24,"identifiers":976},"T. Bu , L. Gao , and D. Towsley , \" On Characterizing BGP Routing Table Growth,\" In Proc . IEEE Global Internet, (Taipei, Taiwan) , November 2002 . T. Bu, L. Gao, and D. Towsley, \"On Characterizing BGP Routing Table Growth,\" In Proc. IEEE Global Internet, (Taipei, Taiwan), November 2002.",{},{"id":24,"text":978,"url":24,"identifiers":979},"10.1109\u002FGLOCOM.1999.832484",{"doi":978},{"id":24,"text":981,"url":24,"identifiers":982},"10.1117\u002F12.434391",{"doi":981},{"id":24,"text":984,"url":24,"identifiers":985},"10.1145\u002F505202.505228",{"doi":984},{"id":24,"text":987,"url":24,"identifiers":988},"J. Winick , S. Jamin , and J. Rexford , \" Traffic engineering between neighboring domains.\" http:\u002F\u002Fwww.research.att.com\u002F~jrex\u002Fpapers\u002FinterAS.pdf , July 2002 . J. Winick, S. Jamin, and J. Rexford, \"Traffic engineering between neighboring domains.\" http:\u002F\u002Fwww.research.att.com\u002F~jrex\u002Fpapers\u002FinterAS.pdf, July 2002.",{},{"id":24,"text":990,"url":24,"identifiers":991},"C. Villamizar , R. Chandra , and R. Govindan , \" BGP Route Flap Damping.\" Request for Comments 2439, November 1998 . C. Villamizar, R. Chandra, and R. Govindan, \"BGP Route Flap Damping.\" Request for Comments 2439, November 1998.",{},{"id":24,"text":993,"url":24,"identifiers":994},"\"How BGP Routers Use the Multi-Exit Discriminator for Best Path Selection.\" http:\u002F\u002Fwww.cisco.com\u002Fwarp\u002Fpublic\u002F459\u002F37.html.  \"How BGP Routers Use the Multi-Exit Discriminator for Best Path Selection.\" http:\u002F\u002Fwww.cisco.com\u002Fwarp\u002Fpublic\u002F459\u002F37.html.",{},{"id":24,"text":996,"url":24,"identifiers":997},"\"BGP Soft Reset Enhancement.\" http:\u002F\u002Fwww.cisco.com\u002Funivercd\u002Fcc\u002Ftd\u002Fdoc\u002Fproduct\u002Fsoftware\u002Fios120\u002F120newft\u002F120t\u002F120t7\u002Fsftrst.htm.  \"BGP Soft Reset Enhancement.\" http:\u002F\u002Fwww.cisco.com\u002Funivercd\u002Fcc\u002Ftd\u002Fdoc\u002Fproduct\u002Fsoftware\u002Fios120\u002F120newft\u002F120t\u002F120t7\u002Fsftrst.htm.",{},{"id":24,"text":999,"url":24,"identifiers":1000},"E. Chen \"Route refresh capability for BGP-4.\" Request for Comments 2918 September 2000.   E. Chen \"Route refresh capability for BGP-4.\" Request for Comments 2918 September 2000.",{"doi":1001},"10.17487\u002Frfc2918",{"id":1003,"createTime":1004,"updateTime":1004,"relativeEntities":1005,"slug":1006,"properties":1007,"entityType":128,"verifyStatus":129,"verifyTime":1004,"verifyNote":131,"syncStatus":23,"languages":1019,"translateLanguages":24,"viewCount":25,"primaryUrl":1020,"fullTextUrl":24,"authors":1021,"publicationType":211,"publisherRelationship":1098,"citationCount":1131,"citationInfo":1132,"publishDate":1141,"publishYear":1142,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":1143,"isForceReanalyzing":351},"a4954c07-412e-4106-b0ea-15a3726067b6","2024-12-26T21:23:14.250+00:00",[],"Understanding-data-center-traffic-characteristics",{"mag":1008,"keywords":1010,"openalex":1011,"abstract":1013,"title":1015,"doi":1017},{"VOID":1009},"2613694343",{},{"VOID":1012},"W2613694343",{"EN":1014},"\u003Cjats:p>As data centers become more and more central in Internet communications, both research and operations communities have begun to explore how to better design and manage them. In this paper, we present a preliminary empirical study of end-to-end traffic patterns in data center networks that can inform and help evaluate research and operational approaches. We analyze SNMP logs collected at 19 data centers to examine temporal and spatial variations in link loads and losses. We find that while links in the core are heavily utilized the ones closer to the edge observe a greater degree of loss. We then study packet traces collected at a small number of switches in one data center and find evidence of ON-OFF traffic behavior. Finally, we develop a framework that derives ON-OFF traffic parameters for data center traffic sources that best explain the SNMP data collected for the data center. We show that the framework can be used to evaluate data center traffic engineering approaches. We are also applying the framework to design network-level traffic generators for data centers.\u003C\u002Fjats:p>",{"EN":1016},"Understanding data center traffic characteristics",{"VOID":1018},"10.1145\u002F1672308.1672325",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1672308.1672325",[1022,1044,1061,1076],{"id":1023,"sortIndex":25,"researcher":24,"roles":1024,"affiliations":1025,"properties":1037},"cd9b93e8-5220-48c2-beed-569b2769e990",[],[1026],{"id":1027,"sortIndex":25,"affiliation":1028,"properties":24},"1c3de7de-8d55-49df-b799-e829fdb83547",{"id":1029,"createTime":1030,"updateTime":1031,"relativeEntities":1032,"slug":1033,"properties":1034,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"171e428e-4b22-4091-8779-2d832a084804","2023-12-12T22:57:46.299+00:00","2025-01-01T02:22:52.859+00:00",[],"University-Of-Wisconsin-Madison-WI-USA",{"title":1035},{"VI":1036},"University Of Wisconsin, Madison, WI USA",{"openalex":1038,"orcid":1040,"title":1042},{"VOID":1039},"A5069985929",{"VOID":1041},"https:\u002F\u002Forcid.org\u002F0000-0002-5855-8811",{"EN":1043},"Theophilus Benson",{"id":1045,"sortIndex":160,"researcher":24,"roles":1046,"affiliations":1047,"properties":1054},"c34d87e4-b6e1-44f5-81d9-fe018204c38a",[],[1048],{"id":1049,"sortIndex":25,"affiliation":1050,"properties":24},"8260bf75-9d3d-4360-81a2-62868a8eebe8",{"id":1029,"createTime":1030,"updateTime":1031,"relativeEntities":1051,"slug":1033,"properties":1052,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":1053},{"VI":1036},{"openalex":1055,"orcid":1057,"title":1059},{"VOID":1056},"A5035329776",{"VOID":1058},"https:\u002F\u002Forcid.org\u002F0000-0002-5920-170X",{"EN":1060},"Aditya Akella",{"id":1062,"sortIndex":54,"researcher":24,"roles":1063,"affiliations":1064,"properties":1071},"dd06e7ca-ca45-4b56-bd05-3567a3566651",[],[1065],{"id":1066,"sortIndex":25,"affiliation":1067,"properties":24},"2faa55b8-1528-4bc6-92f6-15c01e467411",{"id":1029,"createTime":1030,"updateTime":1031,"relativeEntities":1068,"slug":1033,"properties":1069,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":1070},{"VI":1036},{"openalex":1072,"title":1074},{"VOID":1073},"A5104044470",{"EN":1075},"Ashok Anand",{"id":1077,"sortIndex":178,"researcher":24,"roles":1078,"affiliations":1079,"properties":1091},"f8db466d-aa1e-41b9-bf12-1f8ea3f32c38",[],[1080],{"id":1081,"sortIndex":25,"affiliation":1082,"properties":24},"ef5ce896-ce5c-48a3-a8bf-fdd06f94e0f9",{"id":1083,"createTime":1084,"updateTime":1085,"relativeEntities":1086,"slug":1087,"properties":1088,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"328b308a-6bb9-4c24-a501-2f3bc5c20a06","2024-01-15T04:40:34.345+00:00","2024-12-26T21:23:14.273+00:00",[],"Microsoft-Redmond-WA-USA",{"title":1089},{"VI":1090},"Microsoft Redmond, WA, USA",{"openalex":1092,"orcid":1094,"title":1096},{"VOID":1093},"A5100447267",{"VOID":1095},"https:\u002F\u002Forcid.org\u002F0000-0002-4214-9423",{"EN":1097},"Ming Zhang",{"url":24,"publisher":1099,"properties":1124},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1100,"slug":10,"properties":1101,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":1107,"manageAffiliations":1108,"indexDatabases":1109,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":1102,"issn":1103,"introduce":1104,"eissn":1105,"title":1106},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[1110,1117],{"id":88,"indexDatabase":1111,"url":103,"indexYears":24,"academicFieldIds":1116,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":1112,"label":1113,"description":1114,"key":99,"publicationTags":1115,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":1118,"url":81,"indexYears":82,"academicFieldIds":1123,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":1119,"label":1120,"description":1121,"key":78,"publicationTags":1122,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":1125,"pages":1127,"issue":1129},{"VOID":1126},"40",{"VOID":1128},"92-99",{"VOID":1130},"1",513,{"total":1131,"publishYear":24,"statisticByYear":1133},{"2012":1134,"2013":544,"2014":1135,"2015":257,"2016":1136,"2017":1137,"2018":1135,"2019":1138,"2020":258,"2021":1139,"2022":539,"2023":548,"2024":1140},28,43,53,45,34,37,19,"2010-01-07",2010,[1144,1147,1150,1152,1155,1158,1161,1164,1167],{"id":24,"text":1145,"url":24,"identifiers":1146},"The network simulator -- ns-2. http:\u002F\u002Fwww.isi.edu\u002Fnsnam\u002Fns\u002F. http:\u002F\u002Fwww.isi.edu\u002Fnsnam\u002Fns\u002F.  The network simulator -- ns-2. http:\u002F\u002Fwww.isi.edu\u002Fnsnam\u002Fns\u002F. http:\u002F\u002Fwww.isi.edu\u002Fnsnam\u002Fns\u002F.",{},{"id":24,"text":1148,"url":24,"identifiers":1149},"10.1145\u002F1402958.1402967",{"doi":1148},{"id":24,"text":804,"url":24,"identifiers":1151},{"doi":804},{"id":24,"text":1153,"url":24,"identifiers":1154},"10.1145\u002F1397718.1397732",{"doi":1153},{"id":24,"text":1156,"url":24,"identifiers":1157},"10.1109\u002F90.282603",{"doi":1156},{"id":24,"text":1159,"url":24,"identifiers":1160},"T. Oetiker. Round robin database tool. http:\u002F\u002Foss.oetiker.ch\u002Frrdtool\u002F.  T. Oetiker. Round robin database tool. http:\u002F\u002Foss.oetiker.ch\u002Frrdtool\u002F.",{},{"id":24,"text":1162,"url":24,"identifiers":1163},"10.1109\u002F90.392383",{"doi":1162},{"id":24,"text":1165,"url":24,"identifiers":1166},"C.S. version 2 MIBs. http:\u002F\u002Fwww.cisco.com\u002Fpublic\u002Fmibs\u002F.  C.S. version 2 MIBs. http:\u002F\u002Fwww.cisco.com\u002Fpublic\u002Fmibs\u002F.",{},{"id":24,"text":1168,"url":24,"identifiers":1169},"F. Wilcoxon . Biometrics bulletin. 1:80--83 , 1945 . F. Wilcoxon. Biometrics bulletin. 1:80--83, 1945.",{},{"id":1171,"createTime":1172,"updateTime":1172,"relativeEntities":1173,"slug":1174,"properties":1175,"entityType":128,"verifyStatus":129,"verifyTime":1172,"verifyNote":131,"syncStatus":23,"languages":1187,"translateLanguages":24,"viewCount":25,"primaryUrl":1188,"fullTextUrl":24,"authors":1189,"publicationType":211,"publisherRelationship":1251,"citationCount":1284,"citationInfo":1285,"publishDate":1293,"publishYear":1294,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":1295,"isForceReanalyzing":351},"437e1ac2-a2a7-4ba4-bb05-65fd21056094","2024-09-28T18:27:15.995+00:00",[],"Routing-in-a-delay-tolerant-network",{"mag":1176,"keywords":1178,"openalex":1179,"abstract":1181,"title":1183,"doi":1185},{"VOID":1177},"3162828249",{},{"VOID":1180},"W3162828249",{"EN":1182},"\u003Cjats:p>We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also find that with limited additional knowledge, far less than complete global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs.\u003C\u002Fjats:p>",{"EN":1184},"Routing in a delay tolerant network",{"VOID":1186},"10.1145\u002F1030194.1015484",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1030194.1015484",[1190,1209,1231],{"id":1191,"sortIndex":54,"researcher":24,"roles":1192,"affiliations":1193,"properties":1204},"33ed2dfe-2360-489b-9793-2d66f3e4830f",[],[1194],{"id":1195,"sortIndex":25,"affiliation":1196,"properties":24},"b6344a89-ebde-4449-9db5-8ff11fffb98d",{"id":1197,"createTime":1198,"updateTime":1198,"relativeEntities":1199,"slug":1200,"properties":1201,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"cf3a6c04-b6fd-4f86-ac8d-14313f771ca3","2024-09-28T18:27:16.010+00:00",[],"Intel-Research-Berkeley",{"title":1202},{"EN":1203},"Intel Research, Berkeley",{"openalex":1205,"title":1207},{"VOID":1206},"A5071167836",{"EN":1208},"Kevin Fall",{"id":1210,"sortIndex":25,"researcher":24,"roles":1211,"affiliations":1212,"properties":1224},"e278a76a-5ee5-4a50-8222-d4f13d72c22d",[],[1213],{"id":1214,"sortIndex":25,"affiliation":1215,"properties":24},"e5322416-bd4b-4035-b76e-306bb47ebbfc",{"id":1216,"createTime":1217,"updateTime":1218,"relativeEntities":1219,"slug":1220,"properties":1221,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"19da5a30-e106-43d3-a9ef-0909b798516e","2024-01-04T13:33:04.608+00:00","2025-02-24T08:37:18.828+00:00",[],"University-of-Washington",{"title":1222},{"VI":1223},"University of Washington",{"openalex":1225,"orcid":1227,"title":1229},{"VOID":1226},"A5101473084",{"VOID":1228},"https:\u002F\u002Forcid.org\u002F0009-0001-6395-0682",{"EN":1230},"Sushant Jain",{"id":1232,"sortIndex":160,"researcher":24,"roles":1233,"affiliations":1234,"properties":1246},"38c769a7-d2c8-48ca-a29a-ba3ce16f2bdd",[],[1235],{"id":1236,"sortIndex":25,"affiliation":1237,"properties":24},"fd86fbca-cefa-4221-8fe2-6eec184a568a",{"id":1238,"createTime":1239,"updateTime":1240,"relativeEntities":1241,"slug":1242,"properties":1243,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"16a399c8-6ca1-4a76-b348-cf488f694917","2023-12-20T19:29:14.942+00:00","2025-02-10T05:36:35.586+00:00",[],"University-of-California-Berkeley",{"title":1244},{"VI":1245},"University of California, Berkeley",{"openalex":1247,"title":1249},{"VOID":1248},"A5103514891",{"EN":1250},"Rabin Patra",{"url":24,"publisher":1252,"properties":1277},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1253,"slug":10,"properties":1254,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":1260,"manageAffiliations":1261,"indexDatabases":1262,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":1255,"issn":1256,"introduce":1257,"eissn":1258,"title":1259},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[1263,1270],{"id":88,"indexDatabase":1264,"url":103,"indexYears":24,"academicFieldIds":1269,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":1265,"label":1266,"description":1267,"key":99,"publicationTags":1268,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":1271,"url":81,"indexYears":82,"academicFieldIds":1276,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":1272,"label":1273,"description":1274,"key":78,"publicationTags":1275,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":1278,"pages":1280,"issue":1282},{"VOID":1279},"34",{"VOID":1281},"145-158",{"VOID":1283},"4",579,{"total":1284,"publishYear":24,"statisticByYear":1286},{"2012":542,"2013":1136,"2014":1287,"2015":544,"2016":547,"2017":1288,"2018":1289,"2019":1290,"2020":1291,"2021":741,"2022":1292,"2023":260},42,41,31,32,22,14,"2004-08-30",2004,[1296,1299,1302,1305,1308,1311,1313,1316,1319,1322,1325,1328,1331,1334,1337,1340,1343,1346,1349,1352,1355,1358,1361],{"id":24,"text":1297,"url":24,"identifiers":1298},"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice Hall , 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.",{},{"id":24,"text":1300,"url":24,"identifiers":1301},"AMSAT. http:\u002F\u002Fwww.amsat.org\u002F.  AMSAT. http:\u002F\u002Fwww.amsat.org\u002F.",{},{"id":24,"text":1303,"url":24,"identifiers":1304},"10.1145\u002F288235.288256",{"doi":1303},{"id":24,"text":1306,"url":24,"identifiers":1307},"X. Chen and A. L. Murphy . Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In Workshop on Principles of Mobile Computing , August 2001 . X. Chen and A. L. Murphy. Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In Workshop on Principles of Mobile Computing, August 2001.",{},{"id":24,"text":1309,"url":24,"identifiers":1310},"CPLEX\n  : Linear Programming Solver. http:\u002F\u002Fwww.ilog.com\u002F.  CPLEX: Linear Programming Solver. http:\u002F\u002Fwww.ilog.com\u002F.",{},{"id":24,"text":1309,"url":24,"identifiers":1312},{},{"id":24,"text":1314,"url":24,"identifiers":1315},"10.1145\u002F863955.863960",{"doi":1314},{"id":24,"text":1317,"url":24,"identifiers":1318},"L. R. Ford and D. R. Fulkerson . Flows in Networks . Princeton University Press , 1962 . L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.",{},{"id":24,"text":1320,"url":24,"identifiers":1321},"S. Gao . Routing Problems in Stochastic Time-Dependent Networks with Applications in Dynamic Traffic Assignment. Master's thesis , MIT , 2002 . S. Gao. Routing Problems in Stochastic Time-Dependent Networks with Applications in Dynamic Traffic Assignment. Master's thesis, MIT, 2002.",{},{"id":24,"text":1323,"url":24,"identifiers":1324},"P. Honeymoon and S. Bellovin . PATHALIAS: The Care and Feeding of Relative Address. In USENIX Conference , 1986 . P. Honeymoon and S. Bellovin. PATHALIAS: The Care and Feeding of Relative Address. In USENIX Conference, 1986.",{},{"id":24,"text":1326,"url":24,"identifiers":1327},"B. Hoppe and É. Tardos. The Quickest Transshipment Problem . In SODA , Jan. 1996 . B. Hoppe and É. Tardos. The Quickest Transshipment Problem. In SODA, Jan. 1996.",{},{"id":24,"text":1329,"url":24,"identifiers":1330},"10.1145\u002F605397.605408",{"doi":1329},{"id":24,"text":1332,"url":24,"identifiers":1333},"B. Kotnyek . An Annotated Overview of Dynamic Network Flows. Technical Report RR-4936 , INRIA , Sept. 2003 . B. Kotnyek. An Annotated Overview of Dynamic Network Flows. Technical Report RR-4936, INRIA, Sept. 2003.",{},{"id":24,"text":1335,"url":24,"identifiers":1336},"J. A. Magliacane. PREDICT: Satellite Tracking Software. http:\u002F\u002Fwww.qsl.net\u002Fkd2bd\u002Fpredict.html\u002F.  J. A. Magliacane. PREDICT: Satellite Tracking Software. http:\u002F\u002Fwww.qsl.net\u002Fkd2bd\u002Fpredict.html\u002F.",{},{"id":24,"text":1338,"url":24,"identifiers":1339},"10.1109\u002FICNP.2001.992756",{"doi":1338},{"id":24,"text":1341,"url":24,"identifiers":1342},"10.1145\u002F938985.939012",{"doi":1341},{"id":24,"text":1344,"url":24,"identifiers":1345},"R. Ogier . Minimum-delay Routing in Continuous-time Dynamic Networks with Piecewise-constant Capacities. Networks , 18 : 303 -- 318 , 1988 . R. Ogier. Minimum-delay Routing in Continuous-time Dynamic Networks with Piecewise-constant Capacities. Networks, 18:303--318, 1988.",{},{"id":24,"text":1347,"url":24,"identifiers":1348},"10.1145\u002F79147.214078",{"doi":1347},{"id":24,"text":1350,"url":24,"identifiers":1351},"10.1109\u002FMC.2004.1260729",{"doi":1350},{"id":24,"text":1353,"url":24,"identifiers":1354},"10.5555\u002F1060289.1060319",{"doi":1353},{"id":24,"text":1356,"url":24,"identifiers":1357},"10.1109\u002FSNPA.2003.1203354",{"doi":1356},{"id":24,"text":1359,"url":24,"identifiers":1360},"TIER Project. http:\u002F\u002Ftier.cs.berkeley.edu\u002F.  TIER Project. http:\u002F\u002Ftier.cs.berkeley.edu\u002F.",{},{"id":24,"text":1362,"url":24,"identifiers":1363},"Wizzy Project. http:\u002F\u002Fwww.wizzy.org.za\u002F.  Wizzy Project. http:\u002F\u002Fwww.wizzy.org.za\u002F.",{},{"id":1365,"createTime":1366,"updateTime":1366,"relativeEntities":1367,"slug":1368,"properties":1369,"entityType":128,"verifyStatus":129,"verifyTime":1366,"verifyNote":131,"syncStatus":23,"languages":1381,"translateLanguages":24,"viewCount":25,"primaryUrl":1382,"fullTextUrl":24,"authors":1383,"publicationType":211,"publisherRelationship":1424,"citationCount":1457,"citationInfo":1458,"publishDate":1463,"publishYear":1464,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":1465,"isForceReanalyzing":351},"c43df92a-13c7-4832-b0c9-33591e926cf4","2024-10-15T16:11:53.131+00:00",[],"PAMAS-power-aware-multi-access-protocol-with-signalling-for-ad-hoc-networks",{"mag":1370,"keywords":1372,"openalex":1373,"abstract":1375,"title":1377,"doi":1379},{"VOID":1371},"2017333190",{},{"VOID":1374},"W2017333190",{"EN":1376},"\u003Cjats:p>In this paper we develop a new multiaccess protocol for ad hoc radio networks. The protocol is based on the original MACA protocol with the adition of a separate signalling channel. The unique feature of our protocol is that it conserves battery power at nodes by intelligently powering off nodes that are not actively transmitting or receiving packets. The manner in which nodes power themselves off does not influence the delay or throughput characteristics of our protocol. We illustrate the power conserving behavior of PAMAS via extensive simulations performed over ad hoc networks containing 10-20 nodes. Our results indicate that power savings of between 10% and 70% are attainable in most systems. Finally, we discuss how the idea of power awareness can be built into other multiaccess protocols as well.\u003C\u002Fjats:p>",{"EN":1378},"PAMAS—power aware multi-access protocol with signalling for ad hoc networks",{"VOID":1380},"10.1145\u002F293927.293928",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F293927.293928",[1384,1403],{"id":1385,"sortIndex":54,"researcher":24,"roles":1386,"affiliations":1387,"properties":1398},"bd041705-5b3c-424b-a57b-134745996cb1",[],[1388],{"id":1389,"sortIndex":25,"affiliation":1390,"properties":24},"2ee26870-22de-44ff-b90c-c3228941ee34",{"id":1391,"createTime":1392,"updateTime":1392,"relativeEntities":1393,"slug":1394,"properties":1395,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"a993aa66-29b7-4615-8d94-a162fb67f469","2024-10-15T16:11:53.158+00:00",[],"Aerospace-Corporation-El-Segundo-CA",{"title":1396},{"EN":1397},"Aerospace Corporation, El Segundo, CA",{"openalex":1399,"title":1401},{"VOID":1400},"A5015982779",{"EN":1402},"C.S. Raghavendra",{"id":1404,"sortIndex":25,"researcher":24,"roles":1405,"affiliations":1406,"properties":1417},"b1d1d760-548c-4ef7-ae6a-74bb65969c03",[],[1407],{"id":1408,"sortIndex":25,"affiliation":1409,"properties":24},"eb5796a3-e8ca-444c-8b27-0d625fc1e171",{"id":1410,"createTime":1411,"updateTime":1411,"relativeEntities":1412,"slug":1413,"properties":1414,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"78a2b14a-913a-49ef-889b-6867240417f1","2024-10-15T16:11:53.146+00:00",[],"Department-of-Electrical-amp-Computer-Engineering-Oregon-State-University-Corvallis-OR",{"title":1415},{"EN":1416},"Department of Electrical & Computer Engineering, Oregon State University, Corvallis, OR",{"openalex":1418,"orcid":1420,"title":1422},{"VOID":1419},"A5068360596",{"VOID":1421},"https:\u002F\u002Forcid.org\u002F0000-0002-1509-0497",{"EN":1423},"Suresh Singh",{"url":24,"publisher":1425,"properties":1450},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1426,"slug":10,"properties":1427,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":1433,"manageAffiliations":1434,"indexDatabases":1435,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":1428,"issn":1429,"introduce":1430,"eissn":1431,"title":1432},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[1436,1443],{"id":88,"indexDatabase":1437,"url":103,"indexYears":24,"academicFieldIds":1442,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":1438,"label":1439,"description":1440,"key":99,"publicationTags":1441,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":1444,"url":81,"indexYears":82,"academicFieldIds":1449,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":1445,"label":1446,"description":1447,"key":78,"publicationTags":1448,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":1451,"pages":1453,"issue":1455},{"VOID":1452},"28",{"VOID":1454},"5-26",{"VOID":1456},"3",1134,{"total":1457,"publishYear":24,"statisticByYear":1459},{"2012":541,"2013":1460,"2014":1287,"2015":1135,"2016":1461,"2017":488,"2018":1462,"2019":178,"2020":1292,"2021":550,"2022":160,"2023":54,"2024":178},55,21,8,"1998-07-01",1998,[1466,1469,1472,1475,1478,1481,1484,1487,1490,1493,1496,1499,1502,1505,1508,1511,1514,1517,1520,1523,1526,1529,1532,1535,1538,1541,1544,1547,1550,1553,1556,1559,1562,1565,1568,1571,1574],{"id":24,"text":1467,"url":24,"identifiers":1468},"{1} Rooftop Communications http:\u002F\u002Fwww.rooftop.com  {1} Rooftop Communications http:\u002F\u002Fwww.rooftop.com",{},{"id":24,"text":1470,"url":24,"identifiers":1471},"{2} http:\u002F\u002Fwww.global-defence-review.com\u002FDigitalBattlefield.html  {2} http:\u002F\u002Fwww.global-defence-review.com\u002FDigitalBattlefield.html",{},{"id":24,"text":1473,"url":24,"identifiers":1474},"{3} http:\u002F\u002Fwww.networks.digital.com\u002Fnpb\u002Fhtml\u002Fproducts_guide\u002Froamwir2.html  {3} http:\u002F\u002Fwww.networks.digital.com\u002Fnpb\u002Fhtml\u002Fproducts_guide\u002Froamwir2.html",{},{"id":24,"text":1476,"url":24,"identifiers":1477},"{4} D. Beyer , \"Accomplishments of the D ARPA SURAN Program\" , Proc. IEEE MILCOM'90 , Monterey, CA , Oct. 1990 . {4} D. Beyer, \"Accomplishments of the DARPA SURAN Program\", Proc. IEEE MILCOM'90, Monterey, CA, Oct. 1990.",{},{"id":24,"text":1479,"url":24,"identifiers":1480},"10.1145\u002F190314.190334",{"doi":1479},{"id":24,"text":1482,"url":24,"identifiers":1483},"{6} Béla Bollobás , Random Graphs , Academic Press , 1985 . {6} Béla Bollobás, Random Graphs, Academic Press, 1985.",{},{"id":24,"text":1485,"url":24,"identifiers":1486},"{7} A. Chandrakasan , T. Simon , J. Goodman and W. Rabiner , \" Signal Processing for an ultra low power Wireless Video Camera \", 3rd International Workshop on Mobile Multimedia Communications , Princeton, NJ , September 25-27, 1996 . {7} A. Chandrakasan, T. Simon, J. Goodman and W. Rabiner, \"Signal Processing for an ultra low power Wireless Video Camera\", 3rd International Workshop on Mobile Multimedia Communications, Princeton, NJ, September 25-27, 1996.",{},{"id":24,"text":1488,"url":24,"identifiers":1489},"10.1109\u002FVETEC.1998.683696",{"doi":1488},{"id":24,"text":1491,"url":24,"identifiers":1492},"10.1109\u002FPROC.1987.13704",{"doi":1491},{"id":24,"text":1494,"url":24,"identifiers":1495},"{10} F. Douglis , F. Kaashoek , B. Marsh , R. Caceres , K. Lai and J. Tauber , \" Storage Alternatives for Mobile Computers \", Proc. 1994 Symposium on Operating Systems Design and Implementation, OSDI , November 1994 . {10} F. Douglis, F. Kaashoek, B. Marsh, R. Caceres, K. Lai and J. Tauber, \"Storage Alternatives for Mobile Computers\", Proc. 1994 Symposium on Operating Systems Design and Implementation, OSDI, November 1994.",{},{"id":24,"text":1497,"url":24,"identifiers":1498},"10.1109\u002FPROC.1987.13703",{"doi":1497},{"id":24,"text":1500,"url":24,"identifiers":1501},"10.1145\u002F263105.263137",{"doi":1500},{"id":24,"text":1503,"url":24,"identifiers":1504},"{13} J.J. Garcia-Luna-Aceves Chane L. Fullmer and Ewerton Madruga \"Wireless Mobile Internetworking\" Manuscript.  {13} J.J. Garcia-Luna-Aceves Chane L. Fullmer and Ewerton Madruga \"Wireless Mobile Internetworking\" Manuscript.",{},{"id":24,"text":1506,"url":24,"identifiers":1507},"10.1007\u002FBF01200845",{"doi":1506},{"id":24,"text":1509,"url":24,"identifiers":1510},"{15} E.P. Harris and K.W. Warren , \" Low Power Technologies: A System Perspective \", 3rd International Workshop on Mobile Multimedia Communications , Princeton, NJ , September 25-27, 1996 . {15} E.P. Harris and K.W. Warren, \"Low Power Technologies: A System Perspective\", 3rd International Workshop on Mobile Multimedia Communications, Princeton, NJ, September 25-27, 1996.",{},{"id":24,"text":1512,"url":24,"identifiers":1513},"10.1109\u002FPROC.1987.13702",{"doi":1512},{"id":24,"text":1515,"url":24,"identifiers":1516},"{17} P. Karn , \" MACA - a New Channel Access Method for Packet Radio\" , in ARRL\u002FCRRL Amateur Radio 9th Computer Networking Conference , pp. 134 - 140 , 1990 . {17} P. Karn, \"MACA - a New Channel Access Method for Packet Radio\", in ARRL\u002FCRRL Amateur Radio 9th Computer Networking Conference, pp. 134-140, 1990.",{},{"id":24,"text":1518,"url":24,"identifiers":1519},"{18} B. M. Leiner , D. L. Neilson and F. A. Tobagi ( Eds .) , Proceedings of the IEEE, Vol. 75(1) , Special Issue on Packet Radio Networks , January 1987 . {18} B. M. Leiner, D. L. Neilson and F. A. Tobagi (Eds.), Proceedings of the IEEE, Vol. 75(1), Special Issue on Packet Radio Networks, January 1987.",{},{"id":24,"text":1521,"url":24,"identifiers":1522},"{19} K. Li , R. Kumpf , P. Horton and T. Anderson , \" A Quantitative Analysis of Disk Drive Power Management in Portable Computers \", Proceedings 1994 USENIX , San Francisco, CA , pp. 279 - 291 , 1994 . {19} K. Li, R. Kumpf, P. Horton and T. Anderson, \"A Quantitative Analysis of Disk Drive Power Management in Portable Computers\", Proceedings 1994 USENIX, San Francisco, CA, pp. 279-291, 1994.",{},{"id":24,"text":1524,"url":24,"identifiers":1525},"{20} Chunhung Richard Lin and Mario Gerla, \"Asynchronous Multimedia Multihop Wireless Networks\" , Proceedings IEEE INFOCOM'97 , ( 1997 ). {20} Chunhung Richard Lin and Mario Gerla, \"Asynchronous Multimedia Multihop Wireless Networks\", Proceedings IEEE INFOCOM'97, (1997).",{},{"id":24,"text":1527,"url":24,"identifiers":1528},"10.1109\u002FICC.1995.524295",{"doi":1527},{"id":24,"text":1530,"url":24,"identifiers":1531},"10.1109\u002F49.622910",{"doi":1530},{"id":24,"text":1533,"url":24,"identifiers":1534},"{23} W. Mangione-Smith , P. S. Ghang , S. Nazareth , P. Lettieri , W. Boring and R. Jain , \" A low power architecture for wireless multimedia systems: Lessons learned from building a power hog \", Proc. 1996 International Symp. on Low Power Electronics and Design , Monterey, CA , pp. 23 - 28 . {23} W. Mangione-Smith, P. S. Ghang, S. Nazareth, P. Lettieri, W. Boring and R. Jain, \"A low power architecture for wireless multimedia systems: Lessons learned from building a power hog\", Proc. 1996 International Symp. on Low Power Electronics and Design, Monterey, CA, pp. 23-28.",{},{"id":24,"text":1536,"url":24,"identifiers":1537},"10.1145\u002F215530.215560",{"doi":1536},{"id":24,"text":1539,"url":24,"identifiers":1540},"{25} D. Petras and A. Krämling , \" MAC protocol with polling and fast collision resolution for an ATM air interface \", Proc. IEEE ATM'96 workshop , San Francisco, CA , Aug. 1996 . {25} D. Petras and A. Krämling, \"MAC protocol with polling and fast collision resolution for an ATM air interface\", Proc. IEEE ATM'96 workshop, San Francisco, CA, Aug. 1996.",{},{"id":24,"text":1542,"url":24,"identifiers":1543},"{26} Christian Röhl, H. Woesner and A. Wolisz , \" A Short Look on Power Saving Mechanisms in the Wireless LAN Standard Draft IEEE 802.11 \", Proc. of the 6th WINLAB Workshop on Third Generation Wireless Systems , March 1997 . {26} Christian Röhl, H. Woesner and A. Wolisz, \"A Short Look on Power Saving Mechanisms in the Wireless LAN Standard Draft IEEE 802.11\", Proc. of the 6th WINLAB Workshop on Third Generation Wireless Systems, March 1997.",{},{"id":24,"text":1545,"url":24,"identifiers":1546},"10.1109\u002F49.56379",{"doi":1545},{"id":24,"text":1548,"url":24,"identifiers":1549},"10.1023\u002FA:1019128411323",{"doi":1548},{"id":24,"text":1551,"url":24,"identifiers":1552},"{29} Cheng-shong Wu and Victor O.K . Li, \"Receiver-Initiated Busy-Tone Multiple Access in Packet Radio Networks \", Proceedings ACM SIGCOMM'87 Workshop , Stowe, Vermont, Aug. 11-15 , Vol. 17(5), pp. 336- 342 , 1987 . {29} Cheng-shong Wu and Victor O.K. Li, \"Receiver-Initiated Busy-Tone Multiple Access in Packet Radio Networks\", Proceedings ACM SIGCOMM'87 Workshop, Stowe, Vermont, Aug. 11-15, Vol. 17(5), pp. 336-342, 1987.",{},{"id":24,"text":1554,"url":24,"identifiers":1555},"10.1109\u002FVETEC.1997.605397",{"doi":1554},{"id":24,"text":1557,"url":24,"identifiers":1558},"{31} Krishna M. Sivalingam M. B. Srivastava P. Agrawal and J-C. Chen \"Low-Power Access Protocols Based on Scheduling for Wireless and Mobile ATM Networks\" Manuscript http:\u002F\u002Fwww.eecs.wsu.edu\u002F~krishna.  {31} Krishna M. Sivalingam M. B. Srivastava P. Agrawal and J-C. Chen \"Low-Power Access Protocols Based on Scheduling for Wireless and Mobile ATM Networks\" Manuscript http:\u002F\u002Fwww.eecs.wsu.edu\u002F~krishna.",{},{"id":24,"text":1560,"url":24,"identifiers":1561},"{32} W. Mangione-Smith and P.S. Ghang , \" A low power medium access control protocol for portable multi-media systems \", 3rd International Workshop on Mobile Multimedia Communications , September 25-27, 1996 . {32} W. Mangione-Smith and P.S. Ghang, \"A low power medium access control protocol for portable multi-media systems\", 3rd International Workshop on Mobile Multimedia Communications, September 25-27, 1996.",{},{"id":24,"text":1563,"url":24,"identifiers":1564},"{33} M. Stemm and P. Gauthier and D. Harada , \" Reducing power consumption of network interfaces in hand-held devices \", 3rd International Workshop on Mobile Multimedia Communications , September 25-27, 1996 . {33} M. Stemm and P. Gauthier and D. Harada, \"Reducing power consumption of network interfaces in hand-held devices\", 3rd International Workshop on Mobile Multimedia Communications, September 25-27, 1996.",{},{"id":24,"text":1566,"url":24,"identifiers":1567},"10.1109\u002FTCOM.1975.1092767",{"doi":1566},{"id":24,"text":1569,"url":24,"identifiers":1570},"{35} H. S. Wilf , Algorithms and Complexity , Prentice Hall , 1986 . {35} H. S. Wilf, Algorithms and Complexity, Prentice Hall, 1986.",{},{"id":24,"text":1572,"url":24,"identifiers":1573},"{36} S. Zdonik , M. Franklin , R. Alonso and S. Acharya , \" Are \"disks in the air\" just pie in the sky? \", IEEE Workshop on Mobile Computing Systems and Applications , Santa Cruz, CA , pp. 12 - 19 , December 1994 . {36} S. Zdonik, M. Franklin, R. Alonso and S. Acharya, \"Are \"disks in the air\" just pie in the sky?\", IEEE Workshop on Mobile Computing Systems and Applications, Santa Cruz, CA, pp. 12-19, December 1994.",{},{"id":24,"text":1575,"url":24,"identifiers":1576},"{37} Michele Zorzi and R. R. Rao , \" energy Management in wireless Communications \", Proc. 6th WINLAB Workshop on Third Generation Wireless Information Networks , March 1997 . {37} Michele Zorzi and R. R. Rao, \"energy Management in wireless Communications\", Proc. 6th WINLAB Workshop on Third Generation Wireless Information Networks, March 1997.",{},{"id":1578,"createTime":1579,"updateTime":1579,"relativeEntities":1580,"slug":1581,"properties":1582,"entityType":128,"verifyStatus":129,"verifyTime":1594,"verifyNote":131,"syncStatus":23,"languages":1595,"translateLanguages":24,"viewCount":25,"primaryUrl":1596,"fullTextUrl":24,"authors":1597,"publicationType":211,"publisherRelationship":1640,"citationCount":1289,"citationInfo":1672,"publishDate":1674,"publishYear":1675,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":1676,"isForceReanalyzing":351},"ff0cb6b0-6f81-48c2-a3ab-3344affbea80","2024-12-28T15:59:17.537+00:00",[],"Aggregation-and-conformance-in-differentiated-service-networks",{"mag":1583,"keywords":1585,"openalex":1586,"abstract":1588,"title":1590,"doi":1592},{"VOID":1584},"2109130057",{},{"VOID":1587},"W2109130057",{"EN":1589},"\u003Cjats:p>\n            The Differentiated Service (Diff-Serv) architecture [1] advocates a \nmodel based on different “granularity” at network edges and within the network. In particular, core routers are only required to act on a few\n            \u003Cjats:italic>aggregates\u003C\u002Fjats:italic>\n            that are meant to offer a pre-defined set of service levels. The use of aggregation raises a number of questions for end-to-end services, in particular when crossing domain boundaries where policing actions may be applied. This paper focuses on the impact of such policing actions in the context of individual and the bulk services built on top of the Expedited Forwarding (EF) [7] per-hop-behavior (PHB). The findings of this investigation confirm and quantify the expected need for reshaping at network boundaries, and identify a number of somewhat unexpected behaviors. Recommendations are also made for when reshaping is not available.\n          \u003C\u002Fjats:p>",{"EN":1591},"Aggregation and conformance in differentiated service networks",{"VOID":1593},"10.1145\u002F382176.383018","2024-12-28T15:59:17.536+00:00",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F382176.383018",[1598,1619],{"id":1599,"sortIndex":25,"researcher":24,"roles":1600,"affiliations":1601,"properties":1612},"bb7584c2-6795-42ad-aa19-09b4ee4ae016",[],[1602],{"id":1603,"sortIndex":25,"affiliation":1604,"properties":24},"5a5962b2-f694-4f7b-afb5-95ddc5785677",{"id":1605,"createTime":1606,"updateTime":1606,"relativeEntities":1607,"slug":1608,"properties":1609,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"a2a5f897-e0d7-4784-8d51-f7c338e6d5b3","2024-12-28T15:59:17.545+00:00",[],"Dept-Elec-Eng-U-Pennsylvania-200-South-33rd-Street-Philadelphia-PA",{"title":1610},{"EN":1611},"Dept. Elec. Eng., U. Pennsylvania, 200 South 33rd Street, Philadelphia, PA",{"openalex":1613,"orcid":1615,"title":1617},{"VOID":1614},"A5070918610",{"VOID":1616},"https:\u002F\u002Forcid.org\u002F0000-0002-8928-9984",{"EN":1618},"R. Guérin",{"id":1620,"sortIndex":54,"researcher":24,"roles":1621,"affiliations":1622,"properties":1633},"59d75be1-5ddd-49e6-a6ec-dd077b593d56",[],[1623],{"id":1624,"sortIndex":25,"affiliation":1625,"properties":24},"197f7a11-d048-4dac-aa89-1e594689be15",{"id":1626,"createTime":1627,"updateTime":1627,"relativeEntities":1628,"slug":1629,"properties":1630,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"d4dd46b4-ba46-47e1-8712-e423520e00cb","2024-12-28T15:59:17.557+00:00",[],"Dept-Communications-U-P-de-Valencia-Carretera-Nazaret-Oliva-46730-Grau-de-Gandia-Spain",{"title":1631},{"EN":1632},"Dept. Communications, U.P. de Valencia, Carretera Nazaret-Oliva, 46730, Grau de Gandia, Spain",{"openalex":1634,"orcid":1636,"title":1638},{"VOID":1635},"A5002611857",{"VOID":1637},"https:\u002F\u002Forcid.org\u002F0000-0002-0894-9494",{"EN":1639},"Vicent Pla",{"url":24,"publisher":1641,"properties":1666},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1642,"slug":10,"properties":1643,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":1649,"manageAffiliations":1650,"indexDatabases":1651,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":1644,"issn":1645,"introduce":1646,"eissn":1647,"title":1648},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[1652,1659],{"id":88,"indexDatabase":1653,"url":103,"indexYears":24,"academicFieldIds":1658,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":1654,"label":1655,"description":1656,"key":99,"publicationTags":1657,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":1660,"url":81,"indexYears":82,"academicFieldIds":1665,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":1661,"label":1662,"description":1663,"key":78,"publicationTags":1664,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":1667,"pages":1669,"issue":1671},{"VOID":1668},"31",{"VOID":1670},"21-32",{"VOID":1130},{"total":1289,"publishYear":24,"statisticByYear":1673},{"2015":54},"2001-01-01",2001,[],{"id":1678,"createTime":1679,"updateTime":1679,"relativeEntities":1680,"slug":1681,"properties":1682,"entityType":128,"verifyStatus":129,"verifyTime":1679,"verifyNote":131,"syncStatus":23,"languages":1694,"translateLanguages":24,"viewCount":25,"primaryUrl":1695,"fullTextUrl":24,"authors":1696,"publicationType":211,"publisherRelationship":1752,"citationCount":1784,"citationInfo":1785,"publishDate":1787,"publishYear":1788,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":1789,"isForceReanalyzing":351},"32ef94e5-05fb-4350-ba1c-f5c84d8c50a8","2025-01-25T15:03:45.309+00:00",[],"Towards-a-Context-Aware-Forwarding-Plane-in-Named-Data-Networking-supporting-QoS",{"mag":1683,"keywords":1685,"openalex":1686,"abstract":1688,"title":1690,"doi":1692},{"VOID":1684},"2579748344",{},{"VOID":1687},"W2579748344",{"EN":1689},"\u003Cjats:p>The emergence of Information-Centric Networking~(ICN) provides considerable opportunities for context-aware data distribution in the network's forwarding plane. While packet forwarding in classical IP-based networks is basically predetermined by routing, ICN foresees an adaptive forwarding plane considering the requirements of network applications. As research in this area is still at an early stage, most of the work so far focused on providing the basic functionality, rather than on considering the available context information to improve Quality of Service (QoS). This article investigates to which extent existing forwarding strategies take account of the available context information and can therefore increase service quality. The article examines a typical scenario encompassing different user applications (Voice over IP, video streaming, and classical data transfer) with varying demands (context), and evaluates how well the applications' requirements are met by the existing strategies.\u003C\u002Fjats:p>",{"EN":1691},"Towards a Context-Aware Forwarding Plane in Named Data Networking supporting QoS",{"VOID":1693},"10.1145\u002F3041027.3041029",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F3041027.3041029",[1697,1718,1735],{"id":1698,"sortIndex":160,"researcher":24,"roles":1699,"affiliations":1700,"properties":1711},"dc08e48d-a8e6-436b-8bd0-e7417354afeb",[],[1701],{"id":1702,"sortIndex":25,"affiliation":1703,"properties":24},"679f06ef-10b1-4745-966a-92ea0b295a0b",{"id":1704,"createTime":1705,"updateTime":1705,"relativeEntities":1706,"slug":1707,"properties":1708,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"4f459600-9036-4595-b356-b3ccdf213626","2025-01-25T15:03:45.323+00:00",[],"Alpen-Adria-Universit%C3%A4t-Klagenfurt",{"title":1709},{"EN":1710},"Alpen-Adria-Universität Klagenfurt",{"openalex":1712,"orcid":1714,"title":1716},{"VOID":1713},"A5054727932",{"VOID":1715},"https:\u002F\u002Forcid.org\u002F0000-0003-1114-2584",{"EN":1717},"Hermann Hellwagner",{"id":1719,"sortIndex":54,"researcher":24,"roles":1720,"affiliations":1721,"properties":1728},"814f77b1-1f1e-4937-a9c1-5990d0812b8e",[],[1722],{"id":1723,"sortIndex":25,"affiliation":1724,"properties":24},"0306b611-d5d7-4a4a-b73a-3a73be7c02bc",{"id":1704,"createTime":1705,"updateTime":1705,"relativeEntities":1725,"slug":1707,"properties":1726,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":1727},{"EN":1710},{"openalex":1729,"orcid":1731,"title":1733},{"VOID":1730},"A5082997621",{"VOID":1732},"https:\u002F\u002Forcid.org\u002F0000-0003-1954-019X",{"EN":1734},"Benjamin Rainer",{"id":1736,"sortIndex":25,"researcher":24,"roles":1737,"affiliations":1738,"properties":1745},"a6b784e7-5041-4b63-8e4e-e95b719f3cc5",[],[1739],{"id":1740,"sortIndex":25,"affiliation":1741,"properties":24},"eea8e68c-c01b-4a22-bc7a-512cb0d0a29e",{"id":1704,"createTime":1705,"updateTime":1705,"relativeEntities":1742,"slug":1707,"properties":1743,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":1744},{"EN":1710},{"openalex":1746,"orcid":1748,"title":1750},{"VOID":1747},"A5028552669",{"VOID":1749},"https:\u002F\u002Forcid.org\u002F0000-0001-9698-7038",{"EN":1751},"Daniel Posch",{"url":24,"publisher":1753,"properties":1778},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1754,"slug":10,"properties":1755,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":1761,"manageAffiliations":1762,"indexDatabases":1763,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":1756,"issn":1757,"introduce":1758,"eissn":1759,"title":1760},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[1764,1771],{"id":88,"indexDatabase":1765,"url":103,"indexYears":24,"academicFieldIds":1770,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":1766,"label":1767,"description":1768,"key":99,"publicationTags":1769,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":1772,"url":81,"indexYears":82,"academicFieldIds":1777,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":1773,"label":1774,"description":1775,"key":78,"publicationTags":1776,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":1779,"pages":1781,"issue":1783},{"VOID":1780},"47",{"VOID":1782},"4-14",{"VOID":1130},12,{"total":1784,"publishYear":24,"statisticByYear":1786},{"2017":396,"2018":488,"2019":54,"2022":54},"2017-01-17",2017,[1790,1793,1796,1799,1802,1805,1808,1811,1814,1817,1820,1823,1826,1829],{"id":24,"text":1791,"url":24,"identifiers":1792},"G. Xylomenos , C. Ververidis , V. Siris , N. Fotiou , C. Tsilopoulos , X. Vasilakos , K. Katsaros , and G. Polyzos , \" A Survey of Information-Centric Networking Research,\" IEEE Comm. Surveys and Tutorials , vol. 16 , no. 2, 2014. G. Xylomenos, C. Ververidis, V. Siris, N. Fotiou, C. Tsilopoulos, X. Vasilakos, K. Katsaros, and G. Polyzos, \"A Survey of Information-Centric Networking Research,\" IEEE Comm. Surveys and Tutorials, vol. 16, no. 2, 2014.",{},{"id":24,"text":1794,"url":24,"identifiers":1795},"10.1145\u002F2656877.2656887",{"doi":1794},{"id":24,"text":1797,"url":24,"identifiers":1798},"10.1016\u002Fj.comcom.2013.01.005",{"doi":1797},{"id":24,"text":1800,"url":24,"identifiers":1801},"D. Posch , B. Rainer , and H. Hellwagner , \" SAF: Stochastic Adaptive Forwarding in Named Data Networking ,\" IEEE\u002FACM Transactions on Networking , vol. (to appear), p. 14, 2016. D. Posch, B. Rainer, and H. Hellwagner, \"SAF: Stochastic Adaptive Forwarding in Named Data Networking,\" IEEE\u002FACM Transactions on Networking, vol. (to appear), p. 14, 2016.",{},{"id":24,"text":1803,"url":24,"identifiers":1804},"G. Carofiglio , M. Gallo , L. Muscariello , M. Papalini , and S. Wang , \" Optimal Multipath Congestion Control and Request Forwarding in Information-Centric Networks,\" in Proc. of 21st IEEE Int . Conf. on Network Protocols , 2013 . G. Carofiglio, M. Gallo, L. Muscariello, M. Papalini, and S. Wang, \"Optimal Multipath Congestion Control and Request Forwarding in Information-Centric Networks,\" in Proc. of 21st IEEE Int. Conf. on Network Protocols, 2013.",{},{"id":24,"text":1806,"url":24,"identifiers":1807},"A. Udugama , X. Zhang , K. Kuladinithi , and C. Goerg , \" An On-demand Multi-Path Interest Forwarding Strategy for Content Retrievals in CCN,\" in IEEE NOMS , 2014 . A. Udugama, X. Zhang, K. Kuladinithi, and C. Goerg, \"An On-demand Multi-Path Interest Forwarding Strategy for Content Retrievals in CCN,\" in IEEE NOMS, 2014.",{},{"id":24,"text":1809,"url":24,"identifiers":1810},"V. Jacobson , D. K. Smetters , J. D. Thornton , M. F. Plass , N. H. Briggs , and R. L. Braynard , \" Networking Named Content,\" in Proc. of the 5th Int . Conference on Emerging Networking Experiments and Technologies. ACM , 2009 . V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, \"Networking Named Content,\" in Proc. of the 5th Int. Conference on Emerging Networking Experiments and Technologies. ACM, 2009.",{},{"id":24,"text":1812,"url":24,"identifiers":1813},"10.1109\u002FMMUL.2011.71",{"doi":1812},{"id":24,"text":1815,"url":24,"identifiers":1816},"C. Sieber , T. Hoßfeld , T. Zinner , P. Tran-Gia , and C. Timmerer , \" Implementation and User-centric Comparison of a Novel Adaptation Logic for DASH with SVC,\" in IFIP IEEE Int . Symp. on Integrated Network Management , 2013 . C. Sieber, T. Hoßfeld, T. Zinner, P. Tran-Gia, and C. Timmerer, \"Implementation and User-centric Comparison of a Novel Adaptation Logic for DASH with SVC,\" in IFIP IEEE Int. Symp. on Integrated Network Management, 2013.",{},{"id":24,"text":1818,"url":24,"identifiers":1819},"C. Kreuzberger , D. Posch , and H. Hellwagner , \" A Scalable Video Coding Dataset and Toolchain for Dynamic Adaptive Streaming over HTTP,\" in Proc. of the 6th ACM Conference on Multimedia Systems , 2015 . C. Kreuzberger, D. Posch, and H. Hellwagner, \"A Scalable Video Coding Dataset and Toolchain for Dynamic Adaptive Streaming over HTTP,\" in Proc. of the 6th ACM Conference on Multimedia Systems, 2015.",{},{"id":24,"text":1821,"url":24,"identifiers":1822},"V. Jacobson , D. K. Smetters , N. H. Briggs , M. F. Plass , P. Stewart , J. D. Thornton , and R. L. Braynard , \" VoCCN: Voice over Content-Centric Networks,\" in Proc. of the 2009 Workshop on Re-architecting the Internet . ACM , 2009 . V. Jacobson, D. K. Smetters, N. H. Briggs, M. F. Plass, P. Stewart, J. D. Thornton, and R. L. Braynard, \"VoCCN: Voice over Content-Centric Networks,\" in Proc. of the 2009 Workshop on Re-architecting the Internet. ACM, 2009.",{},{"id":24,"text":1824,"url":24,"identifiers":1825},"ITU-T \"Pulse Code Modulation (PCM) of Voice Frequencies \" ITU-T Recommendation G.711 1990.  ITU-T \"Pulse Code Modulation (PCM) of Voice Frequencies \" ITU-T Recommendation G.711 1990.",{},{"id":24,"text":1827,"url":24,"identifiers":1828},"10.5555\u002F2440188",{"doi":1827},{"id":24,"text":1830,"url":24,"identifiers":1831},"10.1145\u002F2829988.2787486",{"doi":1830},{"id":1833,"createTime":1834,"updateTime":1834,"relativeEntities":1835,"slug":1836,"properties":1837,"entityType":128,"verifyStatus":129,"verifyTime":1848,"verifyNote":131,"syncStatus":23,"languages":1849,"translateLanguages":24,"viewCount":25,"primaryUrl":1850,"fullTextUrl":24,"authors":1851,"publicationType":211,"publisherRelationship":2032,"citationCount":2064,"citationInfo":2065,"publishDate":2077,"publishYear":2078,"citationAnalyzeStatus":23,"lastCitationAnalyze":24,"indexDatabases":24,"openAccess":24,"references":2079,"isForceReanalyzing":351},"5c8c77cc-f54e-4c57-baf7-529238868c8f","2025-01-25T15:03:43.711+00:00",[],"Named-data-networking",{"mag":1838,"keywords":1840,"openalex":1841,"abstract":1843,"title":1845,"doi":1847},{"VOID":1839},"2155903900",{},{"VOID":1842},"W2155903900",{"EN":1844},"\u003Cjats:p>\n            Named Data Networking (NDN) is one of five projects funded by the U.S. National Science Foundation under its Future Internet Architecture Program. NDN has its roots in an earlier project, Content-Centric Networking (CCN), which Van Jacobson first publicly presented in 2006. The NDN project investigates Jacobson's proposed evolution from today's host-centric network architecture (IP) to a\n            \u003Cjats:italic>data-centric\u003C\u002Fjats:italic>\n            network architecture (NDN). This conceptually simple shift has far-reaching implications for how we design, develop, deploy, and use networks and applications. We describe the motivation and vision of this new architecture, and its basic components and operations. We also provide a snapshot of its current design, development status, and research challenges. More information about the project, including prototype implementations, publications, and annual reports, is available on named-data.net.\n          \u003C\u002Fjats:p>",{"EN":1846},"Named data networking",{"VOID":1794},"2025-01-25T15:03:43.710+00:00",[133],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F2656877.2656887",[1852,1874,1894,1911,1928,1949,1970,1992,2011],{"id":1853,"sortIndex":396,"researcher":24,"roles":1854,"affiliations":1855,"properties":1867},"01dc3e8b-bc83-4bad-a246-15d36964a7b0",[],[1856],{"id":1857,"sortIndex":25,"affiliation":1858,"properties":24},"05fd103b-10ec-4328-bb5d-0468ef25e2f6",{"id":1859,"createTime":1860,"updateTime":1861,"relativeEntities":1862,"slug":1863,"properties":1864,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"c170a95c-822a-4bdf-9446-1b110ab90867","2024-01-15T16:10:43.938+00:00","2025-01-30T18:14:51.133+00:00",[],"Colorado-State-University-Fort-Collins-CO-USA",{"title":1865},{"VI":1866},"Colorado State University, Fort Collins, CO, USA",{"openalex":1868,"orcid":1870,"title":1872},{"VOID":1869},"A5105352599",{"VOID":1871},"https:\u002F\u002Forcid.org\u002F0009-0008-3090-0540",{"EN":1873},"Christos Papadopoulos",{"id":1875,"sortIndex":160,"researcher":24,"roles":1876,"affiliations":1877,"properties":1889},"50a0e11a-7be7-41c8-b300-9932d9448349",[],[1878],{"id":1879,"sortIndex":25,"affiliation":1880,"properties":24},"42868e31-0bb9-4b29-9d3e-524646c46001",{"id":1881,"createTime":1882,"updateTime":1883,"relativeEntities":1884,"slug":1885,"properties":1886,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"4b189c9f-477f-4cfc-a478-a23f51058732","2024-02-08T05:48:59.168+00:00","2025-01-25T15:03:43.728+00:00",[],"UCLA-Los-Angeles-CA-USA",{"title":1887},{"VI":1888},"UCLA, Los Angeles, CA, USA",{"openalex":1890,"title":1892},{"VOID":1891},"A5076857929",{"EN":1893},"Jeffrey A Burke",{"id":1895,"sortIndex":54,"researcher":24,"roles":1896,"affiliations":1897,"properties":1904},"37cba0f4-bc40-46fd-a623-40965b5cda89",[],[1898],{"id":1899,"sortIndex":25,"affiliation":1900,"properties":24},"5521cd13-a2ad-4dc5-8f2f-5c6d58d522d6",{"id":1881,"createTime":1882,"updateTime":1883,"relativeEntities":1901,"slug":1885,"properties":1902,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":1903},{"VI":1888},{"openalex":1905,"orcid":1907,"title":1909},{"VOID":1906},"A5063486829",{"VOID":1908},"https:\u002F\u002Forcid.org\u002F0000-0003-0420-1267",{"EN":1910},"Alexander Afanasyev",{"id":1912,"sortIndex":25,"researcher":24,"roles":1913,"affiliations":1914,"properties":1921},"00abd7ae-c05a-4a14-9099-65b7c5aac1ed",[],[1915],{"id":1916,"sortIndex":25,"affiliation":1917,"properties":24},"ac24c958-e93c-4795-ab34-c96671b70b1f",{"id":1881,"createTime":1882,"updateTime":1883,"relativeEntities":1918,"slug":1885,"properties":1919,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},[],{"title":1920},{"VI":1888},{"openalex":1922,"orcid":1924,"title":1926},{"VOID":1923},"A5100350696",{"VOID":1925},"https:\u002F\u002Forcid.org\u002F0000-0002-9471-4500",{"EN":1927},"Lixia Zhang",{"id":1929,"sortIndex":488,"researcher":24,"roles":1930,"affiliations":1931,"properties":1942},"d979b1fa-b633-49d6-a697-76da7e1c87b0",[],[1932],{"id":1933,"sortIndex":25,"affiliation":1934,"properties":24},"ca59481d-1f61-4ade-b78c-9f9b5f749775",{"id":1935,"createTime":1936,"updateTime":1936,"relativeEntities":1937,"slug":1938,"properties":1939,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"96c6ef5c-3462-431c-955a-2abb280cb54b","2025-01-25T15:03:43.770+00:00",[],"UC-San-Diego-La-Jolla-CA-USA",{"title":1940},{"EN":1941},"UC San Diego, La Jolla, CA, USA",{"openalex":1943,"orcid":1945,"title":1947},{"VOID":1944},"A5072282499",{"VOID":1946},"https:\u002F\u002Forcid.org\u002F0000-0003-4824-3493",{"EN":1948},"kc claffy",{"id":1950,"sortIndex":904,"researcher":24,"roles":1951,"affiliations":1952,"properties":1963},"a0e7de00-8eb6-4ba7-9a85-bd2377bc6611",[],[1953],{"id":1954,"sortIndex":25,"affiliation":1955,"properties":24},"8fecf352-0ed8-444b-8b76-617c6f7e6ff2",{"id":1956,"createTime":1957,"updateTime":1957,"relativeEntities":1958,"slug":1959,"properties":1960,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"3c58498a-1001-4cf7-afe0-bb1a13e34e4c","2025-01-25T15:03:43.807+00:00",[],"MemphisUniversity-Memphis-TN-USA",{"title":1961},{"EN":1962},"MemphisUniversity, Memphis, TN, USA",{"openalex":1964,"orcid":1966,"title":1968},{"VOID":1965},"A5100363636",{"VOID":1967},"https:\u002F\u002Forcid.org\u002F0000-0001-7925-7957",{"EN":1969},"Lan Wang",{"id":1971,"sortIndex":1462,"researcher":24,"roles":1972,"affiliations":1973,"properties":1985},"181f73d4-980f-4d54-800f-47b6f38cad05",[],[1974],{"id":1975,"sortIndex":25,"affiliation":1976,"properties":24},"dac7311d-ff72-4f20-9b95-5182874e6678",{"id":1977,"createTime":1978,"updateTime":1979,"relativeEntities":1980,"slug":1981,"properties":1982,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"15707279-b045-4a6b-93d8-11534442f556","2023-12-24T13:49:28.552+00:00","2025-02-05T01:19:52.798+00:00",[],"Arizona-State-University-Tempe-AZ-USA",{"title":1983},{"VI":1984},"Arizona State University, Tempe, AZ USA",{"openalex":1986,"orcid":1988,"title":1990},{"VOID":1987},"A5050010654",{"VOID":1989},"https:\u002F\u002Forcid.org\u002F0009-0001-5333-8465",{"EN":1991},"Beichuan Zhang",{"id":1993,"sortIndex":178,"researcher":24,"roles":1994,"affiliations":1995,"properties":2006},"5efde983-146d-4e80-be2f-fdc6987589f0",[],[1996],{"id":1997,"sortIndex":25,"affiliation":1998,"properties":24},"7daa07cb-4a45-4613-b9b9-71ac6c275364",{"id":1999,"createTime":2000,"updateTime":2000,"relativeEntities":2001,"slug":2002,"properties":2003,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"57aa4378-64f9-4b9d-a824-44f1cd42814c","2025-01-25T15:03:43.757+00:00",[],"UCLA-Los-Angles-CA-USA",{"title":2004},{"EN":2005},"UCLA, Los Angles, CA, USA",{"openalex":2007,"title":2009},{"VOID":2008},"A5041215029",{"EN":2010},"Van Jacobson",{"id":2012,"sortIndex":470,"researcher":24,"roles":2013,"affiliations":2014,"properties":2025},"d7302410-4f23-4910-ab60-57e2d56a661e",[],[2015],{"id":2016,"sortIndex":25,"affiliation":2017,"properties":24},"eed2c198-a964-468c-8149-551ed0a93baa",{"id":2018,"createTime":2019,"updateTime":2019,"relativeEntities":2020,"slug":2021,"properties":2022,"entityType":53,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25},"968abcc4-2f30-4b9d-a6fd-40e306c9098f","2025-01-25T15:03:43.783+00:00",[],"Washington-University-St-Louis-CA-USA",{"title":2023},{"EN":2024},"Washington University, St. Louis, CA, USA",{"openalex":2026,"orcid":2028,"title":2030},{"VOID":2027},"A5081087040",{"VOID":2029},"https:\u002F\u002Forcid.org\u002F0000-0003-4222-5091",{"EN":2031},"Patrick Crowley",{"url":24,"publisher":2033,"properties":2058},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":2034,"slug":10,"properties":2035,"entityType":22,"verifyStatus":23,"verifyTime":24,"verifyNote":24,"syncStatus":23,"languages":24,"translateLanguages":24,"viewCount":25,"subjectFields":2041,"manageAffiliations":2042,"indexDatabases":2043,"url":106,"thumbnailPath":24,"statistic":24,"gsStatistic":24,"type":24,"analyzePriority":24},[],{"country":2036,"issn":2037,"introduce":2038,"eissn":2039,"title":2040},{"VOID":13},{"VOID":15},{"EN":17},{"VOID":19},{"EN":21},[],[],[2044,2051],{"id":88,"indexDatabase":2045,"url":103,"indexYears":24,"academicFieldIds":2050,"indexDatabaseRanking":24},{"id":90,"createTime":91,"updateTime":92,"relativeEntities":2046,"label":2047,"description":2048,"key":99,"publicationTags":2049,"standard":24},[],{"EN":95,"VI":95},{"VI":97,"EN":98},[101,102],[105],{"id":68,"indexDatabase":2052,"url":81,"indexYears":82,"academicFieldIds":2057,"indexDatabaseRanking":86},{"id":70,"createTime":71,"updateTime":72,"relativeEntities":2053,"label":2054,"description":2055,"key":78,"publicationTags":2056,"standard":24},[],{"EN":75,"VI":75},{"EN":75,"VI":77},[80],[84,85],{"volume":2059,"pages":2061,"issue":2063},{"VOID":2060},"44",{"VOID":2062},"66-73",{"VOID":1456},1992,{"total":2064,"publishYear":24,"statisticByYear":2066},{"2012":160,"2013":903,"2014":1138,"2015":2067,"2016":2068,"2017":2069,"2018":2070,"2019":2071,"2020":2072,"2021":2073,"2022":2074,"2023":2075,"2024":2076},98,188,239,238,263,255,203,193,165,93,"2014-07-28",2014,[2080,2083,2086,2089,2092,2095,2098,2101,2104,2107,2110,2113,2116,2119,2122,2125,2128,2131,2134,2137,2140,2143,2146,2149,2152,2154,2157,2160,2163,2166],{"id":24,"text":2081,"url":24,"identifiers":2082},"NS-3-based NDN simulator. http:\u002F\u002Fndnsim.net.  NS-3-based NDN simulator. http:\u002F\u002Fndnsim.net.",{},{"id":24,"text":2084,"url":24,"identifiers":2085},"10.1145\u002F2018584.2018586",{"doi":2084},{"id":24,"text":2087,"url":24,"identifiers":2088},"10.5555\u002F353677.353678",{"doi":2087},{"id":24,"text":2090,"url":24,"identifiers":2091},"A. Afanasyev , P. Mahadevan , I. Moiseenko , E. Uzun , and L. Zhang . Interest flooding attack and countermeasures in Named Data Networking . In Proc. of IFIP Networking , May 2013 . A. Afanasyev, P. Mahadevan, I. Moiseenko, E. Uzun, and L. Zhang. Interest flooding attack and countermeasures in Named Data Networking. In Proc. of IFIP Networking, May 2013.",{},{"id":24,"text":2093,"url":24,"identifiers":2094},"M. Boguná , F. Papadopoulos , and D. Krioukov . Sustaining the Internet with Hyperbolic Mapping. Nature Comms , 1 : 62 , 2010 . M. Boguná, F. Papadopoulos, and D. Krioukov. Sustaining the Internet with Hyperbolic Mapping. Nature Comms, 1:62, 2010.",{},{"id":24,"text":2096,"url":24,"identifiers":2097},"10.1109\u002FINFCOMW.2013.6970725",{"doi":2096},{"id":24,"text":2099,"url":24,"identifiers":2100},"CCNx. Ccnx software. http:\u002F\u002Fwww.ccnx.org.  CCNx. Ccnx software. http:\u002F\u002Fwww.ccnx.org.",{},{"id":24,"text":2102,"url":24,"identifiers":2103},"P. Crowley . Named Data Networking (Demo). In China-America Frontiers of Engineering Symposium, Frontiers of Engineering , 2013 . P. Crowley. Named Data Networking (Demo). In China-America Frontiers of Engineering Symposium, Frontiers of Engineering, 2013.",{},{"id":24,"text":2105,"url":24,"identifiers":2106},"10.1145\u002F2534169.2486023",{"doi":2105},{"id":24,"text":2108,"url":24,"identifiers":2109},"10.1109\u002FINFCOMW.2014.6849267",{"doi":2108},{"id":24,"text":2111,"url":24,"identifiers":2112},"10.1006\u002Fjvlc.1996.0009",{"doi":2111},{"id":24,"text":2114,"url":24,"identifiers":2115},"10.5555\u002F794199.795125",{"doi":2114},{"id":24,"text":2117,"url":24,"identifiers":2118},"10.1145\u002F2491224.2491231",{"doi":2117},{"id":24,"text":2120,"url":24,"identifiers":2121},"10.1145\u002F1658939.1658941",{"doi":2120},{"id":24,"text":2123,"url":24,"identifiers":2124},"10.1103\u002FPhysRevE.82.036106",{"doi":2123},{"id":24,"text":2126,"url":24,"identifiers":2127},"10.1145\u002F1111322.1111328",{"doi":2126},{"id":24,"text":2129,"url":24,"identifiers":2130},"NDN Team . Named Data Networking (NDN) Project 2012 - 2013 Annual Report , Sept 2013 . NDN Team. Named Data Networking (NDN) Project 2012 - 2013 Annual Report, Sept 2013.",{},{"id":24,"text":2132,"url":24,"identifiers":2133},"NDN team. NDN Forwarding Daemon , 2014 . http:\u002F\u002Fnamed-data.net\u002Fdoc\u002FNFD\u002Fcurrent\u002F. NDN team. NDN Forwarding Daemon, 2014. http:\u002F\u002Fnamed-data.net\u002Fdoc\u002FNFD\u002Fcurrent\u002F.",{},{"id":24,"text":2135,"url":24,"identifiers":2136},"NDN team. NDN Platform 2014. http:\u002F\u002Fnamed-data.net\u002Fcodebase\u002Fplatform\u002F.  NDN team. NDN Platform 2014. http:\u002F\u002Fnamed-data.net\u002Fcodebase\u002Fplatform\u002F.",{},{"id":24,"text":2138,"url":24,"identifiers":2139},"W. Shang , Q. Ding , A. Marianantoni , J. Burke , and L. Zhang . Securing building management systems using named data networking . IEEE Network Special Issue on Information-Centric Networking , Apr 2014 . W. Shang, Q. Ding, A. Marianantoni, J. Burke, and L. Zhang. Securing building management systems using named data networking. IEEE Network Special Issue on Information-Centric Networking, Apr 2014.",{},{"id":24,"text":2141,"url":24,"identifiers":2142},"W. Shang , J. Thompson , M. Cherkaoui , J. Burke , and L. Zhang . NDN.JS: A JavaScript Client Library for Named Data Networking. In IEEE INFOCOM 2013 NOMEN Workshop , Apr 2013 . W. Shang, J. Thompson, M. Cherkaoui, J. Burke, and L. Zhang. NDN.JS: A JavaScript Client Library for Named Data Networking. In IEEE INFOCOM 2013 NOMEN Workshop, Apr 2013.",{},{"id":24,"text":2144,"url":24,"identifiers":2145},"10.5555\u002F2537857.2537892",{"doi":2144},{"id":24,"text":2147,"url":24,"identifiers":2148},"10.1145\u002F2342488.2342505",{"doi":2147},{"id":24,"text":2150,"url":24,"identifiers":2151},"G. Xylomenos , C. Ververidis , V. Siris , N. Fotiou , C. Tsilopoulos , X. Vasilakos , K. Katsaros , and G. Polyzos . A survey of information-centric networking research . IEEE Communications Surveys Tutorials , 2013 . G. Xylomenos, C. Ververidis, V. Siris, N. Fotiou, C. Tsilopoulos, X. Vasilakos, K. Katsaros, and G. Polyzos. A survey of information-centric networking research. IEEE Communications Surveys Tutorials, 2013.",{},{"id":24,"text":1797,"url":24,"identifiers":2153},{"doi":1797},{"id":24,"text":2155,"url":24,"identifiers":2156},"10.1145\u002F2317307.2317319",{"doi":2155},{"id":24,"text":2158,"url":24,"identifiers":2159},"10.1109\u002FINFOCOM.2014.6848146",{"doi":2158},{"id":24,"text":2161,"url":24,"identifiers":2162},"10.1109\u002FICCCN.2012.6289305",{"doi":2161},{"id":24,"text":2164,"url":24,"identifiers":2165},"Z. Zhu and A. Afanasyev . Let's ChronoSync: Decentralized dataset state synchronization in NDN . In ICNP , 2013 . Z. Zhu and A. Afanasyev. Let's ChronoSync: Decentralized dataset state synchronization in NDN. In ICNP, 2013.",{},{"id":24,"text":2167,"url":24,"identifiers":2168},"10.1145\u002F2089016.2089036",{"doi":2167}]