Dynamic Resource Allocation for Classes of Prioritized Session and Data Requests in Preemptive Heterogeneous Networks

This research focuses on the intelligent allocation of bandwidth to requests in oversubscribed preemptive networks such that some measure of collective worth associated with the satisfied requests is optimized. A class and priority based mechanism is described for grouping requests such that all requests belonging to a higher class are processed before any request(s) of a lower class are considered. Within each class, requests are further assigned different priority levels depending on their relative worths. An on-line batch scheduling heuristic is designed to determine the bandwidth allocations to the requests depending on their class, relative worths of their priority levels, and the network capacities available for that period. This heuristic considers requests of two types: (1) data type – requesting a data item of given size with an earliest available time and fixed deadline and (2) session type – requesting a fixed amount of bandwidth for a given interval of time. Simulation experiments demonstrate that the heuristic performs well compared to a complete sharing policy and to upper bounds.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[3]  Frank Kelly,et al.  Tariffs and effective bandwidths in multiservice networks , 1994 .

[4]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[5]  Ajay D. Kshemkalyani,et al.  Connection preemption: issues, algorithms, and a simulation study , 1997, Proceedings of INFOCOM '97.

[6]  G. Ramamurthy,et al.  Multi-class connection admission control policy for high speed ATM switches , 1997, Proceedings of INFOCOM '97.

[7]  Bruce Hajek,et al.  On causal scheduling of multiclass traffic with deadlines , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[8]  Sem C. Borst,et al.  Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic , 1998, IEEE J. Sel. Areas Commun..

[9]  Arun K. Sood,et al.  Threshold-based admission control for multi-class video-on-demand systems , 1998, 1998 IEEE International Performance, Computing and Communications Conference. Proceedings (Cat. No.98CH36191).

[10]  Ajay D. Kshemkalyani,et al.  Decentralized Network Connection Preemption Algorithms , 1998, Comput. Networks.

[11]  Edwin K. P. Chong,et al.  Dynamic Bandwidth Allocation for Requests with Classes and Priorities in Preemptive Distributed Networks , 2000 .

[12]  Howard Jay Siegel,et al.  A Mathematical Model and Scheduling Heuristics for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network , 2000, IEEE Trans. Parallel Distributed Syst..

[13]  Howard Jay Siegel,et al.  Evaluation of expanded heuristics in a heterogeneous distributed data staging network , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[14]  Edwin K. P. Chong,et al.  A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[15]  Edwin K. P. Chong,et al.  Heuristics for Scheduling Data Requests Using Collective Communications in a Distributed Communication Network , 2001, J. Parallel Distributed Comput..

[16]  Michael Jurczyk,et al.  Bandwidth tracking in distributed heterogeneous networking environments , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.