.png){kind=icon}
.png){kind=icon}
Return
REBOOK: A Deterministic, Robust and Scalable Resource Booking Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10922-010-9167-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the resource reservation problem in a packet switching network. REBOOK, the presented algorithm, provides deterministic, fast (real-time) dynamic resource allocation and release. Based on a stateful approach, it handles faults and network errors, and recovers from route changes and unexpected flows shutdown. The distributed scheme used to store flows information avoids the need of searching for entries within the routers' control memory when packets are received and guarantees constant complexity. REBOOK can be implemented in hardware and is compatible with any packet switching network. In the Internet, it can be integrated in TCP or used with UDP to make it network friendly. Moreover, a slightly extended implementation of RSVP can be used as signalling and hosting protocol. A software implementation as standalone protocol has been developed to prove its effectiveness, robustness, and performance.
Keywords:
Quality of Service
Network reliability
Fast resource reservation
Transmission rate control
Congestion avoidance
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
1.0K
Citations:
1.3K