Information Theory and Communication Networks: An Unconsummated Union

Information theory has not yet had a direct impact on networking, although there are similarities in concepts and methodologies that have consistently attracted the attention of researchers from both fields. In this paper, we review several topics that are related to communication networks and that have an information-theoretic flavor, including multiaccess protocols, timing channels, effective bandwidth of bursty data sources, deterministic constraints on datastreams, queuing theory, and switching networks.

[1]  Anthony Ephremides,et al.  On the stability of interacting queues in a multiple-access system , 1988, IEEE Trans. Inf. Theory.

[2]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[3]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[4]  Robert G. Gallager,et al.  Event driven topology broadcast without sequence numbers , 1989, IEEE Trans. Commun..

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

[6]  Ira S. Moskowitz,et al.  An analysis of the timed Z-channel , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[7]  Nicholas Pippenger,et al.  Bounds on the performance of protocols for a multiple-access broadcast channel , 1981, IEEE Trans. Inf. Theory.

[8]  Anand S. Bedekar,et al.  The Information-Theoretic Capacity of Discrete-Time Queues , 1997, IEEE Trans. Inf. Theory.

[9]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[10]  Ivan T. Frisch,et al.  Communication, transmission, and transportation networks , 1971 .

[11]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[12]  Anthony Ephremides,et al.  Control and optimization methods in communication network problems , 1989 .

[13]  Michele Zorzi,et al.  Optimization of capture in multiple access radio systems with Rayleigh fading and random power levels , 1996 .

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

[15]  Bob Metcalfe,et al.  Steady-state analysis of a slotted and controlled Aloha system with blocking , 1975, CCRV.

[16]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[17]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[18]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[19]  Rene L. Cruz,et al.  Service Burstiness and Dynamic Burstiness Measures: A Framework , 1992, J. High Speed Networks.

[20]  D. R. Fulkerson,et al.  On the Max Flow Min Cut Theorem of Networks. , 1955 .

[21]  Aaron D. Wyner,et al.  Memory Requirements in a Telephone Exchange , 1993 .

[22]  Robert G. Gallager,et al.  Basic limits on protocol information in data communication networks , 1976, IEEE Trans. Inf. Theory.

[23]  이영식.  Communication 으로서의 영어교육 , 1986 .

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

[25]  Venkat Anantharam.  The stability region of the finite-user slotted ALOHA protocol , 1991, IEEE Trans. Inf. Theory.

[26]  William R. Crowther,et al.  The interface message processor for the ARPA computer network , 1899, AFIPS '70 (Spring).

[27]  Edwin K. P. Chong,et al.  Discrete event systems: Modeling and performance analysis , 1994, Discret. Event Dyn. Syst..

[28]  Myong H. Kang,et al.  An Analysis of the Timed-Channel , 1998 .

[29]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

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

[31]  Bruce Hajek,et al.  Decentralized dynamic control of a multiaccess broadcast channel , 1982 .

[32]  A. El Gamal,et al.  Multiple user information theory , 1980, Proceedings of the IEEE.

[33]  Izhak Rubin.  Communication networks: Message path delays , 1974, IEEE Trans. Inf. Theory.

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

[35]  B. W. Meister,et al.  New Optimization Criteria for Message-Switching Networks , 1971 .

[36]  Moshe Sidi,et al.  Two Interfering Queues in Packet-Radio Networks , 1983, IEEE Trans. Commun..

[37]  Robert Metcalfe,et al.  Function-oriented protocols for the ARPA computer network , 1899, AFIPS '72 (Spring).

[38]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[39]  M. Medard,et al.  Bandwidth scaling for fading channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[40]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[41]  Sergio Verdú,et al.  Fifty Years of Shannon Theory , 1998, IEEE Trans. Inf. Theory.

[42]  Nick G. Duffield,et al.  Large deviations, the shape of the loss curve, and economies of scale in large multiplexers , 1995, Queueing Syst. Theory Appl..

[43]  Bruce E. Hajek,et al.  On the average delay for routing subject to independent deflections , 1993, IEEE Trans. Inf. Theory.

[44]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[45]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[46]  John Ippocratis Capetanakis.  The multiple access broadcast channel : protocol and capacity considerations. , 1977 .

[47]  Wushow Chou,et al.  Topological optimization of computer networks , 1972 .

[48]  Jean C. Walrand,et al.  Resource Management in Wide-Area ATM Networks Using Effective Bandwiths , 1995, IEEE J. Sel. Areas Commun..

[49]  M. Murty.  Ramanujan Graphs , 1965 .

[50]  R. Weber,et al.  Buffer overflow asymptotics for a buffer handling many traffic sources , 1996, Journal of Applied Probability.

[51]  Jacky Guibert,et al.  Large Deviations Approximations for Fluid Queues Fed by a Large Number of On/Off Sources , 1995, IEEE J. Sel. Areas Commun..

