Model and call admission control for distributed applications with correlated bursty traffic
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
ATM network design and optimization: a multirate loss network framework
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Competitive dynamic bandwidth allocation
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Bandwidth Allocation with Preemption
SIAM Journal on Computing
IEEE Transactions on Parallel and Distributed Systems
Self-Similar Network Traffic and Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
Journal of Parallel and Distributed Computing
Collective Value of QoS: A Performance Measure Framework for Distributed Heterogeneous Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Evaluation of Expanded Heuristics in a Heterogeneous Distributed Data Staging Network
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
On the relationship between file sizes, transport protocols, and self-similar network traffic
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
On-line Dynamic Bandwidth Allocation
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
A dynamic quality of service framework for video in broadband networks
IEEE Network: The Magazine of Global Internetworking
IEEE/ACM Transactions on Networking (TON)
Architecture for dynamic and fair distribution of bandwidth
International Journal of Network Management
Preemptive and delay-based mechanisms to provide preference to emergency traffic
Computer Networks and ISDN Systems
Network utility maximization for triple-play services
Computer Communications
Distributed utility-based rate adaptation protocols for prioritized, quasi-elastic flows
ACM SIGMOBILE Mobile Computing and Communications Review
Adaptive online bandwidth allocation and reservation for QoS sensitive multimedia networks
Computer Communications
Preemptive and delay-based mechanisms to provide preference to emergency traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
A balanced revenue-based resource sharing scheme for advance and immediate reservations
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II
| Hi-index | 0.00 |
Abstract: Bandwidth allocation is a fundamental problem in communication networks. The problem of bandwidth allocation is further intensified when the requested bandwidth exceeds the available unused bandwidth and so not all requests can be completely served. This research examines on-line bandwidth allocation, where the decision for acceptance or rejection of the request has to be made when future requests and their arrival statistics are not known. A request can be defined as a flow of information from a source to a destination with a certain amount of bandwidth, a priority level, a utility function that is based on the bandwidth received, and a worth that is based on the utility function and the priority level. The goal of this research is to develop a scheduling heuristic for an overloaded system that attempts to schedule the requests such that the sum of the worths of the requests satisfied in a fixed interval of time is the maximum. The scheduling heuristic can preempt or degrade already-scheduled requests. Three different types of utility functions (step, linear, and concave) are examined. Other parameters being considered include network loading and the relative weights of the different priority levels. The heuristic variations developed are shown to perform well compared to a complete sharing policy and an upper bound.