EconPapers    
Economics at your fingertips  
 

ON A NEW CLASS OF LOAD BALANCING NETWORK PROTOCOLS

S. Eidenbenz, A. Å Hansson, V. Ramaswamy and C. M. Reidys ()
Additional contact information
S. Eidenbenz: Los Alamos National Laboratory, CCS-3, 87545 New Mexico, USA
A. Å Hansson: Los Alamos National Laboratory, CCS-3, 87545 New Mexico, USA
V. Ramaswamy: Los Alamos National Laboratory, CCS-3, 87545 New Mexico, USA
C. M. Reidys: Los Alamos National Laboratory, CCS-3, 87545 New Mexico, USA

Advances in Complex Systems (ACS), 2007, vol. 10, issue 03, 359-377

Abstract: In this paper we study a new class of generic, parametrized,locally load-sensing(LLS) network-routing protocols over simple graphs,Y. These protocols areY-"local" in the sense that they transmit packets only betweenY-adjacent vertices and LLS since they base their "routing decisions" dynamically on queue-sizes of their neighbors and their relative distance to the destination. In the system each vertex has specific data-queues indexed by its respectiveY-neighbors. Thestateof a vertex then consists of the collection of queue-sizes. The data-transmission protocols are formally specified in the framework ofsequential dynamical systems, which allows us to categorize and classify our experiments. We will investigate the following scenario: for fixedYwe assume a single source/destination pair to be given and asystem-updatethen consists of the collection of local protocol updates according to some fixed permutation of theY-vertices. We then iterate the system-updates and thereby obtain the time evolution of the queue-sizes of the vertices. We will present and discuss results on the evolution of theload, i.e. the total number of packets in the network, thethroughput, i.e. the rate at which packets arrive at the destination, and study the dependence of the queue-size dynamics on various other system parameters. In particular, we will analyze update schedule dependency and the impact of queue-capacity on system stability. We will show that our protocols can adapt and dynamically utilize new routes in a fixed network.

Keywords: Sequential dynamical system; TCP; network; protocol (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0219525907001148
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:acsxxx:v:10:y:2007:i:03:n:s0219525907001148

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0219525907001148

Access Statistics for this article

Advances in Complex Systems (ACS) is currently edited by Frank Schweitzer

More articles in Advances in Complex Systems (ACS) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().

 
Page updated 2025-03-20
Handle: RePEc:wsi:acsxxx:v:10:y:2007:i:03:n:s0219525907001148