Academia.eduAcademia.edu

Outline

Title
Abstract
Objective of This Dissertation
Intra-Domain Routing Protocols
Failure Recovery Methods
Ability to Construct a New Routing Method Easily
Design and Implementation of Simrouting
Experiment Result
Overview
Related Work
Overview of Drouting Architecture
Failure Recovery Simulation Method
Simulation and Analysis on Telstra (AS1221)
Summary
Chapter 9 Conclusion
Issues in Traffic Engineering Method
The Distributed Routing Protocol
References

Routing Architecture for the Dependable Internet

Profile image of Yasuhiro OharaYasuhiro Ohara

2008

Abstract

Routing technologies are discussed in this dissertation with the goal of improving the network availability. The "highly available Internet" is defined as the Internet with functions to forecast and control the network availability. An implementation strategy to approach to the highly available Internet and to the Dependable Internet is described. This dissertation provides a routing simulator called SimRouting to calculate the network availability, an example of oscillation-tolerant OSPF routing protocol, a family of new multipath route calculation algorithms called MARA, and a new multipath routing architecture called Drouting. The reliability of communication network depends on various components, for example, the reliability of hardware communication devices, the stability of communication protocols and software systems, the availability of sufficient capacity of network resources, and the reliability of network operators. Current research focuses on a specific one of these reliability components. For example, research on fault-tolerant systems targets the reliability of individual communication devices, circuits, and systems. Research on communication protocols targets their stability. Traffic engineering research focuses on the utilization of the network bandwidth capacity. The current Internet is built upon the combinations of these individual reliability research technologies. Combining the existing research on reliability of specific components does not improve the practical reliability of the entire communication network for two reasons: 1) Current research does not cover all reliability components. For example, studies on technologies to prevent software bugs, hardware bugs, and mis-configurations by network operators, are not adequate. 2) For many reliability components, no fallback plan is provided when the responsible technologies fail. If a fault-tolerant system or a stabilizing technology for a communication protocol fails, the communication network may cease to function until it is manually repaired. Consequently, the reliability of overall communication network is not sufficient, and the reliability of the Internet is not high enough for mission-critical communication. Focusing on the routing technologies, this research improves the availability of the entire communication system, as the first step of the reliability research for the Internet. Since the routing technology decides the network path that determines the reliability and the ii ABSTRACT iii performance of the communication, it is the most important entity for a communication network. Through the aggressive and proactive utilization of multipaths, this dissertation provides a method to bypass trouble spots, even unpredictable ones. This research focuses on the intra-domain routing system. This research contributes to improving the availability of the IP network through the proposals of 1) a method to estimate the availability of the communication network system considering its routing system, 2) a method to stabilize a routing system, 3) a new routing algorithm to calculate maximum alternative routes in a hop-by-hop network, 4) a new routing architecture to improve the availability of the network via the use of alternative routes, and 5) a method to implement traffic engineering on the new routing architecture. This research as a whole constructs a routing architecture and its peripheral functions that are required for the highly available Internet.

Related papers

Fast recovery paths schema to improve reliability in IP networks
Fernando Leite Barreto

NOMS 2008 - 2008 IEEE Network Operations and Management Symposium, 2008

In case of failure, the link state routing protocols need various seconds to converge. This time is a result of their standard reactive approach which can cause several packet drops occur due to incorrect routes. Consequently, this compromises the reliability of an IP network. In this study, we describe a proactive approach to generate recovery paths in order to help routing protocols bypass failures. A simulator was used to conduct an evaluation, which showed these paths need a smaller extension in the forwarding table compared with other approaches. The evaluation also reduced the packet drop rate during the IP routing protocol convergence.

View PDFchevron_right
Reliable internet routing
Martin Suchara

2011

Network routing algorithms responsible for selecting paths to destinations have a profound impact on network reliability experienced by the network users. Unfortunately, performance of state-of-the-art routing algorithms often falls short of users' expectations. (i) The flexibility with which operators of independently administered networks can choose their routing policies allows them to make selections that are "conflicting" and may lead to route oscillations. Oscillating routes have a negative impact on performance experienced by the user, and also cause overloading of the routers with control messages. (ii) Interdomain routing in the Internet is based on trust. As a result, false route announcements can be made by a malicious network operator. Such false announcements can be made even without knowledge of the network operator, e.g., due to accidentally misconfigurations or router hijacking. False route announcements may lead to denial of service, or worse yet, traf...

View PDFchevron_right
Failure Insensitive Routing for Ensuring Service Availability
Zhi-Li Zhang