[52]  Emre Telatar,et al.  Combining Queueing Theory with Information Theory for Multiaccess , 1995, IEEE J. Sel. Areas Commun..

[53]  Z. Galil,et al.  Explicit constructions of linear size superconcentrators , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[54]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[55]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[56]  Stephen V. Hanly.  Congestion measures and capacity constraints in spread spectrum networks , 1996 .

[57]  J. Hayes,et al.  An Adaptive Technique for Local Distribution , 1978, IEEE Trans. Commun..

[58]  Alan Weiss,et al.  Large Deviations For Performance Analysis: Queues, Communication and Computing , 1995 .

[59]  Ira S. Moskowitz,et al.  A Network Pump , 1996, IEEE Trans. Software Eng..

[60]  Wojciech Szpankowski,et al.  Stabilty Conditions for Some Multiqueue Distributed Systems: Buffered Random Access Systems , 1992 .

[61]  David Tse,et al.  Variable-rate lossy compression and its effects on communication networks , 1995 .

[62]  Ronald L. Rivest,et al.  Network control by Bayesian broadcast , 1987, IEEE Trans. Inf. Theory.

[63]  David Slepian,et al.  Key papers in the development of information theory , 1974 .

[64]  Marvin Schaefer,et al.  Program confinement in KVM/370 , 1977, ACM '77.

[65]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[66]  Peter Elias,et al.  Networks of Gaussian channels with applications to feedback systems , 1967, IEEE Trans. Inf. Theory.

[67]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[68]  A. Ephremides,et al.  Can spatial separation increase throughput of conflict resolution algorithm? , 1997, Proceedings of IEEE International Symposium on Information Theory.

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

[70]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[71]  Philippe Godlewski,et al.  Multiaccess, Mobility and Teletraffic for Personal Communications , 1996 .

[72]  Anthony Ephremides,et al.  Ordinal optimization of admission control in wireless multihop voice/data networks via standard clock simulation , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[73]  Raymond Knopp,et al.  Channel control and multiple-access , 1996 .

[74]  Anwar Elwalid,et al.  The importance of long-range dependence of VBR video traffic in ATM traffic engineering: myths and realities , 1996, SIGCOMM 1996.

[75]  F. Kelly,et al.  Stochastic networks : theory and applications , 1996 .

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

[77]  Robert E. Kahn,et al.  A Protocol for Packet Network Intercommunication , 1974 .

[78]  Leonard Kleinrock,et al.  Packet Switching in a Multiaccess Broadcast Channel: Dynamic Control Procedures , 1975, IEEE Trans. Commun..

[79]  I. Emre Telatar,et al.  Combining queueing theory and information theory for multi-access , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[80]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[81]  V. Anantharam.  The stability region of the finite-user slotted ALOHA protocol , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[82]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[83]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[84]  Pierre A. Humblet,et al.  A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels , 1985, IEEE Trans. Commun..

[85]  Sergio Verdú,et al.  Bits through queues , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[86]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[87]  G. Fayolle,et al.  Two coupled processors: The reduction to a Riemann-Hilbert problem , 1979 .

[88]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, TNET.

[89]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[90]  Walter Willinger,et al.  A Bibliographical Guide to Self-Similar Traffic and Performance Modeling for Modern High-Speed Netwo , 1996 .

[91]  Steven B. Lipner,et al.  A comment on the confinement problem , 1975, SOSP.

[92]  Claude E. Shannon,et al.  Two-way Communication Channels , 1961 .

[93]  H. Vincent Poor,et al.  Detection of Stochastic Processes , 1998, IEEE Trans. Inf. Theory.

[94]  Debasis Mitra,et al.  A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node , 1995, IEEE J. Sel. Areas Commun..

[95]  Julio A. Garceran.  A New Approach for Allocating Buffers and Bandwidth to Heterogeneous , Regulated Traffic in an ATM Node ” , 2022 .

[96]  Jack K. Wolf,et al.  The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[97]  V. Benes.  On rearrangeable three-stage connecting networks , 1962 .

[98]  Dimitri Bertsekas.  Dynamic models of shortest path routing algorithms for communication networks with multiple destinations , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[99]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[100]  Sergio Verdu,et al.  The exponential distribution in information theory , 1996 .

[101]  Bruce Hajek,et al.  Scheduling nonuniform traffic in a packet-switching system with small propagation delay , 1997, TNET.

[102]  S. Verdu.  Computation of the efficiency of the Mosely-Humblet contention resolution algorithm: A simple method , 1986, Proceedings of the IEEE.

[103]  Joy A. Thomas.  On the Shannon capacity of discrete time queues , 1997, Proceedings of IEEE International Symposium on Information Theory.

[104]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[105]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[106]  Anthony Ephremides,et al.  Ordinal Optimization of Admission Control in Wireless Multihop Integrated Networks via Standard Cloc , 1995 .