| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428457 | Information Processing Letters | 2006 | 6 Pages |
Abstract
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
