On the self-similar nature of Ethernet traffic
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Analysis, modeling and generation of self-similar VBR video traffic
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Asynchronous transfer mode (3rd ed.): solution for broadband ISDN
Asynchronous transfer mode (3rd ed.): solution for broadband ISDN
IEEE/ACM Transactions on Networking (TON)
Using adaptive linear prediction to support real-time VBR video under RCBR network service model
IEEE/ACM Transactions on Networking (TON)
A quantitive comparision of iterative scheduling algoithm for input-queued switches
Computer Networks and ISDN Systems
Optical burst switching (OBS) - a new paradigm for an optical Internet
Journal of High Speed Networks - Special issue on optical networking
Symmetric Crossbar Arbiters for VLSI Communication Switches
IEEE Transactions on Parallel and Distributed Systems
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Evolution of multiprotocol label switching
IEEE Communications Magazine
NN based ATM cell scheduling with queue length-based priority scheme
IEEE Journal on Selected Areas in Communications
QoS performance of optical burst switching in IP-over-WDM networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper investigates the benefit of a hypothetical oracle that gives future packet arrival information in a fixed-size-packet switch. While future information has no effect on output-queued (OQ) switch performance, this paper shows in simulation, the input-queued (IQ) switch with no switch fabric speed up has wait-time and buffer-size performance close to that of the OQ switch even with only a few time slots of future information. This finding suggests that the performance difference between input and OQ switches may be smaller than previous studies suggest. This paper investigates the theoretical aspects of using future information and shows the following. IQ switches are proved equivalent (in number of packets sent) to OQ switches for 2 inputs and 2 outputs. A linear-time algorithm is presented for achieving this equivalence. Larger switches are strictly not equivalent, and optimally using future information is in the worst case NP-hard A heuristic that simplifies using the future information is investigated and found to be sub-optimal in rare instances for larger switches while optimal for 2 × 2 switches.