Delay analysis for CBR traffic in static-priority scheduling: Single-node and heterogeneous CBR traffic case

Katsuyoshi Iida, Tetsuya Takine, Hideki Sunahara, Yuji Oie

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

In the integrated service networks, the real-time traffic and the non-real-time traffic share the network resources so that one can affect the quality of another and vice versa. In this context, it is very crucial to develop some mechanism to guarantee the quality-of-service (QoS) required by the real-time traffic. In this paper, we analyze the delay time of CBR packets from real-time sources when CBR packets have the priority over UBR packets in a manner that UBR packets are serviced only if no CBR packets are waiting in the buffer. There are two types of CBR packets; i.e., they are different in their transmission rate and/or packet length. In this sense, the case treated is called the heterogeneous case. We obtain various numerical results on the statistical bound on delay time such as the 99.9-percentile delay and compare it with the deterministic bound. By the comparison, we show that Call Admission Control (CAC) based upon the statistical bound is very effective in using the network resources efficiently when CBR packets can tolerate some loss due to late arrival. We will also examine whether the delay time distribution in the heterogeneous case can be approximated by that of some homogeneous cases.

Original languageEnglish
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages1256-1263
Number of pages8
Volume2
Publication statusPublished - 1998
Externally publishedYes
EventProceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration - Sydney, NSW, Aust
Duration: 1998 Nov 81998 Nov 12

Other

OtherProceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration
CitySydney, NSW, Aust
Period98/11/898/11/12

Fingerprint

Time delay
Scheduling
Congestion control (communication)
Quality of service
resource
analysis
traffic
services

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Iida, K., Takine, T., Sunahara, H., & Oie, Y. (1998). Delay analysis for CBR traffic in static-priority scheduling: Single-node and heterogeneous CBR traffic case. In Conference Record / IEEE Global Telecommunications Conference (Vol. 2, pp. 1256-1263). IEEE.

Delay analysis for CBR traffic in static-priority scheduling : Single-node and heterogeneous CBR traffic case. / Iida, Katsuyoshi; Takine, Tetsuya; Sunahara, Hideki; Oie, Yuji.

Conference Record / IEEE Global Telecommunications Conference. Vol. 2 IEEE, 1998. p. 1256-1263.

Research output: Chapter in Book/Report/Conference proceedingChapter

Iida, K, Takine, T, Sunahara, H & Oie, Y 1998, Delay analysis for CBR traffic in static-priority scheduling: Single-node and heterogeneous CBR traffic case. in Conference Record / IEEE Global Telecommunications Conference. vol. 2, IEEE, pp. 1256-1263, Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration, Sydney, NSW, Aust, 98/11/8.
Iida K, Takine T, Sunahara H, Oie Y. Delay analysis for CBR traffic in static-priority scheduling: Single-node and heterogeneous CBR traffic case. In Conference Record / IEEE Global Telecommunications Conference. Vol. 2. IEEE. 1998. p. 1256-1263
Iida, Katsuyoshi ; Takine, Tetsuya ; Sunahara, Hideki ; Oie, Yuji. / Delay analysis for CBR traffic in static-priority scheduling : Single-node and heterogeneous CBR traffic case. Conference Record / IEEE Global Telecommunications Conference. Vol. 2 IEEE, 1998. pp. 1256-1263
@inbook{33d8cfa744e4422187964b72218ac67d,
title = "Delay analysis for CBR traffic in static-priority scheduling: Single-node and heterogeneous CBR traffic case",
abstract = "In the integrated service networks, the real-time traffic and the non-real-time traffic share the network resources so that one can affect the quality of another and vice versa. In this context, it is very crucial to develop some mechanism to guarantee the quality-of-service (QoS) required by the real-time traffic. In this paper, we analyze the delay time of CBR packets from real-time sources when CBR packets have the priority over UBR packets in a manner that UBR packets are serviced only if no CBR packets are waiting in the buffer. There are two types of CBR packets; i.e., they are different in their transmission rate and/or packet length. In this sense, the case treated is called the heterogeneous case. We obtain various numerical results on the statistical bound on delay time such as the 99.9-percentile delay and compare it with the deterministic bound. By the comparison, we show that Call Admission Control (CAC) based upon the statistical bound is very effective in using the network resources efficiently when CBR packets can tolerate some loss due to late arrival. We will also examine whether the delay time distribution in the heterogeneous case can be approximated by that of some homogeneous cases.",
author = "Katsuyoshi Iida and Tetsuya Takine and Hideki Sunahara and Yuji Oie",
year = "1998",
language = "English",
volume = "2",
pages = "1256--1263",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - CHAP

T1 - Delay analysis for CBR traffic in static-priority scheduling

T2 - Single-node and heterogeneous CBR traffic case

AU - Iida, Katsuyoshi

AU - Takine, Tetsuya

AU - Sunahara, Hideki

AU - Oie, Yuji

PY - 1998

Y1 - 1998

N2 - In the integrated service networks, the real-time traffic and the non-real-time traffic share the network resources so that one can affect the quality of another and vice versa. In this context, it is very crucial to develop some mechanism to guarantee the quality-of-service (QoS) required by the real-time traffic. In this paper, we analyze the delay time of CBR packets from real-time sources when CBR packets have the priority over UBR packets in a manner that UBR packets are serviced only if no CBR packets are waiting in the buffer. There are two types of CBR packets; i.e., they are different in their transmission rate and/or packet length. In this sense, the case treated is called the heterogeneous case. We obtain various numerical results on the statistical bound on delay time such as the 99.9-percentile delay and compare it with the deterministic bound. By the comparison, we show that Call Admission Control (CAC) based upon the statistical bound is very effective in using the network resources efficiently when CBR packets can tolerate some loss due to late arrival. We will also examine whether the delay time distribution in the heterogeneous case can be approximated by that of some homogeneous cases.

AB - In the integrated service networks, the real-time traffic and the non-real-time traffic share the network resources so that one can affect the quality of another and vice versa. In this context, it is very crucial to develop some mechanism to guarantee the quality-of-service (QoS) required by the real-time traffic. In this paper, we analyze the delay time of CBR packets from real-time sources when CBR packets have the priority over UBR packets in a manner that UBR packets are serviced only if no CBR packets are waiting in the buffer. There are two types of CBR packets; i.e., they are different in their transmission rate and/or packet length. In this sense, the case treated is called the heterogeneous case. We obtain various numerical results on the statistical bound on delay time such as the 99.9-percentile delay and compare it with the deterministic bound. By the comparison, we show that Call Admission Control (CAC) based upon the statistical bound is very effective in using the network resources efficiently when CBR packets can tolerate some loss due to late arrival. We will also examine whether the delay time distribution in the heterogeneous case can be approximated by that of some homogeneous cases.

UR - http://www.scopus.com/inward/record.url?scp=0032274409&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032274409&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0032274409

VL - 2

SP - 1256

EP - 1263

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

ER -