Synthesis Lectures on Communication Networks

Synthesis Lectures on Communication Networks is an ongoing series of 50- to 100-page publications on topics on the design, implementation, and management of communication networks. Each lecture is a self-contained presentation of one topic by a leading expert.The topics range from algorithms to hardware implementations and cover a broad spectrum of issues from security to multiple-access protocols.The series addresses technologies from sensor networks to reconfigurable optical networks. The series is designed to: • Provide the best available presentations of important aspects of communication networks. • Help engineers and advanced students keep up with recent developments in a rapidly evolving technology. • Facilitate the development of courses in this field

[1]  Andrea Goldsmith,et al.  Wireless Communications , 2005, 2021 15th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).

[2]  B. Briscoe,et al.  Metcalfe's law is wrong - communications networks increase in value as they add members-but by how much? , 2006, IEEE Spectrum.

[3]  Ashutosh Sabharwal,et al.  Delay-constrained scheduling: power efficiency, filter design, and bounds , 2004, IEEE INFOCOM 2004.

[4]  Stephen E. Margolis,et al.  Network externality : an uncommon tragedy , 1994 .

[5]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[6]  Robert Gibbons,et al.  A primer in game theory , 1992 .

[7]  Eytan Modiano,et al.  Optimal energy allocation for delay-constrained data transmission over a time-varying channel , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[9]  L. Tassiulas,et al.  Throughput properties of a queueing network with distributed dynamic routing and flow control , 1996, Advances in Applied Probability.

[10]  Ness B. Shroff,et al.  Towards achieving the maximum capacity in large mobile wireless networks under delay constraints , 2004, Journal of Communications and Networks.

[11]  Vinod Sharma,et al.  Power constrained and delay optimal policies for scheduling transmission over a fading channel , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Peter Marbach,et al.  Analysis of a static pricing scheme for priority services , 2004, IEEE/ACM Transactions on Networking.

[13]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

[14]  Saswati Sarkar.  Optimum scheduling and memory management in input queued switches with finite buffer space , 2004, IEEE Transactions on Information Theory.

[15]  Ness B. Shroff,et al.  A framework for opportunistic scheduling in wireless networks , 2003, Comput. Networks.

[16]  Eytan Modiano,et al.  Dynamic power allocation and routing for time-varying wireless networks , 2005 .

[17]  Michael J. Neely,et al.  Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks , 2007, IEEE Transactions on Information Theory.

[18]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Marco Ajmone Marsan,et al.  Optimal Scheduling and Routing for Maximum Network Throughput , 2007, IEEE/ACM Transactions on Networking.

[20]  Ness B. Shroff,et al.  Utility maximization for communication networks with multipath routing , 2006, IEEE Transactions on Automatic Control.

