Abstract
Emerging high-speed networks provide support for a wide range of applications with different traffic characteristics and Quality of Service (QoS) requirements. For example, real time applications require guaranteed services such as minimum bandwidth and bounded end-to-end delay. Network resources should be allocated in order to provide the guaranteed services required by applications. Networks employ traffic and congestion control mechanisms in order to allocate the needed network resources and enforce the allocation of these resources throughout the connection life. Moreover, QoS should also be guaranteed end-to-end at the transport protocol level. In this paper, we examine how QoS requirements for applications can be guaranteed at connection ends. In addition, we introduce a schedulability algorithm for applications that have a strict delay bound requirement. This algorithm will verify that packets delay bounds for these applications will not be violated.
Original language | English (US) |
---|---|
Pages | 321-327 |
Number of pages | 7 |
State | Published - 1998 |
Externally published | Yes |
Event | Proceedings of the 1998 IEEE International Performance, Computing and Communications Conference, IPCCC - Phoenix, AZ, USA Duration: Feb 16 1998 → Feb 18 1998 |
Other
Other | Proceedings of the 1998 IEEE International Performance, Computing and Communications Conference, IPCCC |
---|---|
City | Phoenix, AZ, USA |
Period | 2/16/98 → 2/18/98 |
ASJC Scopus subject areas
- Media Technology