Lecture Notes in Computer Science, 2003

Intra-domain routing protocols employed in the Internet route around failed links by having routers detect adjacent link failures, exchange link state changes, and recompute their routing tables. Due to several delays in detection, propagation and recomputation, it may take tens of seconds to minutes after a link failure to resume forwarding of packets to the affected destinations. This discontinuity in destination reachability adversely affects the quality of continuous media applications such as Voice over IP. Moreover, the resulting service unavailability for even a short duration could be catastrophic in the world of e-commerce. Careful tuning of various parameters to accelerate routing convergence may cause routing instability when the majority of failures are transient. To improve failure resiliency without jeopardizing routing stability, we propose a local rerouting based approach called failure insensitive routing. Under this approach, upon a link failure, adjacent router suppresses global updating and instead initiates local rerouting. All other routers infer potential link failures from packet's incoming interface, precompute interface dependent forwarding tables and route around failed links without explicit link state updates. We demonstrate that the proposed approach ensures continuity of forwarding along loop-free paths regardless of the delays in link state propagation and routing table recomputation.

View PDFchevron_right
A Reliable Routing Protocol with Backup Scheme in Wired Computer Networks
sai sree

2019

The main challenges in wired computer networks are transferring data packets through the most reliable path and optimizing the time taken for dynamic recalculation of the backup route during the path failure. In this paper, the path with the largest number of reliable links is considered as the best path. The link reliability is decided based on several parameters like packet delivery ratio, flow capacity, bandwidth, queue capacity of the link, delay and throughput. For each link, the cost is assigned in terms of reliability using the proposed cost function. Data is sent through the calculated reliable path, thereby avoiding path failure to the maximum extent possible. If there is a failure in the path during packet transmission, the backup path is dynamically calculated by considering different scenarios. The effectiveness of the proposed protocol is proved by simulation results.

View PDFchevron_right
Reliability in Computer Networks
Saulius Minkevičius

IFIP International Federation for Information Processing, 2006

We use a mathematical model of an open queueing network in heavy traffic. The probability limit theorem for the virtual waiting time of a customer in heavy traffic in open queueing networks has been presented. Finally, we present an application of the theorem - a reliability model from computer network practice.

View PDFchevron_right
Reliability as an interdomain service
Alexandre Gerber

ACM SIGCOMM Computer Communication Review, 2007

Reliability is a critical requirement of the Internet. The availability and resilience of the Internet under failures can have significant global effects. However, in the current Internet routing architecture, achieving the high level of reliability demanded by many missioncritical activities can be costly. In this paper, we first propose a novel solution framework called reliability as an interdomain service (REIN) that can be incrementally deployed in the Internet and may improve the redundancy of IP networks at low cost. We then present robust algorithms to efficiently utilize network redundancy to improve reliability. We use real IP network topologies and traffic traces to demonstrate the effectiveness of our framework and algorithms.

View PDFchevron_right
A SURVEY ON MULTIPLE ROUTING CONFIGURATIONS AGAINST NODE AND LINK FAILURES
sameeksha khandetod

As the Internet takes an increasingly central role in our communications infrastructure; the slow convergence of routing protocols after a network failure becomes a growing problem. Internet plays a vital role in our day to day activities such as online banking, online shopping, online transactions and some other type of communications infrastructure; due to slow convergence of routing protocols after network failure becomes the massive problem for communication network. A recovery technique name Multiple Routing Configurations (MRC) is used to guarantee fast recovery from link and node failure in networks. In the communication network if the communication is done from the different nodes to transfer the data from source node to destination node, if the communication nodes are damaged or the communication link is broken due to some interference, then network stop and data may lost in this process. So recovery of the data from the network and keep the network functional even if the nodes in the network are failed is the most important for the communication network. So in this paper a detail review on multiple routing configurations (MRC) is done.

View PDFchevron_right
Dependability modelling and analysis of networks as taking routing and traffic into account
Bjarne Helvik

The existing work on dependability modelling and analysis of networks have main focuses on the, structural properties. However, the communication networks also have dynamic characteristics and behavioral properties, such as changes of topology, routes, and traffic loads, which should necessarily be reflected in the modelling. We regard the dependability modelling and analysis of IP networks with an intra-domain routing and traffic handling. This yields to an increased complexity in the modelling and analysis, due to the increase of the state space. Several techniques have been proposed to deal with the growth of the state space. To an analyst, an interesting point is, whether he/she can make a trade-off to the factors under consideration, i.e. the model representativeness vs. modelling complexity, and computation efforts vs. result accuracy. To meet these requirements, we propose a modelling approach where failures and repairs of network components as well as routing and traffic handling are described by a set of stochastic activity networks (SAN). The SANs are designed to restrict the generation of the state space to the most probable states, which enables an analysis without creation of an excessively large state space and achieving a sufficient accuracy of the result. A case study based on the Norwegian university IP backbone network demonstrates the applicability of this approach.

