Efficient bufferless packet switching on trees and leveled networks |
| |
| Authors: | Costas Busch Malik Magdon-Ismail Marios Mavronicolas |
| |
| Affiliation: | 1. Computer Science Department, RPI, 110 8th Street, Troy, NY 12180, USA;2. Computer Science Department, University of Cyprus, P.O. Box 20537, Nicosia CY-1678, Cyprus. |
| |
| Abstract: | In bufferless networks the packets cannot be buffered while they are in transit; thus, once injected, the packets have to move constantly. Bufferless networks are interesting because they model optical networks. The objective of this work is to demonstrate that efficient bufferless packet switching is achievable in particular, interesting network topologies. |
| |
| Keywords: | Routing algorithms Packet scheduling Hot-potato routing Congestion Dilation |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
