346 research outputs found
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
Aspects of proactive traffic engineering in IP networks
To deliver a reliable communication service over the Internet
it is essential for
the network operator to manage the traffic situation in the network.
The traffic situation is controlled by
the routing function which determines what path traffic follows from source
to destination.
Current practices for setting routing parameters in IP networks are
designed to be simple to manage. This can lead to congestion in
parts of the network while other parts of the network are
far from fully utilized. In this thesis we explore issues related
to optimization of the routing function to balance load in the network
and efficiently deliver a reliable communication service to the users.
The optimization takes into account not only the traffic situation under
normal operational conditions, but also traffic situations that appear
under a wide variety of circumstances deviating from the nominal case.
In order to balance load in the network knowledge of the traffic
situations is needed. Consequently, in this thesis
we investigate methods for efficient derivation of the
traffic situation. The derivation is based on estimation of
traffic demands from link load measurements. The advantage
of using link load measurements is that they are easily obtained and consist
of a limited amount of data that need to be processed. We evaluate and demonstrate how estimation
based on link counts gives the operator a fast and accurate description
of the traffic demands. For the evaluation we have access to a unique data
set of complete traffic demands from an operational
IP backbone.
However, to honor service level agreements at all times the variability
of the traffic needs to be accounted for in the load balancing.
In addition, optimization techniques are often sensitive to errors and
variations in input data. Hence, when an optimized routing setting is
subjected to real traffic demands in the network, performance often
deviate from what can be anticipated from the optimization. Thus,
we identify and model different traffic uncertainties and describe
how the routing setting can be optimized, not only for a nominal case,
but for a wide range of different traffic situations that might appear
in the network.
Our results can be applied in MPLS enabled networks as well as in
networks using link state routing protocols such as the widely used
OSPF and IS-IS protocols. Only minor changes may be needed in current
networks to implement our algorithms.
The contributions of this thesis is that we: demonstrate that it is
possible to estimate the traffic matrix with acceptable precision, and
we develop methods and models for common traffic uncertainties to
account for these uncertainties in the optimization of the routing
configuration. In addition, we identify important properties in the
structure of the traffic to successfully balance uncertain and
varying traffic demands
Application of ant based routing and intelligent control to telecommunications network management
This thesis investigates the use of novel Artificial Intelligence techniques to improve the control of telecommunications networks. The approaches include the use of Ant-Based Routing and software Agents to encapsulate learning mechanisms to improve the performance of the Ant-System and a highly modular approach to network-node configuration and management into which this routing system can be incorporated. The management system uses intelligent Agents distributed across the nodes of the network to automate the process of network configuration. This is important in the context of increasingly complex network management, which will be accentuated with the introduction of IPv6 and QoS-aware hardware. The proposed novel solution allows an Agent, with a Neural Network based Q-Learning capability, to adapt the response speed of the Ant-System - increasing it to counteract congestion, but reducing it to improve stability otherwise. It has the ability to adapt its strategy and learn new ones for different network topologies. The solution has been shown to improve the performance of the Ant-System, as well as outperform a simple non-learning strategy which was not able to adapt to different networks. This approach has a wide region of applicability to such areas as road-traffic management, and more generally, positioning of learning techniques into complex domains. Both Agent architectures are Subsumption style, blending short-term responses with longer term goal-driven behaviour. It is predicted that this will be an important approach for the application of AI, as it allows modular design of systems in a similar fashion to the frameworks developed for interoperability of telecommunications systems
Self-stabilizing cluster routing in Manet using link-cluster architecture
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called a clusterhead that contains the routing information about inter and intra-cluster communication. A cluster is comprised of all nodes that choose the corresponding clusterhead as their leader. The algorithm consists of two main tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, it is within two hops of the clusterhead, it knows the direct neighbor on the shortest path towards the clusterhead, and there exist no two adjacent clusterheads. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterheads (as per the link-cluster architecture), there is no need to check the consistency of the routing tables. Second, since all other nodes have significantly less work (they only forward messages), they use much less power than the clusterheads. Therefore, if a clusterhead runs out of power, a neighboring node (that is not a clusterhead) can accept the role of a clusterhead. (Abstract shortened by UMI.)
Resilient routing in the internet
Although it is widely known that the Internet is not prone to random failures, unplanned failures due to
attacks can be very damaging. This prevents many organisations from deploying beneficial operations
through the Internet. In general, the data is delivered from a source to a destination via a series of
routers (i.e routing path). These routers employ routing protocols to compute best paths based on routing
information they possess. However, when a failure occurs, the routers must re-construct their routing
tables, which may take several seconds to complete. Evidently, most losses occur during this period.
IP Fast Re-Route (IPFRR), Multi-Topology (MT) routing, and overlays are examples of solutions
proposed to handle network failures. These techniques alleviate the packet losses to different extents,
yet none have provided optimal solutions. This thesis focuses on identifying the fundamental routing
problem due to convergence process. It describes the mechanisms of each existing technique as well as
its pros and cons. Furthermore, it presents new techniques for fast re-routing as follows.
Enhanced Loop-Free Alternates (E-LFAs) increase the repair coverage of the existing techniques,
Loop-Free Alternates (LFAs). In addition, two techniques namely, Full Fast Failure Recovery (F3R) and
fast re-route using Alternate Next Hop Counters (ANHC), offer full protection against any single link
failures. Nevertheless, the former technique requires significantly higher computational overheads and
incurs longer backup routes. Both techniques are proved to be complete and correct while ANHC neither
requires any major modifications to the traditional routing paradigm nor incurs significant overheads.
Furthermore, in the presence of failures, ANHC does not jeopardise other operable parts of the network.
As emerging applications require higher reliability, multiple failures scenarios cannot be ignored.
Most existing fast re-route techniques are able to handle only single or dual failures cases. This thesis
provides an insight on a novel approach known as Packet Re-cycling (PR), which is capable of handling
any number of failures in an oriented network. That is, packets can be forwarded successfully as long
as a path between a source and a destination is available. Since the Internet-based services and applications
continue to advance, improving the network resilience will be a challenging research topic for the
decades to come
- …