Abstract
A variety of packet scheduling strategies have been proposed to guarantee the application's end-to-end delay requirements in real-time networks. The schemes, however, do not address specifically the mechanisms used to assign a per-node delay or service rate in order to meet the required end-to-end delay. In this paper, using a methodology for computing feasible per-node delays along a routing path, we describe different strategies to assign a delay value for each node so that the end-to-end delay requirement is satisfied. The performance of these schemes for different network environments is discussed.
Original language | English |
---|---|
Pages | 1323-1327 |
Number of pages | 5 |
Publication status | Published - 1999 |
Externally published | Yes |
Event | 1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz Duration: Dec 5 1999 → Dec 9 1999 |
Conference
Conference | 1999 IEEE Global Telecommunication Conference - GLOBECOM'99 |
---|---|
City | Rio de Janeiro, Braz |
Period | 12/5/99 → 12/9/99 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Global and Planetary Change