[21]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[22]  Jeffrey K. MacKie-Mason,et al.  Pricing Congestible Network Resources (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[23]  R. Cornes,et al.  The theory of externalities, public goods and club goods. 2nd. ed. , 1996 .

[24]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[25]  John N. Tsitsiklis,et al.  Large deviations analysis of the generalized processor sharing policy , 1999, Queueing Syst. Theory Appl..

[26]  Lijun Qian,et al.  Uplink Scheduling in CDMA Packet-Data Systems , 2006, Wirel. Networks.

[27]  Supratim Deb,et al.  Fast Matching Algorithms for Repetitive Optimization: An Application to Switch Scheduling , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[28]  Eytan Modiano,et al.  Logarithmic delay for N × N packet switches under the crossbar constraint , 2007, TNET.

[29]  Michael Mitzenmacher,et al.  Computational Complexity of Loss Networks , 1994, Theor. Comput. Sci..

[30]  Ao Tang,et al.  Is fair allocation always inefficient , 2004, IEEE INFOCOM 2004.

[31]  M. Luby,et al.  Fast convergence of the Glauber dynamics for sampling independent sets , 1999 .

[32]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

[33]  Zhen Zhang,et al.  Multicasting in Time-varying Wireless Networks: Cross-layer Dynamic Resource Allocation , 2007, 2007 IEEE International Symposium on Information Theory.

[34]  Zhu Han,et al.  Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions , 2005, IEEE Transactions on Communications.

[35]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[36]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[37]  B. Pashigian,et al.  Price Theory and Applications , 1994 .

[38]  Paul R. Milgrom,et al.  Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities , 1990 .

[39]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[40]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[41]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[42]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[43]  Ness B. Shroff,et al.  Non-convex optimization and rate control for multi-class services in the Internet , 2005, IEEE/ACM Transactions on Networking.

[44]  Atilla Eryilmaz,et al.  Control for Inter-session Network Coding , 2006 .

[45]  Haitao Zheng,et al.  A General Framework for Wireless Spectrum Auctions , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[46]  Marco Ajmone Marsan,et al.  Bounds on average delays and queue size averages and variances in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[47]  Michael J. Neely.  Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks , 2006, IEEE J. Sel. Areas Commun..

[48]  Jack M. Holtzman,et al.  Power control and resource management for a multimedia CDMA wireless system , 1995, Proceedings of 6th International Symposium on Personal, Indoor and Mobile Radio Communications.

[49]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[50]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[51]  Alexander L. Stolyar,et al.  Greedy primal-dual algorithm for dynamic resource allocation in complex networks , 2006, Queueing Syst. Theory Appl..

[52]  A. Stolyar,et al.  LARGEST WEIGHTED DELAY FIRST SCHEDULING: LARGE DEVIATIONS AND OPTIMALITY , 2001 .

[53]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[54]  Michael J. Neely,et al.  Dynamic power allocation and routing for satellite and wireless networks with time varying channels , 2003 .

[55]  M. Palaniswami,et al.  Application-Oriented Flow Control: Fundamentals, Algorithms and Fairness , 2006, IEEE/ACM Transactions on Networking.

[56]  Aggelos K. Katsaggelos,et al.  Joint Source Adaptation and Resource Allocation for Multi-User Wireless Video Streaming , 2008, IEEE Transactions on Circuits and Systems for Video Technology.

[57]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[58]  S. Shakkottai,et al.  Pathwise optimality of the exponential scheduling rule for wireless channels , 2004, Advances in Applied Probability.

[59]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1995, IEEE Trans. Autom. Control..

[60]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[61]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2007, IEEE Trans. Mob. Comput..

[62]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[63]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[64]  Leandros Tassiulas,et al.  Exploiting wireless channel State information for throughput maximization , 2004, IEEE Trans. Inf. Theory.

[65]  G. Caire,et al.  Impact of multiple transmit antennas in a queued SDMA/TDMA downlink , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[66]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[67]  Eitan Altman,et al.  S-modular games and power control in wireless networks , 2003, IEEE Trans. Autom. Control..

[68]  Jan A. Van Mieghem,et al.  Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .

[69]  Eytan Modiano,et al.  Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity , 2007, IEEE Transactions on Information Theory.

[70]  Yunnan Wu,et al.  Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .

[71]  Michael L. Honig,et al.  Auction-Based Spectrum Sharing , 2006, Mob. Networks Appl..

[72]  Edmund M. Yeh,et al.  Multiaccess and fading in communication networks , 2001 .

[73]  M.L. Honig,et al.  Performance of distributed utility-based power control for wireless ad hoc networks , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[74]  Rajeev Agrawal,et al.  Optimality of Certain Channel Aware Scheduling Policies , 2002 .

[75]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[77]  Michael L. Honig,et al.  Distributed interference compensation for wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[78]  Robin Mason,et al.  Internet service classes under competition , 2000, IEEE Journal on Selected Areas in Communications.

[79]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[80]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[81]  E. Uysal-Biyikoglu,et al.  Low Complexity Multiuser Scheduling for Maximizing Throughput in the MIMO Broadcast Channel , 2004 .

[82]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[83]  Devavrat Shah,et al.  Maximal matching scheduling is good enough , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[84]  Mung Chiang.  Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control , 2005 .

[85]  Leandros Tassiulas,et al.  Scheduling and performance limits of networks with constantly changing topology , 1997, IEEE Trans. Inf. Theory.

[86]  A. Rubinstein.  Perfect Equilibrium in a Bargaining Model , 1982 .

[87]  Devavrat Shah,et al.  Delay bounds for approximate maximum weight matching algorithms for input queued switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[88]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

[89]  B. Hajek.  Optimal control of two interacting service stations , 1982, 1982 21st IEEE Conference on Decision and Control.

[90]  Vijay Garg,et al.  Wireless Communications & Networking , 2007 .

[91]  A. C. Pigou.  Economics of welfare , 1920 .

[92]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

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

[94]  L. Hurwicz,et al.  Constraint Qualifications in Maximization Problems , 1961 .

[95]  R. Coase,et al.  The Problem of Social Cost , 1960, The Journal of Law and Economics.

[96]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[97]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[98]  Devavrat Shah,et al.  Optimal Scheduling Algorithms for Input-Queued Switches , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[99]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2005, IEEE Trans. Inf. Theory.

[100]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[101]  Eytan Modiano,et al.  Convexity in queues with general inputs , 2005, IEEE Transactions on Information Theory.

[102]  Nabil Kahale,et al.  Dynamic global packet routing in wireless networks , 1997, Proceedings of INFOCOM '97.

[103]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[104]  Eytan Modiano,et al.  Minimum energy transmission scheduling subject to deadline constraints , 2008, Wirel. Networks.

[105]  Ness B. Shroff,et al.  Downlink power allocation for multi-class CDMA wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[106]  D. M. Topkis.  Supermodularity and Complementarity , 1998 .

[107]  Elif Uysal-Biyikoglu,et al.  Energy-efficient packet transmission over a wireless link , 2002, TNET.

[108]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[109]  J. Friedman.  Game theory with applications to economics , 1986 .

[110]  Dana Randall,et al.  Analyzing Glauber Dynamics by Comparison of Markov Chains , 1998, LATIN.

[111]  Baruch Awerbuch,et al.  A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[112]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[113]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[114]  Michael J. Neely,et al.  Cross-layer adaptive control for wireless mesh networks , 2007, Ad Hoc Networks.

[115]  Michael J. Neely.  Energy Optimal Control for Time-Varying Wireless Networks , 2006, IEEE Trans. Inf. Theory.

[116]  Leon A. Petrosjan,et al.  Game Theory and Applications , 2003 .

[117]  S. Kakutani.  A generalization of Brouwer’s fixed point theorem , 1941 .

[118]  Eytan Modiano,et al.  A calculus approach to minimum energy transmission policies with quality of service guarantees , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[119]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[120]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[121]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[122]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[123]  R. Srikant,et al.  Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[124]  John N. Tsitsiklis,et al.  Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach , 1998, IEEE Trans. Autom. Control..

[125]  Jeffrey H. Rohlfs.  A theory of interdependent demand for a communications service , 1974 .

[126]  H. Kushner,et al.  Asymptotic Properties of Proportional-Fair Sharing Algorithms , 2002 .

[127]  Randall Berry,et al.  Throughput Optimal Control of Cooperative Relay Networks , 2005, IEEE Transactions on Information Theory.

[128]  Steven E. Landsburg,et al.  Price Theory and Applications , 1991 .

[129]  Paul Heidhues,et al.  A group bargaining solution , 2004, Math. Soc. Sci..

[130]  F. Vázquez-Abad,et al.  Policy gradient stochastic approximation algorithms for adaptive control of constrained time varying Markov decision processes , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[131]  Ness B. Shroff,et al.  Opportunistic power scheduling for dynamic multi-server wireless systems , 2006, IEEE Transactions on Wireless Communications.

[132]  R. Srikant,et al.  Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control , 2007, TNET.

[133]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[134]  Michael J. Neely.  Optimal pricing in a free market wireless network , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[135]  Andrea J. Goldsmith,et al.  Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.

[136]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless ad hoc networks , 2005 .

[137]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[138]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[139]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[140]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2008 .

[141]  G. Staple,et al.  The end of spectrum scarcity [spectrum allocation and utilization] , 2004, IEEE Spectrum.