Analysis of algorithms for online routing and scheduling in networks
We study situations in which an algorithm must make decisions about how to best route and schedule data transfer requests in a communication network before each transfer leaves its source. For some situations, such as those requiring quality of service guarantees, this is essential. For other situat...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
W&M ScholarWorks
1998
|
| Subjects: | |
| Online Access: | https://scholarworks.wm.edu/etd/1539623929 https://scholarworks.wm.edu/cgi/viewcontent.cgi?article=3502&context=etd |