Exploiting the power of multiplicity: a holistic survey of network-layer multipath

The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work

Distribution of on line Contents on Servers with GA Approach

ABSTRACT: All the traffic seen by the internet is treated equally which is generally known as Internet neutrality. Internet Neutrality enforces that all network traffic should be treated as equal and Best effort routing policy should be followed. But with the advent of smart applications this is drastically changing. Each network application has its own bandwidth requirement. We face the problem when required bandwidth of critical applications does not match with internet bandwidth. Because of network neutrality principle, core router can't priorities one traffic over other and critical applications may get impacted. Such types of problems are still in re-search phase As a solution here we will see how application level routing optimization mechanism with GA approach at edge routers can be useful for such types of application

Distributed Internet security and measurement

The Internet has developed into an important economic, military, academic, and social resource. It is a complex network, comprised of tens of thousands of independently operated networks, called Autonomous Systems (ASes). A significant strength of the Internet\u27s design, one which enabled its rapid growth in terms of users and bandwidth, is that its underlying protocols (such as IP, TCP, and BGP) are distributed. Users and networks alike can attach and detach from the Internet at will, without causing major disruptions to global Internet connectivity. This dissertation shows that the Internet\u27s distributed, and often redundant structure, can be exploited to increase the security of its protocols, particularly BGP (the Internet\u27s interdomain routing protocol). It introduces Pretty Good BGP, an anomaly detection protocol coupled with an automated response that can protect individual networks from BGP attacks. It also presents statistical measurements of the Internet\u27s structure and uses them to create a model of Internet growth. This work could be used, for instance, to test upcoming routing protocols on ensemble of large, Internet-like graphs. Finally, this dissertation shows that while the Internet is designed to be agnostic to political influence, it is actually quite centralized at the country level. With the recent rise in country-level Internet policies, such as nation-wide censorship and warrantless wiretaps, this centralized control could have significant impact on international reachability

A Stochastic Approach To Solving The Weight Setting Problem in OSPF Networks

In the world of Internetworks, to maintain a good connectivity of household, business and commercial computing, an exraordinary talent is important. Unpredictable dysfunction in its proper administration adds to the problems of this sophisticated network. One of the contributions in attempting to maintain the proper functioning of internetworking is made by the Open Shortest Path First (OSPF) protocol. It is a link state protocol designed to overcome the gap created by the Routing Information Protocol (RIP) in the internetworking domain. OSPF calculates the shortest paths from each source to all destinations using the Dijkstra’s algorithm based on the weights assigned to the links. In the past, various attempts have been made to resolve the congestion issues of Traffic Engineering. With such complex issues in the frameset, assigning weights to these large networks, resulting in the best cost is an NP-hard problem. In this thesis, a prudent approach of mitigating the mentioned problem by using a Stochastic Evolution (StocE) heuristic is used which provides a close to optimal solution to these kinds of problems. Through this work, an attempt has been made to optimize the weights on the network so as to minimize congestion. This approach is well supported by the results embedded towards the end of the work. Another core issue addressed in this work is the improvement of the network by considering single link failure scenarios. Two innovative strategies have been developed, where the same set of optimized weights for both topologies, i.e., with-link and without-link-failure, have been considered

A Stochastic Approach To Solving The Weight Setting Problem in OSPF Networks

In the world of Internetworks, to maintain a good connectivity of household, business and commercial computing, an exraordinary talent is important. Unpredictable dysfunction in its proper administration adds to the problems of this sophisticated network. One of the contributions in attempting to maintain the proper functioning of internetworking is made by the Open Shortest Path First (OSPF) protocol. It is a link state protocol designed to overcome the gap created by the Routing Information Protocol (RIP) in the internetworking domain. OSPF calculates the shortest paths from each source to all destinations using the Dijkstra’s algorithm based on the weights assigned to the links. In the past, various attempts have been made to resolve the congestion issues of Traffic Engineering. With such complex issues in the frameset, assigning weights to these large networks, resulting in the best cost is an NP-hard problem. In this thesis, a prudent approach of mitigating the mentioned problem by using a Stochastic Evolution (StocE) heuristic is used which provides a close to optimal solution to these kinds of problems. Through this work, an attempt has been made to optimize the weights on the network so as to minimize congestion. This approach is well supported by the results embedded towards the end of the work. Another core issue addressed in this work is the improvement of the network by considering single link failure scenarios. Two innovative strategies have been developed, where the same set of optimized weights for both topologies, i.e., with-link and without-link-failure, have been considered

Intelligent Network Infrastructures: New Functional Perspectives on Leveraging Future Internet Services

The Internet experience of the 21st century is by far very different from that of the early '80s. The Internet has adapted itself to become what it really is today, a very successful business platform of global scale. As every highly successful technology, the Internet has suffered from a natural process of ossification. Over the last 30 years, the technical solutions adopted to leverage emerging applications can be divided in two categories. First, the addition of new functionalities either patching existing protocols or adding new upper layers. Second, accommodating traffic grow with higher bandwidth links. Unfortunately, this approach is not suitable to provide the proper ground for a wide gamma of new applications. To be deployed, these future Internet applications require from the network layer advanced capabilities that the TCP/IP stack and its derived protocols can not provide by design in a robust, scalable fashion. NGNs (Next Generation Networks) on top of intelligent telecommunication infrastructures are being envisioned to support future Internet Services. This thesis contributes with three proposals to achieve this ambitious goal. The first proposal presents a preliminary architecture to allow NGNs to seamlessly request advanced services from layer 1 transport networks, such as QoS guaranteed point-to-multipoint circuits. This architecture is based on virtualization techniques applied to layer 1 networks, and hides from NGNs all complexities of interdomain provisioning. Moreover, the economic aspects involved were also considered, making the architecture attractive to carriers. The second contribution regards a framework to develop DiffServ-MPLS capable networks based exclusively on open source software and commodity PCs. The developed DiffServ-MPLS flexible software router was designed to allow NGN prototyping, that make use of pseudo virtual circuits and assured QoS as a starting point of development. The third proposal presents a state of the art routing and wavelength assignment algorithm for photonic networks. This algorithm considers physical layer impairments to 100% guarantee the requested QoS profile, even in case of single network failures. A number of novel techniques were applied to offer lower blocking probability when compared with recent proposed algorithms, without impacting on setup delay time

Towards effective control of P2P traffic aggregates in network infrastructures

Nowadays, many P2P applications proliferate in the Internet. The attractiveness of many of these systems relies on the collaborative approach used to exchange large resources without the dependence and associated constraints of centralized approaches where a single server is responsible to handle all the requests from the clients. As consequence, some P2P systems are also interesting and cost-effective approaches to be adopted by content-providers and other Internet players. However, there are several coexistence problems between P2P applications and In- ternet Service Providers (ISPs) due to the unforeseeable behavior of P2P traffic aggregates in ISP infrastructures. In this context, this work proposes a collaborative P2P/ISP system able to underpin the development of novel Traffic Engi- neering (TE) mechanisms contributing for a better coexistence between P2P applications and ISPs. Using the devised system, two TE methods are described being able to estimate and control the impact of P2P traffic aggregates on the ISP network links. One of the TE methods allows that ISP administrators are able to foresee the expected impact that a given P2P swarm will have in the underlying network infrastructure. The other TE method enables the definition of ISP friendly P2P topologies, where specific network links are protected from P2P traffic. As result, the proposed system and associated mechanisms will contribute for improved ISP resource management tasks and to foster the deployment of innovative ISP-friendly systems.This work has been partially supported by FCT - Fundação para a Ciência e Tecnologia Portugal in the scope of the project: UID/CEC/00319/2013