DocumentCode :
2331871
Title :
QRP03-4: Efficient Simulation of Bandwidth Allocation Dynamics in P2P Networks
Author :
Piccolo, Francesca Lo ; Bianchi, Giuseppe ; Cassella, Stefano
Author_Institution :
D.I.E.E.T, Univ. di Palermo, Palermo
fYear :
2006
fDate :
Nov. 27 2006-Dec. 1 2006
Firstpage :
1
Lastpage :
6
Abstract :
Fluid-flow simulation models of peer-to-peer (P2P) networks are an effective way to properly account for low-level network bottleneck details, meanwhile circumventing the scalability limits imposed by packet-based simulators. A fundamental component in a fluid-flow simulator is the algorithm for the computation of the achievable per-flow rate for several competing flows offered to a given network topology. This paper presents a novel efficient approach to compute, in an exact manner (i.e. with no approximations), the max-min fair rate allocation. Numerical results demonstrate that our proposed algorithm outperforms traditional max-min computation approaches by as much as a factor 100 for a million nodes network.
Keywords :
bandwidth allocation; minimax techniques; peer-to-peer computing; telecommunication network topology; P2P networks; bandwidth allocation; fluid-flow simulation models; max-min computation; max-min fair rate allocation; network topology; packet-based simulators; peer-to-peer networks; Analytical models; Bandwidth; Channel allocation; Computational modeling; Computer networks; Discrete event simulation; Network topology; Peer to peer computing; Resource management; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE
Conference_Location :
San Francisco, CA
ISSN :
1930-529X
Print_ISBN :
1-4244-0356-1
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2006.433
Filename :
4151063
Link To Document :
بازگشت