TITLE

Self avoiding paths routing algorithm in scale-free networks

AUTHOR(S)
Rachadi, Abdeljalil; Jedra, Mohamed; Zahid, Noureddine
PUB. DATE
March 2013
SOURCE
Chaos;Mar2013, Vol. 23 Issue 1, p013114
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper, we present a new routing algorithm called 'the self avoiding paths routing algorithm.' Its application to traffic flow in scale-free networks shows a great improvement over the so called 'efficient routing' protocol while at the same time maintaining a relatively low average packet travel time. It has the advantage of minimizing path overlapping throughout the network in a self consistent manner with a relatively small number of iterations by maintaining an equilibrated path distribution especially among the hubs. This results in a significant shifting of the critical packet generation rate over which traffic congestion occurs, thus permitting the network to sustain more information packets in the free flow state. The performance of the algorithm is discussed both on a Barábasi-Albert network and real autonomous system network data.
ACCESSION #
86446921

 

Related Articles

  • On a Routing Method of WSN - in a Complex Networks View. Ye XU; Yueqiu JIANG // Sensors & Transducers (1726-5479);Jan2014, Vol. 162 Issue 1, p146 

    This document presents a routing method and corresponding protocol in wireless sensor networks - in a Complex Networks view. The algorithm could be used to form a WSN with a scale-free-network-like topology which helps shorten the length of the routing path. Together with the information fusion...

  • An Energy-aware Iterative Sampling Framework for Data Gathering in Wireless Sensor Networks. Jun Wang; Zhenglu Wang; Yong Cheng; Yongsheng Zhu // International Journal of Grid & Distributed Computing;Aug2013, Vol. 6 Issue 4, p9 

    Large numbers of nodes are often densely deployed to deliver the desired environmental attributes to the sink in Wireless Sensor Networks (WSNs), so there is a high spatial correlation among the readings of close sensor nodes. Given a certain requirement for accuracy, only part of the sensor...

  • Data loss for Power Line Communication of nonlinear systems Iterative Learning Control. Yinjun Zhang // Advanced Materials Research;2014, Issue 1048, p537 

    When we use power line as data carrier, due to the complexity of the PLC network environment, data packet loss frequently, so the paper deal with the iterative learning control for a class of nonlinear systems with measurement dropouts in the PLC, and studies the P-type iterative learning...

  • Analysis of Iterative Learning Control Algorithm for Remote Linear Systems with Output Measurement Dropouts. Xuhui Bu; Fashan Yu; Hongwei Zhang; Tao Zhang // International Journal of Advancements in Computing Technology;Jun2012, Vol. 4 Issue 11, p158 

    In this paper, the iterative learning control (ILC) is considered for a class of linear systems with output measurement dropout. It is assumed that an ILC algorithm is implemented via a networked control system and that during the packet transfer between the remote plant and the ILC controller...

  • P-law reasoning and unknown law discovery-application. Yu Xiu-qing // Journal of Convergence Information Technology;Feb2012, Vol. 7 Issue 3, p146 

    Function packet sets (function P-sets) is a pair of function sets, which is composed of function internal packet set (function internal P-set) and function outer packet set (function outer P-set). It has dynamic and law characteristics. Based on it, the study presents concepts of internal packet...

  • On the Locality Modeling of Web Access Stream. Huixia Wang; Yao Yao // International Journal of Grid & Distributed Computing;2014, Vol. 7 Issue 5, p149 

    Using mathematical method to model Web workload locality characteristics is established based on the study of entropy and coefficient of variation. Experiments show that these metrics can depict locality characteristics more properly and are much easier to use.

  • MIMO Detection Techniques Based on Low Complexity Adaptive QR-Decomposition with M-Algorithm for 3GPP LTE Systems. Hui, Bing; Mohaisen, Manar; Han, Dongkeol; Chang, KyungHi; Baek, YoungSeok; Koo, Bontae // Wireless Personal Communications;Dec2012, Vol. 67 Issue 3, p505 

    In this paper, two novel multiple-input multiple-output (MIMO) detection algorithms, adaptive parallel QRDM (APQRDM) and adaptive iterative QRDM (AIQRDM) which are able to achieve the similar detection throughput as conventional QRDM while reducing the computational complexity, are introduced,...

  • Average Bandwidth Allocation Model of WFQ. Balogh, Tomáš; Medvecký, Martin // Modelling & Simulation in Engineering;2012, p1 

    We present a new iterative method for the calculation of average bandwidth assignment to traffic flows using a WFQ scheduler in IP based NGN networks. The bandwidth assignment calculation is based on the link speed, assigned weights, arrival rate, and average packet length or input rate of the...

  • Power Savings in Packet Networks via Optimised Routing. Gelenbe, Erol; Morfopoulou, Christina // Mobile Networks & Applications;Feb2012, Vol. 17 Issue 1, p152 

    This paper examines the use of a gradient-based algorithm for Quality of Service (QoS) and power minimisation in wired networks to result on reduced energy consumption. Two distinct schemes, conventional shortest-path routing and an autonomic algorithm energy aware routing algorithm (EARP) are...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics