Efficient delay computation methods for real-time traffic in an ATM network

  • Authors:
  • Joseph Kee-Yin Ng;Shibin Song

  • Affiliations:
  • Hong Kong Baptist Univ., Kowloon, Hong Kong;Zhong Shan Univ., Guang Zhou, China

  • Venue:
  • Progress in computer research
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

ATM is a connection-oriented technology. Before two hosts cancommunicate, a connection has to be established between them.Consider a real-time communication application running on top of anATM network. In order to provide the real-time service, we requirethe connection to provide a performance guarantee. Suchdeterministic guarantee can only be possible if there exists anabsolute worst case delay bound on all the ATM cells within thereal-time connection. In this paper, we first present a frameworkfor this worst case delay within an ATM switch. Later on, inestimating the real-time arrival traffic, we use the DeterministicBounding Interval Dependent (D-BIND) traffic model [11] tocharacterize the burstiness and the temporal correlation structureof a real-time message stream. We then derive the worst case delaybound for an ATM switch with some typical output port schedulers.We find out that our proposed method is no harder than the otherexisting methods in finding such worst case delay in terms ofcomputation complexity. Hence, we have an efficient and effectiveway to estimate the worst case delay for the connection admissioncontrol for an ATM network.