A linked-list data structure for advance reservation admission control

Authors:
Qing Xiong;Chanle Wu;Jianbing Xing;Libing Wu;Huyin Zhang
Affiliations:
School of Computer, Wuhan University, Wuhan, China;National Engineering Research Center of Multimedia Software, Wuhan, China;School of Computer, Wuhan University, Wuhan, China;School of Computer, Wuhan University, Wuhan, China;School of Computer, Wuhan University, Wuhan, China
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 2
Cited 6

Performance Issues of Bandwidth Reservations for Grid Computing

SBAC-PAD '03 Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing
Bandwidth tree - a data structure for routing in networks with advanced reservations

PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International

Scheduling bulk file transfers with start and end times

Computer Networks: The International Journal of Computer and Telecommunications Networking
GarQ: An efficient scheduling data structure for advance reservations of grid resources

International Journal of Parallel, Emergent and Distributed Systems
Multicriteria, multi-user scheduling in grids with advance reservation

Journal of Scheduling
A Flexible Reservation Algorithm for Advance Network Provisioning

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Hierarchical scheduling strategies for parallel tasks and advance reservations in grids

Journal of Scheduling
List-based Data Structures for Efficient Management of Advance Reservations

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the development of multimedia and grid technologies, more and more distributed applications require guaranteed quality of service and maintain minimum network resource during their running sessions. Thus advance reservation is necessary because it provides a solution for the need of reserving network resources for future use. Many kinds of data structures were proposed to perform fast and efficient admission control. Most of them are based on the time-slotted method, which needs to make an appropriate tradeoff between the efficiency and the granularity of the time slots. In this paper, a linked-list data structure is proposed to perform the admission control for advance reservation. Compared with the existing bandwidth tree and time-slotted array, the proposed linked list shows better performance.