ID 111847
Author
Aihara, Masahiko Osaka University
Kono, Shiori Osaka University
Yamai, Nariyoshi Tokyo University of Agriculture and Technology
Watanabe, Takashi Osaka University
Keywords
scheduling
routing
file transfer
time constraint
Content Type
Journal Article
Description
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.
Journal Title
IEICE Transactions on Communications
ISSN
17451345
Publisher
The Institute of Electronics, Information and Communication Engineers
Volume
E101-B
Issue
3
Start Page
763
End Page
771
Published Date
2018-03-01
Remark
IEICE Transactions Online TOP:http://search.ieice.org/
Rights
©2018 The Institute of Electronics, Information and Communication Engineers
EDB ID
DOI (Published Version)
URL ( Publisher's Version )
FullText File
language
eng
TextVersion
Publisher
departments
Science and Technology