Analysis of Packet Delay in a GI-G-1 Queue with Non-preemptive Priority Scheduling
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Performance Analysis of a GI-G-1 Preemptive Resume Priority Buffer
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Performance analysis of a single-server ATM queue with a priority scheduling
Computers and Operations Research
Two priority buffered multistage interconnection networks
Journal of High Speed Networks
Parametric delay differentiation between packet flows using multiple reserved spaces
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Place reservation: Delay analysis of a novel scheduling mechanism
Computers and Operations Research
Controlling the delay trade-off between packet flows using multiple reserved places
Performance Evaluation
Time-dependent performance analysis of a discrete-time priority queue
Performance Evaluation
Bandwidth problems in high-speed networks
IBM Journal of Research and Development
A discrete-time queueing system under frame-bound priority
Proceedings of the 5th International Conference on Queueing Theory and Network Applications
Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling
Network performance engineering
| Hi-index | 0.25 |
When designing and configuring an ATM-based B-ISDN, it remains difficult to guarantee the quality of service (QoS) for different service classes, while still allowing enough statistical sharing of bandwidth so that the network is efficiently utilized. These two goals are often conflicting. Guaranteeing QoS requires traffic isolation, as well as allocation of enough network resources (e.g., buffer space and bandwidth) to each call. However, statistical bandwidth sharing means the network resources should be occupied on demand, leading to less traffic isolation and minimal resource allocation. The authors address this problem by proposing and evaluating a network-wide bandwidth management framework in which an appropriate compromise between the two conflicting goals is achieved. Specifically, the bandwidth management framework consists of a network model and a network-wide bandwidth allocation and sharing strategy. Implementation issues related to the framework are discussed. For real-time applications the authors obtain maximum queuing delay and queue length, which are important in buffer design and VP (virtual path) routing