A reconfigurable hardware approach to network simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the stability of input-queued switches with speed-up
IEEE/ACM Transactions on Networking (TON)
Flexible bandwidth allocation in high-capacity packet switches
IEEE/ACM Transactions on Networking (TON)
Fair Scheduling in Internet Routers
IEEE Transactions on Computers
Fair Scheduling for Input Buffered Switches
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Bounds on delays and queue lengths in input-queued cell switches
Journal of the ACM (JACM)
FAST: a simulation testbed for ATM networks
COMPCON '96 Proceedings of the 41st IEEE International Computer Conference
MMR: A MultiMedia Router architecture to support hybrid workloads
Journal of Parallel and Distributed Computing
Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches
IEEE/ACM Transactions on Networking (TON)
Hardware Efficient Two Step Iterative Matching Algorithms for VOQ Switches
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
Theoretical Computer Science
Fast and noniterative scheduling in input-queued switches: Supporting QoS
Computer Communications
Bandwidth guaranteed multicast scheduling for virtual output queued packet switches
Journal of Parallel and Distributed Computing
Input register architectures of high speed router for supporting the PHB of differentiated services
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering
Computer Communications
Hi-index | 0.00 |
Introduces and analyzes a method for providing bandwidth reservations in an input-buffered non-blocking crossbar switch. The scheme, which the authors call weighted probabilistic iterative matching (WPIM), is an improvement over probabilistic iterative matching and allows flexible allocation of bandwidth among the switch inputs sharing a common output link in a simple manner. Weighted probabilistic iterative matching allocates the output bandwidth among the inputs based on reservations made during the connection setup phase, and can guarantee that traffic from each input receives its promised share of the bandwidth of the output link. In addition, the algorithm provides isolation between two flows arriving on distinct input links and directed at a common output link; misbehaving flows at one of the inputs do not affect the bandwidth guarantees or delays of traffic from other inputs. Results from simulations show that the scheme is able to maintain probabilistic bandwidth and delay guarantees in the presence of misbehaving traffic. the authors also derive an analytical upper bound for the average delay under the scheme and validate it by simulation.