View PDFchevron_right
A comparative analysis of network dependability, fault-tolerance, reliability, security, and survivability
Nicholas Kyriakopoulos

IEEE Communications Surveys & Tutorials, 2009

A number of qualitative and quantitative terms are used to describe the performance of what has come to be known as information systems, networks or infrastructures. However, some of these terms either have overlapping meanings or contain ambiguities in their definitions presenting problems to those who attempt a rigorous evaluation of the performance of such systems. The phenomenon arises because the wide range of disciplines covered by the term information technology have developed their own distinct terminologies. This paper presents a systematic approach for determining common and complementary characteristics of five widely-used concepts, dependability, fault-tolerance, reliability, security, and survivability. The approach consists of comparing definitions, attributes, and evaluation measures for each of the five concepts and developing corresponding relations. Removing redundancies and clarifying ambiguities will help the mapping of broad user-specified requirements into objective performance parameters for analyzing and designing information infrastructures.

View PDFchevron_right
Analysis on the current and the future Internet structure regarding multi-homed and multi-path routing
Hiroshi Fujinoki

Journal of Internet Services and Applications, 2011

We analyzed how reliability will be improved by adopting inter-domain multi-path and multi-homing routing when the structure in the Internet changes. We identified the properties of the ideal network structure that will maximize the advantage of multi-path and multi-home routing using mathematical analyses. We focused on how each end-to-end path is built, how many multi-paths exist and how each multi-path consists of multi-path and multi-homing segments. Second, we analyzed the trends in the recent changes in how the Internet is structured from the view point of inter-domain multi-path routing. The mathematical analyses suggest that a large number of multi-paths or multi-homing is not necessary to effectively benefit from multi-path routing. However, it will be important to keep the path length short in the segments where multiple paths are not available. The analyses on the recent changes in the Internet structure suggest that multi-path routing will contribute to improvement of re...

View PDFchevron_right

