Positioning Relay Nodes in ISP Network

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.

IEEE Transactions on Dependable and Secure Computing, 2006

Several research studies have been devoted to improving the reliability and performance of the Internet by utilizing redundant communication paths between end points. Multihoming, coupled with intelligent route control, and overlay networks are two main streams in this area of research which attempt to leverage redundant connections of the Internet for increased reliability and performance. However, the effectiveness of these approaches depends on the natural diversity of redundant paths between two endhosts in terms of physical links, routing infrastructure, administrative control, and geographical distribution. Even in the case of redundant paths, if traffic between two hosts is not actually routed along completely disjoint paths, congestion or failure of a single shared link or router can adversely affect the end-to-end performance or availability of all paths. This paper presents an experimental study of path diversity on the Internet, focusing on the impact of path diversity on multihomed and overlay networks. We base our analysis on traceroutes and routing table data collected from several vantage points in the Internet including: looking glasses at 10 major Internet Service Providers (ISPs), RouteViews servers from 20 ISPs, and more than 50 PlanetLab nodes globally distributed across the Internet. Using this data, we quantify the extent of path diversity in multihoming and overlay networks, highlighting the limitations, and also identifying the source of the limitations in these architectures. From the analysis, we learn that both multihoming route control and current overlay networks are not able to ensure path diversity, which makes it very difficult to provide high-availability services even with the use of these systems. We believe that this work provides the insight into building future systems based on understanding path diversity.

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...

Telecommunication Systems, 2013

Path Diversification is a new mechanism that can be used to select multiple paths between a given ingress and egress node pair using a quantified diversity measure to achieve maximum flow reliability. The path diversification mechanism is targeted at the end-to-end layer, but can be applied at any level for which a path discovery service is available. Path diversification also takes into account service requirements for low-latency or maximal reliability in selecting appropriate paths. Using this mechanism will allow future internetworking architectures to exploit naturally rich physical topologies to a far greater extent than is possible with shortest-path routing or equal-cost load balancing. We describe the path diversity metric and its application at various aggregation levels, and apply the path diversification process to 13 real-world network graphs as well as 4 synthetic topologies to asses the gain in flow reliability. Based on the analysis of flow reliability across a range of networks, we then extend our path diversity metric to create a compos-* Work performed while at The University of Kansas ite compensated total graph diversity metric that is representative of a particular topology's survivability with respect to distributed simultaneous link and node failures. We tune the accuracy of this metric having simulated the performance of each topology under a range of failure severities, and present the results. The topologies used are from nationalscale backbone networks with a variety of characteristics, which we characterize using standard graph-theoretic metrics. The end result is a compensated total graph diversity metric that accurately predicts the survivability of a given network topology.

This deliverable is part of WP3 (Cognitive network and system experimentation). The feasibility, benefits and applicability of introducing a cognitive engine in the ECODE architecture are experimented using a number of use cases covering different problem areas identified as Internet architectural and design challenges. In particular we address techniques for path availability estimation, for improving network recovery and resiliency, and profile-based accountability. The following three use cases are studied in depth: � Path availability: the goal is to design and experiment techniques, embedded in our so-called IDIPS server, to rank internet paths based on their characteristics, such as delays, and available throughput. To this end, on-line machine learning techniques are used to estimate future path characteristics based on past measurements, in order to reduce the future measurement load. Machine learning techniques are also used to Improve Internet Coordinate Systems to better ...

2009

This issue (DOI: 10.13140/RG.2.1.1392.4882) includes the following papers; P1140905606 T.V.P.Sundararajan and A.Shanmugam Performance Analysis of Selfish Node Aware Routing Protocol for Mobile Ad Hoc Networks P1140906639 D. Sharmila and R. Neelaveni Performance Evaluation of VHDL Implementation of Proposed SAFER+ Security Algorithm and Pipelined AES Security Algorithm for Bluetooth Security Systems P1140909660 Masashi Sugano and Ryo Fukushima and Masayuki Murata and Takaaki Hatauchi Low-Energy-Consumption Ad Hoc Mesh Network based on Intermittent Receiver-driven Transmission P1140834314 Manal Abdullah and Helen Bakhsh Agent-based Dynamic Routing System for MANETs P1140912684 Mina Malekzadeh and Abdul Azim Abdul Ghani and Jalil Desa and Shamala Subramaniam Vulnerability Analysis of Extensible Authentication Protocol (EAP) DoS Attack over Wireless Networks P1140916723 S.Anuradha and G.Raghu Ram and K.E.Srinivasa Murthy and V.Raghunath Reddy and B.Sathynarayana Genesis of DB Routing Algorithm in Unicasting Network P1140921744 Rathi S and Thanushkodi K A Scalable and Secure Mobile Registration Protocol for IPv6

This Issue (DOI: 10.13140/RG.2.1.1785.7045) includes the following papers; P1140928803, D.Kavitha and K.E.Sreenivasa Murthy and B.Sathyanarayana and V.Raghunatha Reddy and S.Zahor ul Huq, "Securing Binding Updates in Routing Optimizaton of Mobile IPv6" P1141011025, KHALID ABDULMOHSIN BURAGGA, "Effectiveness of Accessibility and Usability of Saudi E-Government: an Objective Study" P1141011024, Ghada Abdelmouez M and Fathy S. Helail and Abdellatif A. Elkouny, "Elliptic Curve Cryptographic Based DES Reinforcement" P1121015047, Ahmad Ali Al-Zubi, "Identification of Information Systems Threats Sources: An Analytical Study" P1141038308, A. Milenkoski, "Assessment of the Diversity of the TCP Congestion Control Evaluation Techniques, an Academic Survey of Articles (1989-2009)" P1141038307, Shrirang Ambaji Kulkarni and G. Raghavendra Rao, "Applying Optimized Mobility Model for Reinforcement Learning Based Routing Algorithm for Mobile Ad Hoc Network" P1141052911, R. Maheswar and R. Jayaparvathy, "Performance Analysis using Contention Based Queueing Model for Wireless Sensor Networks" P1141052912, S.Geetha and R.Jayaparvathy, "Generalized Stochastic Petri net Approach to model bandwidth allocation in IEEE 802.20 MAC"

2008

In this paper we examine how metrics impact route selection, looking at which metric(s) are selected and how these metrics are used to calculated cost. Examining multiple and dynamic metrics currently in use and looking toward a proposal of agent carrying dynamic metric information across an autonomous system.

ACM Transactions on Modeling and Performance Evaluation of Computing Systems

Interactive and multimedia applications depend on the stability of end-to-end paths for predictable performance and good quality of service. On the other hand, network providers depend on multiple paths to ensure fault tolerance and use load balancing between these paths to enhance the overall network throughput. In this study, we analyze path dynamics for both end-to-end paths and path segments within service providers’ networks using 2 months of measurement data from the RIPE Atlas platform, which collects path traces between a fixed set of source and destination pairs every 15 minutes. We observe that 78% of the end-to-end routes have at least two alternative Autonomous System (AS) paths with some end-to-end routes going through hundreds of different AS paths during the 2 months of analysis. While AS level paths are often prevalent for a day, there are considerable changes in the routing of the trace packets over the ASes for a longer duration of a month or longer. Analyzing end-...