Principles of Broadband Switching and Networking

Principles of Broadband Switching and Networking explains the design and analysis of switch architectures suitable for broadband integrated services networks, emphasizing packet-switched interconnection networks with distributed routing algorithms. The text examines the mathematical properties of these networks, rather than specific implementation technologies. Although the pedagogical explanations in this book are in the context of switches, many of the fundamental principles are relevant to other communication networks with regular topologies.

[1]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[2]  Jonathan S. Turner,et al.  Nonblocking multirate distribution networks , 1993, IEEE Trans. Commun..

[3]  S. C. Liew.  Comments on 'Fundamental conditions governing TDM switching assignments in terrestrial and satellite networks' [by K.Y. Eng and A.S. Acampora] , 1989, IEEE Trans. Commun..

[4]  Chung-Ju Chang,et al.  Overflow controller in copy network of broadband packet switch , 1991 .

[5]  A. Descloux.  CONTENTION PROBABILITIES IN PACKET SWITCHING NETWORKS WITH STRUNG INPUT PROCESSES , 1988 .

[6]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[7]  J G Daugman,et al.  Information Theory and Coding , 1998 .

[8]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[9]  Thomas G. Robertazzi.  Nonblocking Networks for Fast Packet Switching , 1993 .

[10]  Robert G. Gallager,et al.  Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.

[11]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[12]  P. Baran,et al.  On Distributed Communications Networks , 1964 .

[13]  M. Paull.  Reswitching of connection networks , 1962 .

[14]  Anthony Ephremides,et al.  Information Theory and Communication Networks: An Unconsummated Union , 1998, IEEE Trans. Inf. Theory.

[15]  Hari Balakrishnan,et al.  Network Working Group , 1991 .

[16]  Janak H. Patel.  Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[17]  Andrzej Jajszczyk,et al.  A new concept-repackable networks , 1993, IEEE Trans. Commun..

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

[19]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[20]  Soung Chang Liew.  Multicast routing in 3-stage Clos ATM switching networks , 1994, IEEE Trans. Commun..

[21]  H. Jonathan Chao,et al.  Matching algorithms for three-stage bufferless Clos network switches , 2003, IEEE Commun. Mag..

[22]  Andrzej Jajszczyk.  Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution , 2003, IEEE Commun. Mag..

[23]  Kai Y. Eng,et al.  A Knockout Switch for Variable-Length Packets , 1987, IEEE J. Sel. Areas Commun..

[24]  Mustafa K. Mehmet Ali,et al.  Performance analysis of a multicast switch , 1991, IEEE Trans. Commun..

[25]  Soung Chang Liew,et al.  SKEL: A Fundamental Property Desirable in ATM Switches for Simple Traffic Management - Illustrations with Generic Output-Buffered and Input-Buffered Switches , 1996, Perform. Evaluation.

[26]  Robin J. Wilson.  Introduction to Graph Theory , 1974 .

[27]  Soung Chang Liew,et al.  Broadband packet switches based on dilated interconnection networks , 1994, IEEE Trans. Commun..

[28]  Thomas G. Robertazzi.  Comparison of Buffering Strategies for Asymmetric Packet Switch Modules , 1993 .

[29]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[30]  Chienhua Chen,et al.  Service disciplines for guaranteed performance service , 1997, Proceedings Fourth International Workshop on Real-Time Computing Systems and Applications.

[31]  J. Lawrence,et al.  Designing multiprotocol label switching networks , 2001, IEEE Commun. Mag..

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

[33]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[34]  Srinivasan Keshav.  A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

[35]  Raj Jain,et al.  A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks , 1989, CCRV.

[36]  Manoj Kumar,et al.  Performance of Unbuffered Shuffle-Exchange Networks , 1986, IEEE Transactions on Computers.

[37]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[38]  Tony T. Lee,et al.  Statistical performance guarantees in large-scale cross-path packet switch , 2003, TNET.

[39]  R. Rado.  On the Number of Systems of Distinct Representatives of Sets , 1967 .

[40]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[41]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[42]  森 弘道.  Digital Integrated Communications Systems, 著者 猪瀬博, 本文342頁, 東大出版会刊(昭和54年11月発行), 定価 6,000円 , 1980 .

[43]  Joseph Y. Hui,et al.  A Broadband Packet Switch for Integrated Transport , 1987, IEEE J. Sel. Areas Commun..

[44]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[45]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[46]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[47]  P. Hall.  On Representatives of Subsets , 1935 .

[48]  Fouad A. Tobagi,et al.  Architecture, Performance, and Implementation of the Tandem Banyan Fast Packet Switch , 1991, IEEE J. Sel. Areas Commun..

[49]  Joseph Y. Hui.  Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[50]  Tony Tong Lee,et al.  Huffman Fair Queueing: A Scheduling Algorithm Providing Smooth Output Traffic , 2006, 2006 IEEE International Conference on Communications.

[51]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[52]  Soung Chang Liew.  Performance of various input-buffered and output-buffered ATM switch design principles under bursty traffic: simulation study , 1994, IEEE Trans. Commun..

[53]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[54]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[55]  Tony T. Lee,et al.  Bandwidth assignment with QoS guarantee in a class of scalable ATM switches , 2000, IEEE Trans. Commun..

[56]  Claude E. Shannon,et al.  Memory requirements in a telephone exchange , 1950 .

[57]  Thomas E. Stern,et al.  Throughput Analysis, Optimal Buffer Allocation, and Traffic Imbalance Study of a Generic Nonblocking Packet Switch , 1991, IEEE J. Sel. Areas Commun..

