• DocumentCode
    1723569
  • Title

    Per-node delay assignment strategies for real-time high speed networks

  • Author

    Vagish, Abhishek ; Znati, Taieb ; Melhem, Rami

  • Author_Institution
    Dept. of Comput. Sci., Pittsburgh Univ., PA, USA
  • Volume
    2
  • fYear
    1999
  • fDate
    6/21/1905 12:00:00 AM
  • Firstpage
    1323
  • 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
  • Keywords
    buffer storage; delays; optimisation; packet switching; telecommunication network routing; buffer capacity model; computational complexity; connection acceptance ratios; end-to-end delay requirements; network environments; optimal algorithm; packet scheduling; per-node delay assignment; performance; real-time high speed networks; routing path; service rate; simulation experiments; Computer science; Delay; Global Positioning System; High-speed networks; Jitter; Processor scheduling; Routing; Scheduling algorithm; Telecommunication traffic; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 1999. GLOBECOM '99
  • Conference_Location
    Rio de Janeireo
  • Print_ISBN
    0-7803-5796-5
  • Type

    conf

  • DOI
    10.1109/GLOCOM.1999.829987
  • Filename
    829987