{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:43:27Z","timestamp":1725698607691},"reference-count":16,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/mascot.2003.1240666","type":"proceedings-article","created":{"date-parts":[[2004,6,22]],"date-time":"2004-06-22T16:27:43Z","timestamp":1087921663000},"page":"242-245","source":"Crossref","is-referenced-by-count":21,"title":["Toward scaling network emulation using topology partitioning"],"prefix":"10.1109","author":[{"given":"K.","family":"Yocum","sequence":"first","affiliation":[]},{"given":"E.","family":"Eade","sequence":"additional","affiliation":[]},{"given":"J.","family":"Degesys","sequence":"additional","affiliation":[]},{"given":"D.","family":"Becker","sequence":"additional","affiliation":[]},{"given":"J.","family":"Chase","sequence":"additional","affiliation":[]},{"given":"A.","family":"Vahdat","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/PADS.2000.847140"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/PADS.2002.1004204"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/1060289.1060315"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/1060289.1060313"},{"key":"ref14","article-title":"Inet-3.0: Internet topology generator","author":"winick","year":"2002","journal-title":"Technical Report CSE-TR-456-02"},{"key":"ref15","article-title":"Payload caching: High-speed data forwarding for network intermediaries","author":"yocum","year":"2001","journal-title":"Proceedings of USENIX Technical Conference"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/278009.278027"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1137\/S1064827595287997"},{"year":"1989","author":"garey","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","key":"ref3"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/PADS.1998.685264"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/956981.956988"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1137\/0611030"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/DAC.1982.1585498"},{"key":"ref1","article-title":"On the validity of a front oriented approach to partitioning large sparse graphs with a connectivity constraint","author":"ciarlet","year":"1994","journal-title":"Technical Report 94-37 Computer Science Department"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1109\/MASCOT.1999.805048","article-title":"A generic framework for parallelization of network simulations","author":"riley","year":"1999","journal-title":"Proceedings of International Symposium on Modeling Analysis and simulation of Computer and Telecommunication Systems"}],"event":{"acronym":"MASCOT-03","name":"11th IEEE\/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems - MASCOTS","location":"Orlando, FL, USA"},"container-title":["11th IEEE\/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8783\/27814\/01240666.pdf?arnumber=1240666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T10:14:05Z","timestamp":1585822445000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1240666\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/mascot.2003.1240666","relation":{},"subject":[]}}