|
naistar (NAIST Academic Repository) >
学術リポジトリ naistar / NAIST Academic Repository naistar >
テクニカルレポート / Technical Report >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10061/3215
|
| Title: | Application-Level Jitter Reduction Scheme for Multimedia Communication over ATM-ABR Service |
| Authors: | Adachi, Naotoshi Kasahara, Shoji Takahashi, Yutaka アダチ, ナオトシ カサハラ, ショウジ タカハシ, ユタカ 安達, 直世 笠原, 正治 高橋, 豊 |
| Issue Date: | Oct-2000 |
| Publisher: | Nara Institute of Science and Technology |
| Series/Report no.: | Information Science Technical Report ~ TR2000008 |
| Abstract: | The ATM-ABR service category provides minimum cell rate (MCR) guarantees and robust connections even with insufficient network resources. Recently proposed rate-management algorithms for supporting multimedia applications over ABR mainly aim at minimizing the cell loss and delay. However, jitter is also an important element of QoS for multimedia applications. In this paper, we focus our attention on the arrival point of the critical cell corresponding to the end of the data packet and propose a simple cell scheduling algorithm for the source node to reduce the jitter on application level under the ATM-ABR service class. In our proposed method, critical cells are delayed intentionally and the packet stream at application level becomes smooth.We verify the effectiveness of our proposed algorithm by the analytical model and simulation. From those results, we find that the our proposed scheduling algorithm is effective for reducing the application level jitter even when the tagged cell stream is transmitted along the path with multiple nodes. |
| URI: | http://hdl.handle.net/10061/3215 |
| URI: | http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=29393 |
| Fulltext: | http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=29393 |
| ISSN: | 0919-9527 |
| Text Version: | author |
| Appears in Collections: | テクニカルレポート / Technical Report
|
Files in This Item:
There are no files associated with this item.
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|