[58]  Ji Zhang,et al.  On a class of Banyan networks and tandem Banyan switching fabrics , 1995, IEEE Trans. Commun..

[59]  H. Nyquist,et al.  Certain Topics in Telegraph Transmission Theory , 1928, Transactions of the American Institute of Electrical Engineers.

[60]  H. Jonathan Chao,et al.  Architecture design for ATM statistical multiplexers , 1991 .

[61]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[62]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[63]  Achille Pattavina.  Multichannel bandwidth allocation in a broadband packet switch , 1988, IEEE J. Sel. Areas Commun..

[64]  Tony T. Lee.  A modular architecture for very large packet switches , 1990, IEEE Trans. Commun..

[65]  J. Massey.  Information theory: The copernican system of communications , 1984, IEEE Communications Magazine.

[66]  Gilbert Strang,et al.  Introduction to applied mathematics , 1988 .

[67]  K. W. Lu,et al.  A 3-stage interconnection structure for very large packet switches , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[68]  William Stallings,et al.  ISDN and broadband ISDN with frame relay and ATM (3rd ed.) , 1995 .

[69]  Martin De Prycker,et al.  Performance of a Service Independent Switching Network with Distributed Control , 1987, IEEE J. Sel. Areas Commun..

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

[71]  Jonathan S. Turner.  A practical version of Lee's multicast switch architecture , 1993, IEEE Trans. Commun..

[72]  Alberto Leon-Garcia,et al.  Performance of buffered banyan networks under nonuniform traffic patterns , 1990, IEEE Trans. Commun..

[73]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[74]  Edmund Taylor Whittaker.  XVIII.—On the Functions which are represented by the Expansions of the Interpolation-Theory , 1915 .

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

[76]  Ezhan Karasan,et al.  A Thermodynamic Theory of Broadband Networks with Application to Dynamic Routing , 1995, IEEE J. Sel. Areas Commun..

[77]  Chuan-lin Wu,et al.  Tutorial, interconnection networks for parallel and distributed processing , 1984 .

[78]  Jon Crowcroft,et al.  A new congestion control scheme: slow start and search (Tri-S) , 1991, CCRV.

[79]  Christian Jacquenet,et al.  A management and control architecture for providing IP differentiated services in MPLS-based networks , 2001, IEEE Commun. Mag..

[80]  Kenneth E. Batcher,et al.  The flip network in staran , 1976 .

[81]  Anthony S. Acampora,et al.  The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching , 1987, IEEE J. Sel. Areas Commun..

[82]  Peter Newman.  A fast packet switch for the integrated services backbone network , 1988, IEEE J. Sel. Areas Commun..

[83]  Mischa Schwartz,et al.  Telecommunication networks: protocols, modeling and analysis , 1986 .

[84]  Masatoshi Kawarasaki,et al.  B-ISDN Architecture and Protocol , 1991, IEEE J. Sel. Areas Commun..

[85]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[86]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[87]  Chin-Tau A. Lea,et al.  The Load-Sharing Banyan Network , 1986, IEEE Transactions on Computers.

[88]  Tony T. Lee,et al.  Parallel routing algorithms in Benes-Clos networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[89]  Bruce E. Hajek,et al.  Bounds on evacuation time for deflection routing , 1991, Distributed Computing.

[90]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[91]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[92]  Cheng Peng Fu,et al.  TCP veno: end-to-end congestion control over heterogeneous networks , 2001 .

[93]  Larry Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.

[94]  C. T. Lea.  Non-blocking copy networks for multicast packet switching , 1988 .

[95]  Alan A. Bertossi,et al.  Time Slot Assignment in SS/TDMA Systems with Intersatellite Links , 1987, IEEE Trans. Commun..

[96]  Matthew Mathis,et al.  Forward acknowledgement: refining TCP congestion control , 1996, SIGCOMM '96.

[97]  J. Lewandowski,et al.  SS/TDMA Time Slot Assignment with Restricted Switching Modes , 1983, IEEE Trans. Commun..

[98]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[99]  B. Bingham,et al.  Reservation-based contention resolution mechanism for Batcher-Banyan packet switches , 1988 .

[100]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[101]  Tony T. Lee,et al.  The design and analysis of an ATM multicast switch with adaptive traffic controller , 1994, TNET.

[102]  Yoshikuni Onozato,et al.  A copy network with shared buffers for large-scale multicast ATM switching , 1993, TNET.

[103]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[104]  D. Spielman,et al.  Expander codes , 1996 .

[105]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[106]  H. Jonathan Chao.  A Recursive Modular Terabit/Second ATM Switch , 1991, IEEE J. Sel. Areas Commun..

[107]  Zhen Liu,et al.  Evaluation of TCP Vegas: emulation and experiment , 1995, SIGCOMM '95.

[108]  Jane W.-S. Liu,et al.  An Algorithmic Proof of a Generalization of the Birkhoff-Von Neumann Theorem , 1986, J. Algorithms.

[109]  Martin de Prycker,et al.  Asynchronous Transfer Mode, Solution for Broadband Isdn , 1991 .

[110]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[111]  Soung Chang Liew,et al.  Nlog N dual shuffle-exchange network with error-correcting routing , 1994, IEEE Trans. Commun..

[112]  Nicholas F. Maxemchuk,et al.  Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[113]  Cheuk H. Lam,et al.  Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet Switches , 1997, IEEE J. Sel. Areas Commun..

[114]  Tony T. Lee,et al.  Non-blocking routing properties of Clos networks , 1997, Advances in Switching Networks.