Skip to content

Papers related to lectures

Note: All rights are reserved by the publishers. You can get all papers online from the publishers (e.g. IEEE or ACM portals) but I am including a local copy here for your convenience.

Switching (Probability, queueing, combinatorics)

  • M. Karol, M. Hluchyj, and S. Morgan, “Input Versus Output Queueing in a Space Division Packet Switch”, IEEE Transactions on Communications, 1987. local copy
  • T. Anderson, S. Owicki, J. Saxe, and C. Thacker, “High-speed Switch Scheduling for Local-Area Networks”, ACM Transactions on Computer Systems, 1993. local copy
  • An Algorithm Used in Practice: N. McKeown, “iSLIP: A Scheduling Algorithm for Input-Queued Switches”, IEEE/ACM Transactions on Networking, 1999. local copy
  • S.-T. Chuang, A. Goel, and N. McKeown, B. Prabhakar, “Matching Output Queueing with a Combined Input Output Queued Switch”, IEEE Journal on Selected Areas in Communications, 1999. local copy
  • S. Iyer, R. Zhang, and N. McKeown, “Routers with a Single Stage of Buffering”, ACM SIGCOMM, 2002. local copy
  • S. Iyer, and N. McKeown, “Analysis of the Parallel Packet Switch Architecture”, IEEE/ACM Transactions on Networking, 2003. local copy

Fair Queueing and Active Queue Management (Probability and queueing)

  • A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair-Queueing Algorithm”, ACM SIGCOMM, 1989. local copy
  • A. Parekh, and R. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case”, IEEE/ACM Transactions on Networking, 1993. local copy
  • S. Floyd, and V. Jacobson, “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transactions on Networking, 1993 local copy
  • I. Stoica, S. Shenker, and H. Zhang, “Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks”, ACM SIGCOMM, 1998. local copy
  • R. Pan, B. Prabhakar, and K. Psounis, “CHOKe, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation”, IEEE INFOCOM, 2000. local copy
  • A. Tang, J. Wang, S. Low, “Understanding CHOKe: Throughput and Spatial Characteristics”, IEEE/ACM Transactions on Networking, 2004. local copy
  • K. Psounis, A. Ghosh, B. Prabhakar, and G. Wang, “SIFT: A Simple Algorithm for Trucking Elephant Flows and Taking Advantage of Power Laws”, 43rd Allerton Conference on Communication, Control, and Computing, 2005. local copy

Sizing Internet Buffers (Probability, queueing, control theory)

  • G. Appenzeller, I. Keslassy, and N. McKeown, “Sizing Router Buffers”, ACM SIGCOMM, 2004. local copy
  • J. Sun, M. Zukerman, K. King-Tim, G. Chen, and S. Chun, “Effect of Large Buffers on TCP Queueing Behavior”, IEEE INFOCOM, 2004. local copy
  • D. Wischik, and N. McKeown, “Part I: Buffer Sizes for Core Routers”, ACM/SIGCOMM CCR, 2005. local copy
  • G. Raina, D. Towsley, and D. Wischik, “Part II: Control Theory for Buffer Sizing”, ACM/SIGCOMM CCR, 2005. local copy

Stability of Switches (Lyapunov functions, fluid analysis)

  • N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, “Achieving 100% Throughput in an Input-Queued Switch”, IEEE Transactions on Communications, 1999. local copy
  • J. Dai, and B. Prabhakar, “The Throughput of Data Switches With and Without Speedup”, IEEE INFOCOM, 2000. local copy

Switching and Scheduling (Combinatorics: Matchings and stable marriages)

  • B.Prabhakar, and N. McKeown, “On the Speedup Required for Combined Input and Output Queued Switching”, Automatica, 1999. local copy
  • A Simple Exposition: K. Psounis, “On the Connection Between Matching Theory and Switching”, unpublished manuscript.
  • G. Sharma, R.R. Mazumdar, and N.B. Shroff, “On the Complexity of Scheduling in Wireless Networks”, ACM MOBICOM, 2006. local copy

TCP Modelling and Network Control (Fluid models, control theory)

  • V. Misra, W. Gong, and D. Towsley, “A Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED,” ACM SIGCOMM, 2000. local copy
  • C.V. Hollot, V. Misra, D. Towsley, and W. Gong, “Analysis and Design of Controllers for AQM Routers Supporting TCP Flows,” Special issue of IEEE Transactions on Automatic Control on “Systems and Control Methods for Communication Networks”, 2002. local copy
  • S. Low, F. Paganini, and J. Doyle, “Internet Congestion Control: An Analytical Perspective”, IEEE Control Systems Magazine, 2002. local copy
  • F. Paganini, Z. Wang, S. Low, and J.Doyle, “A new TCP/AQM for Stable Operation in Fast Networks”, IEEE INFOCOM, 2003. local copy
  • Modelling TCP mices: M. A. Marsan, M. Garetto, P. Giaccone, E. Leonardi, E. Schiattarella, and A. Tarello, “Using Partial Differential Equations to Model TCP Mice and Elephants in Large IP Networks”, IEEE INFOCOM, 2004. local copy
  • Using probability models to argue Internet scalability properties: R. Pan, K. Psounis, B. Prabhakar, and D. Wischik, “SHRiNK: Enabling Scaleable Performance Prediction and Efficient Simulation of Networks”, IEEE/ACM Transactions on Networking, 2005. local copy
  • D. X. Wei, C. Jin, S. H. Low, and S. Hegde, “FAST TCP: Motivation, Architecture, Algorithms, Performance”, IEEE/ACM Transactions on Networking, 2006. local copy

