この論文をさがす
説明
<jats:title>Abstract</jats:title><jats:p>A scheduling algorithm called queue length control is proposed to ensure different quality in each of the traffic flows at a network node. This algorithm determines the control parameters (average queue length and its standard deviation) for a queue in advance (and off‐line) by using the M/G/1 model based on the delay target of each queue and then schedules based on these control parameters for each queue. A simulation compares this algorithm to other algorithms and demonstrates that the delay target of each traffic flow could be achieved over a broad range. When the control parameters are determined, although the actual packet length distribution and the packet arrival distribution are assumed to be different, a certain level of performance can be achieved. In other words, the presence of superior robust control characteristics is demonstrated. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 87(3): 87–97, 2004; Published online in Wiley InterScience (<jats:ext-link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.interscience.wiley.com">www.interscience.wiley.com</jats:ext-link>). DOI 10.1002/ecja.10008</jats:p>
収録刊行物
-
- Electronics and Communications in Japan (Part I: Communications)
-
Electronics and Communications in Japan (Part I: Communications) 87 (3), 87-97, 2003-11-06
Wiley
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1362260173459547392
-
- NII論文ID
- 210000183846
-
- ISSN
- 15206424
- 87566621
-
- データソース種別
-
- Crossref
- CiNii Articles
- OpenAIRE