References (117)

  1. 9 476.77 1.59 398.00 -1 -1 E_RT U 17 10 848.90 2.83 662.02 -1 -1 E_RT U 18 10 434.66 1.45 288.27 -1 -1 E_RT U 19 11 296.32 0.99 444.85 -1 -1 E_RT U 20 11 641.20 2.14 662.09 -1 -1 E_RT U 21 12 389.10 1.30 625.57 -1 -1 E_RT U 22 12 412.99 1.38 415.47 -1 -1 E_RT U 23 13 812.01 2.71 757.58 -1 -1 E_RT U 24 13 78.00 0.26 401.49 -1 -1 E_RT U 25 14 743.59 2.48 816.07 -1 -1 E_RT U 26 14 370.31 1.24 28.15 -1 -1 E_RT U 27 15 288.78 0.96 583.25 -1 -1 E_RT U 28 15 474.91 1.58 855.85 -1 -1 E_RT U 29 16 634.39 2.12 596.14 -1 -1 E_RT U 30 16 725.93 2.42 845.42 -1 -1 E_RT U 31 17 851.54 2.84 114.48 -1 -1 E_RT U 32 17 682.84 2.28 426.92 -1 -1 E_RT U 33 18 188.81 0.63 539.60 -1 -1 E_RT U 34 18 509.04 1.70 907.04 -1 -1 E_RT U 35 19 418.41 1.40 227.65 -1 -1 E_RT U 36 19 371.65 1.24 957.91 -1 -1 E_RT U /* #Nodes, |V| */ param N >= 2; cross V; /* set of routing sub-graphs */ set R within V cross E;
  2. /* there must be no loops in E */ check{(i,j) in E}: i != j;
  3. /* there must be no loops in R */ check{(t,i,j) in R}: i != j;
  4. /* there must be no edge from t in R */ check{(t,i,j) in R}: i != t; param cap{E} default 0; param D{V,V} default 0;
  5. F{V,V,E} >= 0, default 0.0; var l{E} >= 0, default 0.0; var u{E} >= 0, default 0.0; var phi{E} >= 0, default 0.0; var Phi >= 0;
  6. /* ratio */ var r{V,E} >= 0, default 0.0;
  7. var fot{V,V} >= 0, default 0.0; var vari{V,E} >= 0, default 0.0; var equality >= 0, default 0.0;
  8. Intermediate system to Intermediate system routeing information exchange proto- col for use in conjunction with the Protocol for providing the Connectionless-mode Network Service (ISO 8473). ISO/IEC 10589:2001.
  9. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1993.
  10. ampl.com. AMPL Modeling Language for Mathematical Programming. <http:// www.ampl.com/>.
  11. Analytical Graphics, Inc. Analytical Graphics, Inc. (AGI), analysis software for land, sea, air, and space. <http://www.agi.com/>.
  12. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient overlay net- works. In SOSP '01: Proceedings of the 18th ACM Symposium on Operating Systems Principles, pp. 131-145, New York, NY, USA, 2001. ACM.
  13. D. Applegate and E. Cohen. Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs. In SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 313-324, New York, NY, USA, 2003. ACM Press.
  14. A. Atlas and A. Zinin. Basic specification for IP fast-reroute: loop-free alternates. Technical report, Mar. 2007. draft-ietf-rtgwg-ipfrr-spec-base-06.txt.
  15. A. Avizienis, J.-C. Laprie, and B. Randell. Fundamental Concepts of Dependability. Research Report 1145, LAAS-CNRS, 2001.
  16. D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus. Requirements for Traffic Engineering Over MPLS. rfc 2702, Sept. 1999.
  17. D. O. Awduche. MPLS and traffic engineering in IP networks. Communications Magazine, IEEE, 37(12):42-47, Dec. 1999.
  18. R. Barlow and F. Proschan. Statistical theory of reliability and life testing: probability models. Holt, Rinehart and Winston, New York, 1975.
  19. 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 communica- tions, pp. 37-48, New York, NY, USA, 2003. ACM Press.
  20. I. V. Beijnum. BGP. O'Reilly & Associates, Inc., Sebastopol, CA, USA, 2002.
  21. Y. Bernet, P. Ford, R. Yavatkar, F. Baker, L. Zhang, M. Speer, R. Braden, B. Davie, J. Wroclawski, and E. Felstaine. A Framework for Integrated Services Operation over Diffserv Networks. rfc 2998, Nov. 2000.
  22. K. Cho. The Design and Implementation of the ALTQ Traffic Management System. PhD thesis, Keio University, Jan. 2001.
  23. Cisco Systems. Advanced topics in MPLS-TE deployment. White paper, 2001.
  24. R. Cohen and G. Nakibly. On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing. In INFOCOM, 2004.
  25. R. Coltun, D. Ferguson, and J. Moy. OSPF for IPv6. rfc 2740, Dec. 1999.
  26. D. E. Comer. Principles, Protocols, and Architectures. In Internetworking with TCP/IP, volume 1. Prentice Hall PTR, Upper Saddle River, NJ, USA, fourth edition, 2000.
  27. S. Cowley. Level 3, Cogent resolve peering spat, renew deal. IDG News Ser- vice, Oct 28 2005. <http://www.networkworld.com/edge/news/2005/102805 -cogent-level3.html>.
  28. E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick. A Framework for QoS-based Routing in the Internet. rfc 2386, Aug. 1998.
  29. G. B. Dantzig and D. R. Fulkerson. On the max flow min cut theorem of networks. The RAND Corporation, Santa Monica, California, 1955. Paper P-826.
  30. E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271, 1959.
  31. E. W. Dijkstra and C. S. Scholten. Termination Detection for Diffusing Computations. Inf. Process. Lett., 11(1):1-4, 1980.
  32. E. A. Dinits. Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation. Soviet Mathematics-Doklady, 11(5):1277-1280, 1970.
  33. J. Duffy. Cisco routers caused major outage in Japan: report. Network World, May 16 2007. <http://www.networkworld.com/news/2007/051607-cisco- routers-major-outage-japan.html>.
  34. J. Ellson and E. Gansner. Graphviz. <http://www.graphviz.org/>.
  35. A. Elwalid, C. Jin, S. Low, and I. Widjaja. MATE: multipath adaptive traffic engineer- ing. Comput. Networks, 40(6):695-709, 2002.
  36. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the In- ternet topology. In SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 251-262, New York, NY, USA, 1999. ACM Press.
  37. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In IEEE INFOCOM, volume 2, pp. 519-528, Mar 2000.
  38. B. Fortz and M. Thorup. Optimizing OSPF/IS-IS Weights in a Changing World. IEEE J. Selected Areas in Communications, 20(4):756-767, 2002.
  39. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987.
  40. A. Fumagalli and L. Valcarenghi. IP Restoration vs. WDM Protection: Is There an Optimal Choice ? IEEE Network, 14(6), Dec. 2000.
  41. R. Govindan and A. Reddy. An Analysis of Internet Inter-Domain Topology and Route Stability. In INFOCOM '97: Proceedings of the INFOCOM '97. 16th Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, p. 850, Washington, DC, USA, 1997. IEEE Computer Society.
  42. T. G. Griffin, F. B. Shepherd, and G. Wilfong. The stable paths problem and interdo- main routing. IEEE/ACM Trans. Netw., 10(2):232-243, 2002.
  43. D. Harrington, R. Presuhn, and B. Wijnen. An Architecture for Describing Simple Network Management Protocol (SNMP) Management Frameworks. rfc 3411, Dec. 2002.
  44. C. Huitema. Routing in the Internet. Prentice Hall PTR, Upper Saddle River, NJ, USA, second edition, 2000.
  45. G. Huston. CIDR Report. <http://www.cidr-report.org/>.
  46. G. Iannaccone, C.-N. Chuah, S. Bhattacharyya, and C. Diot. Feasibility of IP restora- tion in a tier 1 backbone. IEEE Network, 18(2):13-19, 2004.
  47. G. Iannaccone, C.-N. Chuah, R. Mortier, S. Bhattacharyya, and C. Diot. Analysis of link failures in an IP backbone. In IMW '02: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, pp. 237-242, New York, NY, USA, 2002. ACM Press.
  48. IETF bfd working group. Bidirectional Forwarding Detection (bfd). <http://www. ietf.org/html.charters/bfd-charter.html>.
  49. IETF manet working group. Mobile Ad-hoc Networks (manet). <http://www.ietf. org/html.charters/manet-charter.html>.
  50. Internet World Stats. Internet Growth Statistics -Global Village Online. <http:// www.internetworldstats.com/emarketing.htm>.
  51. M. Jain and C. Dovrolis. Ten fallacies and pitfalls on end-to-end available bandwidth estimation. In IMC '04: Proceedings of the 4th ACM SIGCOMM conference on Internet measurement, pp. 272-277, New York, NY, USA, 2004. ACM Press.
  52. P. Jalote. Fault Tolerance in Distributed Systems. Prentice Hall, Englewood Cliffs, NJ, USA, 1994.
  53. S. Kandula, D. Katabi, B. Davie, and A. Charny. Walking the tightrope: responsive yet stable traffic engineering. SIGCOMM Comput. Commun. Rev., 35(4):253-264, 2005.
  54. T. Kenyon. High Performance Data Network Design. Digital Press, Elsevier Science Ltd., The Boulevard, England, 2001.
  55. C. Labovitz, A. Ahuja, and F. Jahanian. Experimental Study of Internet Stability and Wide-Area Backbone Failures. Technical Report CSE-TR-382-98, University of Michigan, 1998.
  56. C. Labovitz, A. Ahuja, and F. Jahanian. Experimental Study of Internet Stability and Backbone Failures. In FTCS '99: Proceedings of the Twenty-Ninth Annual Interna- tional Symposium on Fault-Tolerant Computing, pp. 278+, Washington, DC, USA, 1999. IEEE Computer Society.
  57. K. Lai and M. Baker. Measuring link bandwidths using a deterministic model of packet delay. In SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 283- 294, New York, NY, USA, 2000. ACM Press.
  58. S. Lee, Y. Yu, S. Nelakuditi, Z.-L. Zhang, and C.-N. Chuah. Proactive vs Reactive Approaches to Failure Resilient Routing. In INFOCOM, 2004.
  59. L. Li, D. Alderson, W. Willinger, and J. Doyle. A first-principles approach to un- derstanding the internet's router-level topology. In SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 3-14, New York, NY, USA, 2004. ACM Press.
  60. G. Malkin. RIP Version 2. rfc 2453, Nov. 1998.
  61. E. Mannie and D. Papadimitriou. Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS). rfc 4427, Mar. 2006.
  62. A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C.-N. Chuah, and C. Diot. Char- acterization of failures in an IP backbone network. In INFOCOM, 2004.
  63. A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: an approach to universal topology generation. MASCOTS, 00:0346, Aug. 2001.
  64. J. T. Moy. OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, 1998.
  65. J. T. Moy. OSPF version 2. rfc 2328, Apr. 1998.
  66. B. Murray. GTNetS -Home. <http://www.ece.gatech.edu/research/labs/ MANIACS/GTNetS/index.html>.
  67. H. Nagamochi and T. Ibaraki. Computing edge-connectivity in multigraphs and ca- pacitated graphs. SIAM J. Discret. Math., 5(1):54-66, 1992.
  68. H. Nagamochi and T. Ibaraki. Graph connectivity and its augmentation: applications of MA orderings. Discrete Appl. Math., 123(1-3):447-472, 2002.
  69. A. Nakao, L. Peterson, and A. Bavier. A routing underlay for overlay networks. In SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 11-18, New York, NY, USA, 2003. ACM.
  70. T. Nolle. What we should learn from the AT&T outage. Network World, 15:73, May 4 1998.
  71. ns-2 project. The Network Simulator -ns-2. <http://www.isi.edu/nsnam/ns/>.
  72. NTT-EAST. About the circumstances where FLET'S service and Hikari phones can- not be used (final report) (Japanese). <http://www.ntt-east.co.jp/release/ 0705/070516b.html>.
  73. Y. Ohara. Zebra OSPFv3. <http://www.sfc.wide.ad.jp/˜yasu/research/ ospf-v3.html>.
  74. Y. Ohara, H. Imaizumi, A. Kato, O. Nakamura, and J. Murai. A Load Balancing Routing Algorithm Tolerant to Wide Range of Traffic Demands (Japanese). IPSJ, 48(4):1627- 1640, 2007.
  75. OMNeT++ Community Site. OMNeT++ Community Site. <http://www.omnetpp. org/>.
  76. P. Pan, G. Swallow, and A. Atlas. Fast Reroute Extensions to RSVP-TE for LSP Tun- nels. rfc 4090, May 2005.
  77. R. Perlman. Interconnections: Bridges and Routers. Addison Wesley Longman Pub- lishing Co., Inc., Boston, MA, USA, 1992.
  78. L. Peterson, T. Anderson, D. Culler, and T. Roscoe. A blueprint for introducing disrup- tive technology into the Internet. SIGCOMM Comput. Commun. Rev., 33(1):59-64, 2003.
  79. T. C. Piliouras. Network Design: Management and Technical Perspectives. Auerbach Publications, Boston, MA, USA, 2004.
  80. J. B. Postel. User Datagram Protocol. rfc 0768, Aug. 1980.
  81. J. B. Postel. Internet Protocol. rfc 0791, Sept. 1981.
  82. J. B. Postel. Transmission Control Protocol. rfc 0793, Sept. 1981.
  83. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker. On selfish routing in internet-like environments. IEEE/ACM Trans. Netw., 14(4):725-738, 2006.
  84. S. Rai, M. Veeraraghavan, and K. S. Trivedi. A Survey of Efficient Reliability Compu- tation Using Disjoint Products Approach. Networks, 25(3):147-163, 1995.
  85. J. Rajahalme, A. Conta, B. Carpenter, and S. Deering. IPv6 flow label specification. rfc 3697, Mar. 2004.
  86. Y. Rekhter, T. Li, and S. Hares. A border gateway protocol 4 (BGP-4). rfc 4271, Jan. 2006.
  87. E. Rosen, A. Viswanathan, and R. Callon. Multiprotocol Label Switching Architecture. rfc 3031, Jan. 2001.
  88. E. C. Rosen. Vulnerabilities of network control protocols: an example. SIGCOMM Comput. Commun. Rev., 11(3):10-16, 1981.
  89. L. Sahasrabuddhe, S. Ramamurthy, and B. Mukherjee. Fault management in IP-over- WDM networks: WDM protection versus IP restoration. IEEE Journal on Selected Areas in Communications, 20(1), Jan. 2002.
  90. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. The end-to-end effects of Internet path selection. In SIGCOMM '99: Proceedings of the conference on Ap- plications, technologies, architectures, and protocols for computer communication, pp. 289-299, New York, NY, USA, 1999. ACM Press.
  91. Scalable Network Technologies. Scalable Network Technologies: Creators of QualNet Network Simulator Software. <http://www.scalable-networks.com/>.
  92. A. Schmid and C. Steigner. Avoiding Counting To Infinity In Distance Vector Routing. Telecommunication Systems, 19(3-4):497-514, 2002.
  93. R. Sedgewick. Algorithms in C. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2002.
  94. J. Sellens. System and Network Administration for Higher Reliability. The USENIX Association, Berkeley, CA, USA, 2001.
  95. J. L. Sobrinho. Network routing with path vector protocols: theory and applications. In SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 49-60, New York, NY, USA, 2003. ACM Press.
  96. N. Spring, R. Mahajan, D. Wetherall, and T. Anderson. Measuring ISP topologies with Rocketfuel. IEEE/ACM Trans. Netw., 12(1):2-16, 2004.
  97. A. Sridharan, R. Guérin, and C. Diot. Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. IEEE/ACM Trans. Netw., 13(2):234-247, 2005.
  98. J. A. Stankovic. Reliable Distributed System Software. IEEE Computer Society Press, Los Alamitos, CA, USA, 1985.
  99. R. Stewart, Q. Xie, K. Morneault, C. Sharp, H. Schwarzbauer, T. Taylor, I. Rytina, M. Kalla, L. Zhang, and V. Paxson. Stream control transmission protocol. rfc 2960, Oct. 2000.
  100. R. E. Tarjan. Testing graph connectivity. In STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computing, pp. 185-193, New York, NY, USA, 1974. ACM.
  101. The NetBSD Project. The NetBSD Project. <http://www.netbsd.org/>.
  102. The Zebra Project. GNU Zebra. <http://www.zebra.org/>.
  103. M. To and P. Neusy. Unavailability Analysis of Long-Haul Networks. IEEE JSAC, 12:100-09, Jan. 1994.
  104. L. Tong and K. S. Trivedi. An improved algorithm for coherent-system reliability. IEEE Transaction on Reliability, 47(1):73-78, 1998.
  105. C. Villamizar, R. Chandra, and R. Govindan. BGP Route Flap Damping. rfc 2439, Nov. 1998.
  106. S. Vutukury and J. J. Garcia-Luna-Aceves. A simple approximation to minimum- delay routing. In SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 227-238, New York, NY, USA, 1999. ACM Press.
  107. S. Vutukury and J. J. Garcia-Luna-Aceves. An algorithm for multipath computation using distance-vectors with predecessor information. In Proceedings of 8th Interna- tional Conference on IEEE Computer Communications and Networks, pp. 534-539, Oct 1999.
  108. S. Vutukury and J. J. Garcia-Luna-Aceves. MDVA: A Distance-Vector Multipath Rout- ing Protocol. In INFOCOM, pp. 557-564, 2001.
  109. WIDE Project. WIDE PROJECT. <http://www.wide.ad.jp/>.
  110. X. Xiao, A. Hannan, B. Bailey, and L. M. Ni. Traffic Engineering with MPLS in the Internet. Network, IEEE, 14(2):28-33, Mar/Apr 2000.
  111. X. Yang and D. Wetherall. Source selectable path diversity via routing deflections. In SIGCOMM '06: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 159-170, New York, NY, USA, 2006. ACM Press.
  112. X. Zeng, R. Bagrodia, and M. Gerla. GloMoSim: a library for parallel simulation of large-scale wireless networks. In PADS '98: Proceedings of the twelfth workshop on Parallel and distributed simulation, pp. 154-161, Washington, DC, USA, 1998. IEEE Computer Society.
  113. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale IP traffic matrices from link loads. In SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 206-217, New York, NY, USA, 2003. ACM.
  114. Yasuhiro Ohara, Hideaki Imaizumi, Akira Kato, Osamu Nakamura, and Jun Murai, "A Load Balancing Routing Algorithm for Wide Range of Traffic Demands", Transactions of Information Processing Society of Japan (IPSJ), Special Issue on User-centered De- sign and Management of Distributed Systems and the Internet, Vol. 48, No. 4, pp. 1627- 1640 (Apr. 2007) (Japanese)
  115. Yasuhiro Ohara, Hiroyuki Kusumoto, Osamu Nakamura, and Jun Murai, "Drouting Architecture: Improvement of Failure Avoidance Capability using Multipath Rout- ing," The Institute of Electronics, Information and Communication Engineers (IEICE), 2008. (To be published)
  116. Yasuhiro Ohara, Masaki Minami, Osamu Nakamura, and Jun Murai, "SimRouting: A Routing Simulation Tool," The Information Processing Society of Japan (IPSJ), 2008. (In submission) International Conference
  117. Yasuhiro Ohara, Manav Bhatia, Osamu Nakamura, and Jun Murai, "Route flapping effects on OSPF," In SAINT-03: Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops), pp. 232-237, Washington, DC, USA, IEEE Computer Society, 2003.

