Stability results for networks with input and output blocking

We study network stability in the presence of both input blocking and output blocking. In this setting, two packets can cross a switch simultaneously only if they do not share an input link and they do not share an output link. We adopt the adversarial model of packet injections introduced hy Borodin et al, [S], Previous work in thii injection model assumed the existence of output blocking only. We dcmonotrate that providing network stability is more difllcult when the extra constraint of input blocking is present. For example, some natural analogues of many protocols that were stable in the output blocking model become unstable. Furthermore, instability can be achieved on simple acyclic networks, Our main contribution is a construction of distributed protocols that are stable for all networks. Our approach lo motivated by the LONQEST-IN-SYSTEM protocol for the output blocking model. A similar approach applied to other protocols leads to instability. The assumption of both input and output blocking is common in switching theory. To the best of our knowledge, the effect of input blocking on nettuorhstabiity has not been explored.

[1]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[2]  Baruch Awerbuch,et al.  Universal stability results for greedy contention-resolution protocols , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[3]  Oliver W. W. Yang,et al.  A fast algorithm for multi-channel/port traffic assignment , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[4]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[5]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[6]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[7]  Yuval Tamir,et al.  High-performance multiqueue buffers for VLSI communication switches , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.

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

[9]  Matthew Andrews,et al.  Scheduling techniques for packet routing, load balancing and disk scheduling , 1997 .

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

[11]  Carsten Lund,et al.  Fair prioritized scheduling in an input-buffered switch , 1996 .

[12]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[13]  Alan Huang,et al.  Starlite: a wideband digital switch , 1991 .

[14]  Lisa Zhang,et al.  General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[15]  Pravin Varaiya,et al.  Scheduling cells in an input-queued switch , 1993 .

[16]  H. Obara Optimum architecture for input queuing ATM switches , 1991 .

[17]  Joseph Yu Hui,et al.  Switching and Traffic Theory for Integrated Broadband Networks , 1990 .

[18]  Allan Borodin,et al.  Adversarial queueing theory , 1996, STOC '96.

[19]  Thomas G. Robertazzi,et al.  Input Versus Output Queueing on a SpaceDivision Packet Switch , 1993 .

[20]  Y. Tamir,et al.  High-performance multi-queue buffers for VLSI communications switches , 1988, ISCA '88.

[21]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[22]  Hitoshi Obara,et al.  An efficient contention resolution algorithm for input queuing atm cross‐connect switches , 1989 .