ID 111847
著者
Aihara, Masahiko Osaka University
Kono, Shiori Osaka University
Yamai, Nariyoshi Tokyo University of Agriculture and Technology
Watanabe, Takashi Osaka University
キーワード
scheduling
routing
file transfer
time constraint
資料タイプ
学術雑誌論文
抄録
In recent years, the number of requests to transfer large files via large high-speed computer networks has been increasing rapidly. Typically, these requests are handled in the “best effort” manner which results in unpredictable completion times. In this paper, we consider a model where a transfer request either must be completed by a user-specified deadline or must be rejected if its deadline cannot be satisfied. We propose a bandwidth scheduling method and a routing method for reducing the call-blocking probability in a bandwidth-guaranteed network. Finally, we show their excellent performance by simulation experiments.
掲載誌名
IEICE Transactions on Communications
ISSN
17451345
出版者
The Institute of Electronics, Information and Communication Engineers
E101-B
3
開始ページ
763
終了ページ
771
発行日
2018-03-01
備考
IEICE Transactions Online TOP:http://search.ieice.org/
権利情報
©2018 The Institute of Electronics, Information and Communication Engineers
EDB ID
337180
出版社版DOI
出版社版URL
フルテキストファイル
言語
eng
著者版フラグ
出版社版
部局
理工学系