Performance comparison of end‐to‐end and on‐the‐spot traffic‐aware techniques

Large-scale failures in telecommunication networks have been traditionally mitigated by attempting to preserve global connectivity in the network. However, although communication inside communities may be of high relevance, their preservation is a challenging task. To achieve this, we propose a new concept of community that combines not only the topological information of the network but also the traffic-level interaction. This new concept is then used to present six novel community-based strategies that, when working within a limited budget, are able to determine which are the best candidate nodes to protect. The strategies proposed have been tested over four different types of networks and have been compared with other well-known immunization or protection methods. Results show that community-based strategies better preserve the inner community traffic with respect to traditional approaches. Furthermore, in some cases, both global and intra-community traffic preservation is able to be improvedThis work is partly supported by the Spanish Ministerio de Ciencia e Innovacion through project RoGER (Robustness against large-scale failures in interdomain routing, TEC2012-32336), Juan de la Cierva subprogram grant no. JCI-2010-08322, and by the Generalitat de Catalunya through the Research Support Program project SGR-1202 and AGAUR FI-DGR 2012 gran

Section: Discussionmentioning

confidence: 98%

Community‐based traffic preservation in telecommunication networks

Torres-Padrosa

Manzano

Calle

et al. 2013

“…This problem is complicated because it requires a full information about the network load in order to make better selection of route, and it also has to deal with the distribution of the load in mobile environment. To solve this problem, Raad S. Al-Qassas and Mohamed Ould-Khaoua in [21] proposed traffic-aware routing techniques.…”

Section: Related Workmentioning

confidence: 99%

Queue‐based multiple path load balancing routing protocol for MANETs

Naseem

Kumar

2016

SUMMARYCongestion in the network is the main cause for packet drop and increased end-to-end transmission delay of packet between source and destination nodes. Congestion occurs because of the simultaneous contention for network resources. It is very important to efficiently utilize the available resources so that a load can be distributed efficiently throughout the network. Otherwise, the resources of heavily loaded nodes may be depleted very soon, which ultimately affects network performances. In this paper, we have proposed a new routing protocol named queue-based multiple path load balancing routing protocol. This protocol discovers several node-disjoint paths from source to destination nodes. It also finds minimum queue length with respect to individual paths, sorts the node-disjoint paths based on queue length, and distributes the packets through these paths based on the minimum queue length. Simulation results show that the proposed routing protocol distributes the load efficiently and achieves better network performances in terms of packet delivery ratio, end-to-end delay, and routing overhead.

“…for all arcs e in E if the arc e is in P i then f p =true else if the vertex v is in P i then f v =true end if end for end for return (P 1 ,P 2 ,…,P N ) M-Dijkstra(G i ,s) algorithm uses the minimum delays instead of the shortest hops to calculate the multiple paths from the source to the destination, which is useful to prevent the creation of congested areas in the network, resulting in improved network performance [27,28]. By setting the values (f p and f v ), disjoint paths from s to d is obtained.…”

Section: Multipath Dijkstra Algorithmmentioning

confidence: 99%

Delay constraint multipath routing for wireless multimedia ad hoc networks

Sun

Zhao

et al. 2014

According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node-disjoint or link-disjoint multipaths will be built through the route computation. The simulation and test results show that QoS-MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end-to-end delay of QoS-MOLSR is four times less than the optimized link state routing.