The routing continuum from shortest-path to all-path: A unifying theory

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2011, Pages 847-856

  Li, Yanhua ^a   Zhang, Zhi Li ^a   Boley, Daniel ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL OPERATIONS; FLOW OPTIMIZATION; ITERATIVE ALGORITHM; MULTI-PATH; OPTIMAL FLOWS; ROUTING GRAPH; ROUTING STRATEGIES; SHORTEST-PATH; THEORETICAL FRAMEWORK; TRAFFIC ENGINEERING;

ALGORITHMS; OPTIMIZATION; SENSORS; WIRELESS SENSOR NETWORKS;

NETWORK ROUTING;

EID: 80051914608     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2011.57     Document Type: Conference Paper

References (32)

1. G. R. Ash. Dynamic Routing in Telecommunications Networks. McGraw-Hill Professional, 1st edition, 1997.
2. C. L. Barrett, S. J. Eidenbenz, L. Kroc, M. V. Marathe, and J. P. Smith. Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios. In Proceedings of the 2005 ACM symposium on Applied computing, SAC'05, pages 1166-1173, New York, NY, USA, 2005. ACM.
3. A. Basu, A. Lin, and S. Ramanathan. Routing using potentials: a dynamic traffic-aware routing algorithm. In SIGCOMM'03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 37-48, New York, NY, USA, 2003. ACM Press.
4. S. Biswas and R. Morris. Exor: opportunistic multi-hop routing for wireless networks. In SIGCOMM'05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, pages 133-144, New York, NY, USA, 2005. ACM. (Pubitemid 46323500)
5. T. Bonald, M. Jonckheere, and A. Proutiére. Insensitive load balancing. In Proceedings of the joint international conference on Measurement and modeling of computer systems, SIGMETRICS'04/Performance'04, pages 367-377, New York, NY, USA, 2004. ACM.
6. E. J. Candes and M. B. Wakin. An Introduction To Compressive Sampling. IEEE Signal Processing Magazine, 25(2):21-30, March 2008.
7. C.-K. Chau and P. Basu. Exact analysis of latency of stateless opportunistic forwarding. In INFOCOM'09: Proceedings of the 28th IEEE Conference on Computer Communications, Rio de Janeiro, Brazil, 2009. IEEE.
8. F. R. K. Chung and S. T. Yau. Discrete green's functions. Journal of Combinatorial Theory, Series A, pages 191-214, 2000.
9. I. Cidon, R. Rom, and Y. Shavitt. Analysis of multi-path routing. IEEE/ACM Transactions on Networking., 7:885-896, December 1999. (Pubitemid 30553385)
10. A. V. Donati, R. Montemanni, L. M. Gambardella, and A. E. Rizzoli. Integration of a robust shortest path algorithm with a time dependent vehicle routing model and applications. In Computational Intelligence for Measurement Systems and Applications, 2003. CIMSA'03. 2003 IEEE International Symposium on, 2003.
11. W. Fisher, M. Suchara, and J. Rexford. Greening backbone networks: reducing energy consumption by shutting off cables in bundled links. In Proceedings of the first ACM SIGCOMM workshop on Green networking, Green Networking'10, pages 29-34, New Delhi, India, 2010. ACM.
12. B. Fortz and M. Thorup. Increasing internet capacity using local search. Computational Optimization and Applications, 29(1):13-48, 2004.
13. L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, March 1977.
14. L. C. Freeman. Centrality in social networks conceptual clarification. Social Networks, 1(3):215-239, 1979.
15. D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. Highly-resilient, energy-efficient multipath routing in wireless sensor networks. SIGMOBILE Mobile Computing and Communications Review, 5(4):11-25, October 2001.
16. F. P. Kelly. Network routing. Philosophical Transactions of the Royal Society, A(337):343-367, 1991.
17. L. Li, M. Thottan, B. Yao, and S. Paul. Distributed network monitoring with bounded link utilization in ip networks. In INFOCOM'03: Proceedings of the 22th IEEE Conference on Computer Communications, pages 1189-1198, Hong Kong, China, 2003. IEEE.
18. Y. Li and Z.-L. Zhang. Random walks on digraphs: A theoretical framework for estimating transmission costs in wireless routing. In INFOCOM'10: Proceedings of the 29th IEEE Conference on Computer Communications, San Diego, USA, 2010. IEEE.
19. H. Liu, Z.-L. Zhang, J. Srivastava, and V. Firoiu. Pwave: A multi-source multi-sink anycast routing framework for wireless sensor networks. In NETWORKING'07: Proceedings of the 6th International IFIP-TC6 Networking, Atlanta, GA, USA, 2007. IFIP.
20. P. V. Mieghem and L. Vandenberghe. Trade-off curves for qos routing. In Infocom'06: Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies, Barcelona, Catalunya, Spain, 2006. IEEE.
21. M. Neely, E. Modiano, and C. Rohrs. Dynamic power allocation and routing for time varying wireless networks. In INFOCOM'03: Proceedings of the 22th IEEE Conference on Computer Communications, Hong Kong, China, 2003.
22. M. E. J. Newman. A measure of betweenness centrality based on random walks. Social Networks, 27(1):39-54, January 2005. (Pubitemid 40272648)
23. M. E. J. Newman. Networks: An Introduction. Oxford University Press, 1st edition, 2010.
24. P. Pham. Performance analysis of reactive shortest single-path and multipath routing mechanism with load balance. In INFOCOM 2003. 22nd IEEE International Conference on Computer Communications, 2003.
25. L. Popa, C. Raiciu, I. Stoica, and D. Rosenblum. Reducing congestion effects in wireless networks by multipath routing. In ICNP'06: IEEE International Conference on Network Protocols, pages 96-105, Los Alamitos, CA, USA, 2006. IEEE.
26. P. Purkayastha and J. S. Baras. An optimal distributed routing algorithm using dual decomposition techniques. Communications in Information and Systems, 8(3):277-302, 2008.
27. G. Ranjan and Z.-L. Zhang. Geometry of complex networks and structural centrality. Technical report, Techincal Report, CS, UMN, http://www.cs.umn.edu/ ∼granjan, 2010.
28. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society (Series B), 58:267-288, 1996.
29. Y. Tsaig and D. L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52:1289-1306, 2006.
30. Y. Wang, Z. Wang, and L. Zhang. Internet traffic engineering without full mesh overlaying. In Infocom'01: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, Anchorage, Alaska, USA, 2001. IEEE.
31. D. Xu, M. Chiang, and J. Rexford. Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering. In INFOCOM 2008. 27th IEEE International Conference on Computer Communications, pages 466-474, Phoenix, AZ, USA, 2008. IEEE.
32. G. Zussman and A. Segall. Energy efficient routing in ad hoc disaster recovery networks. In INFOCOM'03: Proceedings of the 22th IEEE Conference on Computer Communications, Hong Kong, China, 2003.