Related papers

Method of reliability and availability analysis from the dynamic properties of routing and forwarding paths
Fabien Tarissan

2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2013

Confronted to the increasing dynamic of Internet routing system and its underlying topology, we propose a reliability and availability analysis method based on the characterization of the dynamic properties (in particular, the stability properties) of routing paths and their corresponding forwarding paths. The key driver underlying this method is that transient but frequent changes in the spatio-temporal properties of routing paths can affect the performance and operating conditions of the corresponding forwarding paths; hence, their reliability. The results obtained by means of this method verify that, although the main cause of instability results from the forwarding plane dynamics, a second order effect relates forwarding and routing path instability events. Applying our analysis method reveals that the dominant source (main cause) of instability originates indeed from the forwarding plane. This result which confirms previous studies from 2003 further corroborates the assumption that the dynamic properties of routing system are mainly driven by its adaptation to the forwarding system (adaptive routing). However, even if the likelihood of forwarding instability becomes the prominent behavior (cause), about 50% of them induce routing path instability whereas the corresponding forwarding path remains unstable. This observation suggests that 50% of the reactive decisions performed by the BGP routing system (reactive routing) tend to further delay convergence of the forwarding paths. In turn, this observation provides the first indication that simple causal effects can't explain anymore the occurrence of instability. Moreover, more elaborated analysis techniques (such as the one proposed in this paper) are required to explain the inter-dependent routing and forwarding paths dynamics which affects their reliability and availability.

