Algorithmic Implementation of Load Balancing �in Wireless LAN

Intra domain traffic engineering (TE) has become an indispensable tool for Internet Service Providers (ISPs) to optimize network performance and utilize network resources efficiently. Various explicit routing TE methods were recently proposed and have been able to achieve high network performance. However, explicit routing has high complexity and requires Large Ternary Content Addressable Memories (TCAMs) in the routers. Moreover, it is costly to deploy explicit routing in IP networks. In this project, we present an approach, called Generalized Destination-Based Multipath Routing (GDMR), to achieve the high performance as explicit routing. The main contribution of this project is to enhance an arbitrary explicit routing can be converted to a loop-free destination-based routing without any performance penalty for a given traffic matrix. We present a systematic approach including a heuristic algorithm to realize GDMR. Extensive evaluation demonstrates the effectiveness and robustness of GDMR

Backward Compatible Multi-Path Routing

This project studies the behaviour of multipath routing compared to single path routing in order to demonstrate the different benefits that multipath offers. For this purpose, it have been implemented routers that have 2 routing tables with the capability of storing in one these routing tables the primary next hop for a destination through the shortest path which is calculated by the Open Shortest Path First (OSPF) algorithm, as well as storing a secondary next hop calculated by the Ideal Multipath Routing Expedient (IMRE) algorithm in order to have different paths for the same destination. Besides matching on the destination address, the routers select between the primary and secondary tables based on the Time To Live (TTL) field of the IP header. The end-system can change the forwarding path immediately upon it senses the degradation of the current path by sending the packets with a different TTL value, without waiting for the slow convergence of OSPF to the changed topology. This multipath behaviour is measured for 3 different use cases. First use case measures the throughput and transmission time when transmitting a file in an ideal scenario where there are no other transmissions at the same time. Second use case performs the measurements for the same transmission as before but when there is a transmission that makes 2 links of the shortest path to be overloaded in order to check the load balancing capability of multipath routing. Finally, the third use case studies the behaviour of multipath routing when there is a failure in a link during the transmission and checks its failure resilience characteristic. Furthermore, I have studied the paths provided by the IMRE algorithm with a specific TTL match rule. I have demonstrated that in this architecture some TTLs might result in loops, hence, the set of available TTLs for the end-system has to be selected with care

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

Algorithmic Implementation of Load Balancing –in Wireless LAN

Intra domain traffic engineering (TE) has become an indispensable tool for Internet service providers (ISPs) to Optimize network performance and utilize network resources efficiently . Various explicitrouting TE methods were recently proposed and have been able to achieve high network performance. However, explicit routing has high complexity and requires large ternary content addressable memories (TCAMs) in the routers. Moreover, it is costly to deploy explicit routing in IP networks. In this paper, we present an approach, called generalized destination-based multipath routing (GDMR), to achieve the same high performance as explicit routing. The main contribution of this paper is that we prove that an arbitrary explicit routing can be converted to a loop-free destination-based routing without any performance penalty for a given traffic matrix. We present a systematic approach including a heuristic algorithm to realize GDMR. Extensive evaluation demonstrates the effectiveness and robustness of GDMR