MAC Layer Performance Modeling in Wireless Networks (Markov chains, queueing, algorithms)

  • G. Bianchi, “Performance Analysis of the IEEE 802.11 Distributed Coordination Function”, IEEE Journal on Selected Areas in Communications, 2000. local copy
  • K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, “Impact of Interference on Multi-hop Wireless Network Performance”, ACM MOBICOM, 2003. local copy
  • G. Sharma, A. Ganesh, and P. Key, “Performance Analysis of Contention Based Medium Access Control Protocols”, IEEE INFOCOM, 2006. local copy

Mobility Models in Wireless Networks (Probability, random walks on graphs)

  • Random Waypoint mobility model: J. Broch, D. A. Maltz, D. B. Johnson, Y-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, Mobile Computing and Networking, 1998. local copy
  • Random Direction mobility model: C. Bettstetter, “Mobility Modeling in Wireless Networks: Categorization, Smooth Movement, and Border Effects”, ACM Mobile Computing and Communications Review, 2001.local copy
  • F. Bai, N. Sadagopan, and A. Helmy, “The IMPORTANT Framework for Analyzing the Impact of Mobility on Performance Routing for Ad Hoc Networks”, Ad-Hoc Networks Journal-Elsevier, 2003. local copy
  • S. Kurkowski, T. Camp, and M. Colagrosso, “MANET Simulation Studies: The Incredibles”, ACM SIGMOBILE Computing and Communications Review, 2005. local copy
  • A. Spyropoulos, K. Psounis, and C. Raghavendra, “Performance Analysis of Mobility-Assited Routing”, ACM MOBIHOC, 2006. local copy
  • A. Jindal, and K. Psounis, “Foundamental Mobility Properties for Realistic Performance Analysis of Intermittentlty Connected Mobile Networks”, IEEE PERCOM Workshop on Intermittently Connected Mobile Ad hoc Networks, 2007. local copy
  • W-J. Hsu, A. Spyropoulos, K. Psounis, and A. Helmy, “Modeling Time-variant User Mobility in Wireless Mobile Networks”, IEEE INFOCOM, 2007. local copy

Routing in Wireless Ad-Hoc Networks (Random walks on graphs, Linear and dynamic programming)

  • D. B. Johnson, D.A. Maltz, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks”, Ad Hoc Networking, 2001. local copy
  • C. E. Perkins, E. M. Belding-Royer, and S. R. Das, “Ad-hoc On-Demand Distance Vector Routing”, IETF MANET DRAFT, 2002. local copy
  • R. C. Shah, S. Roy, S. Jain, and W. Brunette, “Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks”, 2003. local copy
  • S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network”, ACM SIGCOMM, 2004. local copy
  • W. Zhao, M. Ammar, and E. Zegura, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks”, ACM MOBIHOC, 2004. local copy
  • S. Jain, M. Demmer, R. Patra, and K. Fall, “Using Redundancy to Cope with Failures in a Delay Tolerant Network”, ACM SIGCOMM, 2005. local copy
  • C. Lindemann, and O. P. Waldhorst, “Modeling Epidemic Information Dissemination on Mobile Devices with Finite Buffers”, ACM SIGMETRICS, 2005. local copy
  • X. Zhang, G. Neglia, J. Kurose, and D. Towsley, “Performance Modeling of Epidemic Routing”, IFIP NETWORKING, 2006. local copy
  • A. Jindal, and K. Psounis, “Optimizing Multi-Copy Routing Schemes for Resources Constrained Internmittently Connected Mobile Networks”, Fortieth Asilomar Conference on Signals, Systems and Computers, 2006. local copy
  • T. Spyropoulos, K. Psounis, and C. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The single-copy case”, IEEE/ACM Transactions on Networking, 2007. local copy
  • T. Spyropoulos, K. Psounis, and C. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The multi-copy case”, IEEE/ACM Transactions on Networking, 2007. local copy