View PDFchevron_right
Analysis on ideal network structures to improve reliability by multi-path and multi-homing BGP routing in the Internet
Hiroshi Fujinoki

2009 International Conference on Ultra Modern Telecommunications & Workshops, 2009

We analyzed how reliability, defined as the probability of continuing transmissions on link failures, will be affected by inter-domain multi-path and multi-homing routing when the structure in the future Internet changes. The goal of this project is to find properties for the ideal network structure that maximizes the advantage of multipath and multi-home routing. We focused on how each end-to-end path is built, how many multi-paths exist and how each multi-path consists of no multi-path and multipath segments. The results of the analyses showed that multi-path and multi-home routing can improve the reliability by 10 to 30% in absolute probability of survivals on link failures, which were two to six times better than the existing no multi-path and no multi-home routing. After the analyses, several interesting properties are identified. It is important to keep the path length short to maximize the benefit from multi-path routing but a large number of multi-paths nor multi-homing connections are not necessary. The multi-homing configurations of degree three improved the reliability up to 50% for link failure rate up to 50% compared to degree of two in our analyses. It is found that single-path edge sections in a path should be short for multi-path routing. The results of this analysis can be a guide in structuring the future Internet.

View PDFchevron_right
High Availability in Routing
Ole Jacobsen

The Internet Protocol Journal, 2004

