Scheduling of Virtual Connections in Fast Networks (1996)
| Venue: | In Proc. of Parallel Systems and Algorithms (PASA |
| Citations: | 50 - 6 self |
BibTeX
@INPROCEEDINGS{Erlebach96schedulingof,
author = {Thomas Erlebach and Klaus Jansen},
title = {Scheduling of Virtual Connections in Fast Networks},
booktitle = {In Proc. of Parallel Systems and Algorithms (PASA},
year = {1996},
pages = {13--32}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we assume that all call requests are available at time 0 and do not have to be completed by a certain deadline. There is no precedence relation among the calls. We consider the off-line version of the problem, where call durations are known in advance. In section 2 and 3 we restrict our attention to the case that all edges have unit capacity, all calls require unit bandwidth, and all call durations are the same (unit duration). In section 4 we present some results for the more general setting of arbitrary call durations and arbitrary bandwidth requirements.