Throughput Analysis of Wireless Networks (Information theory)

  • L. Kleinrock, and J. Silvester, “Optimum Transmission Radii for Packet Radio Networks or Why Six is a Magic Number”, National Telecommunications Conference, 1978. local copy
  • P. Gupta, and P. R. Kumar, “The Capacity of Wireless Networks”, IEEE Transactions on Information Theory, 2000. local copy
  • J. Li, C. Blake, D. De Counto, H.I. Lee, and R. Morris, “Capacity of Ad Hoc Wireless Networks”, ACM MOBICOM, 2001. local copy
  • M. Grossglauser, and D. Tse, “Mobility Increases the Capacity of Ad hoc Wireless Networks”, IEEE/ACM Transactions on Networking, 2002. local copy
  • A.Gamal, J. Mammen, B. Prabhakar, and D. Shah, “Throughput Delay Trade-off in Wireless Networks”, IEEE INFOCOM, 2004. local copy
  • O. Dousse, M. Franceschetti, and P. Thiran, “On the Throughput Scaling of Wireless Relay Networks”, IEEE/ACM Transactions on Networking, 2006. local copy

Cooperation and pricing (Game Theory)

  • P.Marbach, “Pricing Differentiated Services Networks: Bursty Traffic”, IEEE INFOCOM, 2001. local copy
  • F. Milan, J. J. Jarmillo, and R. Srikant, “Achieving Cooperation in Multihop Wireless Networks of Selfish Nodes”, GameNets, 2006. local copy
  • E. Altman, N. Bonneau, and M. Debbah, “Correlated Equilibrium in Access Control for Wireless Communications”, IFIP NETWORKING, 2006. local copy
  • P. Marbach, and Y. Qiu, “Cooperation in Wireless Ad Hoc Networks: A Market-Based Approach”, IEEE/ACM Transactions on Networking, 2007. local copy
  • C. Yuen, and P. Marbach, “Price-Based Rate Control in Random Access Networks”, IEEE/ACM Transactions on Networking, 2007. local copy

Trace Analysis and sampling (Probabilistic and statistical analysis)

  • W. Leland, M. Taqqu, W. Willinger, and D. Wilson, “On the Self-Similar Nature of Ethernet Traffic”, IEEE/ACM Transactions on Networking, 1994. local copy
  • V. Paxson, and S. Floyd, “Wide-Area Traffic: The Failure of Poisson Modeling”, IEEE/ACM Transactions on Networking, 1995. local copy
  • W.Willinger, M. Taqqu, R. Sherman, and D.Wilson, “Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level”, IEEE/ACM Transactions on Networking,1997. local copy
  • M. Crovella, and A. Bestavros, “Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes”, IEEE/ACM Transactions on Networking,1997. local copy
  • L. Breslau, P. Cao, L. Fan, G.Phillips, and S. Shenker, “Web Caching and Zipf-like Distributions: Evidence and Implications”, IEEE INFOCOM, 1999. local copy
  • S. B. Fred, T. Bonald, A. Proutiere, G. Régnié, and J. W. Roberts, “Statistical Bandwidth Sharing: a Study of Congestion at Flow Level”, ACM SIGCOMM, 2001. local copy
  • R. Pan, B. Prabhakar, K. Psounis, and D. Wischik, “SHRINK: A Method for Scalable Performance Prediction and Efficient Network Simulation,” IEEE INFOCOM, 2003. local copy
  • L. Yao, M. Agapie, J. Canbar, and M. Doroslovacki, “Long-range Dependence in Internet Backbone Traffic”, IEEE ICC, 2003. local copy
  • K. Psounis, A. Zhu, B. Prabhakar, and R. Motwani, “Modelling Correlations in Web-Traces and Implications for Designing Replacement Policies,” Computer Networks Journal, Elsevier, 2004 local copy
  • J. Bicket, D. Aguayo, S. Biswas, and R. Morris, “Architecture and Evaluation of an Unplanned 802.11b Mesh Network”, ACM MOBICOM, 2005. local copy
  • F. Papadopoulos, K. Psounis, and R. Govindan, “Performance-preserving Topological Downscaling of Internet-like Networks”, IEEE Journal on Selected Areas in Communications, Issue on Sampling the Internet, 2006. local copy
  • D. Lelescu, U. Kozat, R. Jain, and M. Balakrishnan, “Model T++: An Empirical Joint Space-Time Registration Model”, ACM MOBIHOC, 2006. local copy
  • A. Jindal, and K. Psounis, “Modeling Spatially Correlated Data in Sensor Networks”, ACM Transactions on Sensor Networks, 2007. local copy

Heavy-tailness and Performance (Probabilistic and statistical analysis)

  • M. Harchol-Balter, M. Crovella, and C. Murta, “On Choosing a Task Assignment Policy for a Distributed Server System”, Journal of Parallel and Distributed Computing, 1999. local copy
  • N. Bansal, and M. Harchol-Balter, “Analysis of SRPT Scheduling: Investigating Unfairness”, ACM SIGMETRICS, 2001. local copy
  • K. Psounis, P. M. Fernandez, B. Prabhakar, and F. Papadopoulos, “Systems with Multiple Servers under Heavy-tailed Workloads”, Performance Evaluation, Elsevier, 2005. local copy

 

University of Southern California