The operational stability of the global Internet (or any network based on TCP/IP technology) is in large part the result of a carefully configured routing system. Routing continues to be one of the most complex topics in Internet engineering. In our first article, Russ White describes some mechanisms for the design of large-scale, stable routing systems. The article is entitled “High Availability in Routing.”

View PDFchevron_right
Internet routing resilience to failures
Zhuoqing Mao

Proceedings of the 2007 ACM CoNEXT conference on - CoNEXT '07, 2007

Internet interdomain routing is policy-driven, and thus physical connectivity does not imply reachability. On average, routing on today's Internet works quite well, ensuring reachability for most networks and achieving reasonable performance across most paths. However, there is a serious lack of understanding of Internet routing resilience to significant but realistic failures such as those caused by the 911 event, the 2003 Northeast blackout, and the recent Taiwan earthquake in December 2006. In this paper, we systematically analyze how the current Internet routing system reacts to various types of failures by developing a realistic failure model, and then pinpoint reliability bottlenecks of the Internet. For validity of our simulation results, we generate topology graphs by addressing concerns over the incompleteness of topology and the inaccuracy of inferred AS relationships. By focusing on the impact of structural and policy properties, our analysis provides guidelines for future Internet design. The simulation tool we provide for analyzing routing resilience is also efficient to scale to Internet-size topologies.

View PDFchevron_right
A Framework for Reliability Computation of the IP Network
Zhen Qin

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007

As communication networks play an important role in today's life, network reliability becomes more critical than ever. Traditionally, network reliability is measured by connectivity or traffic volume. However, most of performance degradation problems are correlated with routing dynamic and congestion. It is necessary to include the both routing dynamics and congestion into network reliability computation. This paper proposes a new framework to compute the reliability. In this framework, the effects of multiple facts such as routing dynamics, traffic pattern and congestion probability are investigated. The reliability based on the proposed framework provides a new way for network operator to evaluate the performance of the IP network.

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved