The price of evolution in incremental network design: The case of mesh networks

作者: Saeideh Bakhshi , Constantine Dovrolis

DOI: 10.1007/978-3-642-32711-7_1

关键词: Robustness (computer science)Propagation delayDesign processMathematical optimizationOrder One Network ProtocolDistributed computingMinificationWireless mesh networkComputer scienceMesh networkingNetwork planning and design

摘要: In practice most service-provider and enterprise networks are designed incrementally over time. This ongoing heuristic design process is driven by changes in the underlying objectives constraints (the “environment”). We first formulate incremental network approach as constrained minimization of a certain modification cost, compare that with classical which objective to minimize total cost. evaluate cost overhead evolvability designs under two expansion models (random gradual), evaluating terms performance (propagation delay) robustness. Even though has some overhead, this does not increase grows. case mesh networks, leads larger link density, lower average delay improved

参考文章(27)
Mario Pickavet, Piet Demeester, Long-Term Planning of WDM Networks: A Comparison between Single-Period and Multi-Period Techniques Photonic Network Communications. ,vol. 1, pp. 331- 346 ,(1999) , 10.1023/A:1010030918159
Jan Karel Lenstra, David Shmoys, The Traveling Salesman Problem: A Computational Study ,(2007)
Heungsoon Felix Lee, Daniel R. Dooly, Heuristic algorithms for the fiber optic network expansion problem Telecommunication Systems. ,vol. 7, pp. 355- 378 ,(1997) , 10.1023/A:1019188715963
Michał Pióro, Deepankar Medhi, ScienceDirect (Online service), None, Routing, flow, and capacity design in communication and computer networks ,(2004)
Mark Newman, Networks: An Introduction ,(2010)
Martin Herzog, Martin Maier, Martin Reisslein, Metropolitan area packet-switched WDM networks: A survey on ring systems IEEE Communications Surveys and Tutorials. ,vol. 6, pp. 2- 20 ,(2004) , 10.1109/COMST.2004.5342236
S. P. Jain, Krishna Gopal, On Network Augmentation IEEE Transactions on Reliability. ,vol. 35, pp. 541- 543 ,(1986) , 10.1109/TR.1986.4335542
Andrew R. Curtis, S. Keshav, Alejandro Lopez-Ortiz, LEGUP: using heterogeneity to reduce the cost of data center network upgrades conference on emerging network experiment and technology. pp. 14- ,(2010) , 10.1145/1921168.1921187
Jillian Beardwood, J. H. Halton, J. M. Hammersley, The shortest path through many points Mathematical Proceedings of the Cambridge Philosophical Society. ,vol. 55, pp. 299- 327 ,(1959) , 10.1017/S0305004100034095