Paper Info
Title
Benchmarking of Signaling Based Resource Reservation in the Internet
Abstract
This paper investigates the scalability limitations of IP resource reservation protocols using RSVP and Boomerang as examples. The memory and processing time consumption of signaling message primitives were measured as a function of the total number of concurrent reservation sessions on PC-based routers running Linux and on a commercial router. The signaling handling algorithm of the implementations were analyzed as well and critical operations were identified. Our results show that CPU time is a more significant scalability concern than the router memory and also that the former is very dependent on the implementation and complexity of the signaling algorithm. Thus the same Linux PC can handle Boomerang reservation requests several hundred times faster than RSVP requests.
Year
DOI
Venue
2000
10.1007/3-540-45551-5_54
Networking
Keywords
Field
DocType
ip resource reservation protocol,boomerang reservation request,handling algorithm,processing time consumption,rsvp request,linux pc,commercial router,cpu time,resource reservation,concurrent reservation session,hundred time
Reservation,CPU time,Computer science,Computer network,Implementation,Router,Operating system,Benchmarking,Scalability,The Internet
Conference
Volume
ISSN
ISBN
1815
0302-9743
3-540-67506-X
Citations 
PageRank 
References 
4
0.52
7
Authors
3
Name
Order
Citations
PageRank
István Cselényi1142.67
Gábor Fehér2276.03
Krisztián Németh3173.29