Simulation of the Iterative Probabilistic Scheduling with Parallel Processing

The implementation of VOQ and Iterative Probabilistic Scheduling with Parallel Processing (IPSWPP) in ns-2 is setup as described. The simulator is configure to model a heterogeneous router processor system having the dispatching processor, multiple worker processor and one transmitting processors. To examine the performance of IPSWPP for processing variable length packets in a realistic system, we conduct the simulation by varying the mean packet size of the incoming packets.

[1]  Kai Y. Eng,et al.  Improving the performance of input-queued ATM packet switches , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[2]  Devavrat Shah,et al.  Iterative Scheduling Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[4]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[5]  Ishfaq Ahmad,et al.  A parallel algorithm for compile-time scheduling of parallel programs on multiprocessors , 1997, Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques.

[6]  Ha Chan,et al.  A Scheduling Scheme to Improve QoS Provisioning for IP traffic , 2007 .

[7]  Darren L. Spohn,et al.  Data Network Design , 1993 .

[8]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[9]  George Varghese,et al.  A reliable and scalable striping protocol , 1996, SIGCOMM 1996.

[10]  Deng Pan,et al.  Pipelined two step iterative matching algorithms for CIOQ crossbar switches , 2005, 2005 Symposium on Architectures for Networking and Communications Systems (ANCS).