大学サイト   学部サイト   学科サイト   EnglishPages
 
旧尾家・塚本研究室です.尾家祐二 現・九州工業大学学長の情報は こちら.
   
研究業績


Delay analysis for CBR traffic in static-priority scheduling
著者
  Katsuyoshi IIDA
 
雑誌名/会議名
  Master’s thesis, NAIST-IS-MT9651007, submitted to Graduate School of Information Science, Nara Institute of Science and Technology 1998 年 2 月
 
アブストラクト
  In the current Internet, several applications such as real-time communications, appeared as new generation services. These applications require guaranteed quality-of-services (QoS) in terms of bandwidth, delay, delay jitter and packet loss, whereas the current networks support only a best-effort service. For supporting real-time applications, the integrated service packet networks (ISPN) have been proposed. In the ISPN, 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. Many researches exist for scheduling on the ISPN. However, most of the studies such as Weighted Fair Queue (WFQ), need a buffer dedicated to each flow and/or connection. This type of system is not scalable because (1) flow setup and/or release may often occur and (2) the number of flows may be getting large for example at the central nodes in the huge networks. In this thesis, I consider the networks in which similar QoS flows occupy the same buffer at the switches. This system is scalable because it requires only a small number of buffers. I analyze the delay time of Constant Bit Rate (CBR) packets from real-time sources when CBR packets have the non-preemptive priority over Unspecified Bit Rate (UBR) packets in a manner that UBR packets are served only if no CBR packets are waiting in the buffer. Furthermore, I 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. My numerical results 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.
 
キーワード
  Internet telephony
 
記述言語
  English
 
 

web_admin [ at ] infonet.cse.kyutech.ac.jp /  Copyright (c) 2016 Oie & Tsukamoto Laboratory, All Right Reserved.