No abstract

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 callblocking probability in a bandwidth-guaranteed network. Finally, we show their excellent performance by simulation experiments.Here, s i is the source node, d i is the destination node,

No abstract

No abstract