Minimizing Routing State for Light-Weight Network Simulation. Huang, P. & Heidemann, J. In Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pages to appear, Cincinnati, Ohio, USA, August, 2001. IEEE. ![Minimizing Routing State for Light-Weight Network Simulation [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex We introduce a routing mechanism, referred to as algorith- mic routing. It is a viable routing alternative for network simulations with minimal space complexity—O(N). In theory and for simulations size of the Internet, algorithmic routing has the potential of reducing memory requirement by several orders of magnitude. In practice and through ns- 2 simulations on random topologies, we find memory con- sumption of algorithmic routing exhibits a similar scaling property. However, routes computed by algorithmic routing are not all the shortest. Although we find the relative differ- ence is below 10% for more than 80% of the routes, we are cautious about its applicability to general network simula- tions. With further discussion on impacts of the distortion, we derive a set of guidelines and recommend users to apply this technique only when suitable.
@InProceedings{Huang01b,
author = "Polly Huang and John Heidemann",
title = "Minimizing Routing State for Light-Weight Network Simulation",
booktitle = "Proceedings of the " # " International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems",
year = 2001,
sortdate = "2001-08-01",
project = "ant, vint",
jsubject = "network_simulation",
publisher = "IEEE",
address = "Cincinnati, Ohio, USA",
month = aug,
pages = "to appear",
jlocation = "johnh: folder: xxx",
jlocation = "johnh: pafile",
keywords = "network simulation, routing abstraction",
url = "https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.html",
psurl = "https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.ps.gz",
pdfurl = "https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.pdf",
otherpsurl = "http://www.tik.ee.ethz.ch/%7ehuang/publication/algo-routing-mascots01.ps.gz",
otherpdfurl = "http://www.tik.ee.ethz.ch/%7ehuang/publication/algo-routing-mascots01.pdf",
abstract = "
We introduce a routing mechanism, referred to as algorith-
mic routing. It is a viable routing alternative for network
simulations with minimal space complexity---O(N). In
theory and for simulations size of the Internet, algorithmic
routing has the potential of reducing memory requirement
by several orders of magnitude. In practice and through ns-
2 simulations on random topologies, we find memory con-
sumption of algorithmic routing exhibits a similar scaling
property. However, routes computed by algorithmic routing
are not all the shortest. Although we find the relative differ-
ence is below 10\% for more than 80\% of the routes, we are
cautious about its applicability to general network simula-
tions. With further discussion on impacts of the distortion,
we derive a set of guidelines and recommend users to apply
this technique only when suitable.
",
}
Downloads: 0
{"_id":"YFusYRtQnFQSa4BiS","bibbaseid":"huang-heidemann-minimizingroutingstateforlightweightnetworksimulation-2001","author_short":["Huang, P.","Heidemann, J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Polly"],"propositions":[],"lastnames":["Huang"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]}],"title":"Minimizing Routing State for Light-Weight Network Simulation","booktitle":"Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","year":"2001","sortdate":"2001-08-01","project":"ant, vint","jsubject":"network_simulation","publisher":"IEEE","address":"Cincinnati, Ohio, USA","month":"August","pages":"to appear","jlocation":"johnh: pafile","keywords":"network simulation, routing abstraction","url":"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.html","psurl":"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.ps.gz","pdfurl":"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.pdf","otherpsurl":"http://www.tik.ee.ethz.ch/%7ehuang/publication/algo-routing-mascots01.ps.gz","otherpdfurl":"http://www.tik.ee.ethz.ch/%7ehuang/publication/algo-routing-mascots01.pdf","abstract":"We introduce a routing mechanism, referred to as algorith- mic routing. It is a viable routing alternative for network simulations with minimal space complexity—O(N). In theory and for simulations size of the Internet, algorithmic routing has the potential of reducing memory requirement by several orders of magnitude. In practice and through ns- 2 simulations on random topologies, we find memory con- sumption of algorithmic routing exhibits a similar scaling property. However, routes computed by algorithmic routing are not all the shortest. Although we find the relative differ- ence is below 10% for more than 80% of the routes, we are cautious about its applicability to general network simula- tions. With further discussion on impacts of the distortion, we derive a set of guidelines and recommend users to apply this technique only when suitable. ","bibtex":"@InProceedings{Huang01b,\n\tauthor = \"Polly Huang and John Heidemann\",\n\ttitle = \t\"Minimizing Routing State for Light-Weight Network Simulation\",\n\tbooktitle = \t\"Proceedings of the \" # \" International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\n\tyear = \t\t2001,\n\tsortdate = \t\t\"2001-08-01\", \n\tproject = \"ant, vint\",\n\tjsubject = \"network_simulation\",\n\tpublisher =\t\"IEEE\",\n\taddress =\t\"Cincinnati, Ohio, USA\",\n\tmonth =\t\taug,\n\tpages =\t\t\"to appear\",\n\tjlocation =\t\"johnh: folder: xxx\",\n\tjlocation =\t\"johnh: pafile\",\n\tkeywords =\t\"network simulation, routing abstraction\",\n\turl =\t\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.html\",\n\tpsurl =\t\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.ps.gz\",\n\tpdfurl =\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.pdf\",\n\totherpsurl =\t\"http://www.tik.ee.ethz.ch/%7ehuang/publication/algo-routing-mascots01.ps.gz\",\n\totherpdfurl =\t\"http://www.tik.ee.ethz.ch/%7ehuang/publication/algo-routing-mascots01.pdf\",\n\tabstract = \"\nWe introduce a routing mechanism, referred to as algorith-\nmic routing. It is a viable routing alternative for network\nsimulations with minimal space complexity---O(N). In\ntheory and for simulations size of the Internet, algorithmic\nrouting has the potential of reducing memory requirement\nby several orders of magnitude. In practice and through ns-\n2 simulations on random topologies, we find memory con-\nsumption of algorithmic routing exhibits a similar scaling\nproperty. However, routes computed by algorithmic routing\nare not all the shortest. Although we find the relative differ-\nence is below 10\\% for more than 80\\% of the routes, we are\ncautious about its applicability to general network simula-\ntions. With further discussion on impacts of the distortion,\nwe derive a set of guidelines and recommend users to apply\nthis technique only when suitable.\n\",\n}\n\n","author_short":["Huang, P.","Heidemann, J."],"bibbaseid":"huang-heidemann-minimizingroutingstateforlightweightnetworksimulation-2001","role":"author","urls":{"Paper":"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.html"},"keyword":["network simulation","routing abstraction"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":["network simulation","routing abstraction"],"search_terms":["minimizing","routing","state","light","weight","network","simulation","huang","heidemann"],"title":"Minimizing Routing State for Light-Weight Network Simulation","year":2001}