Skip to main content
SpringerLink
Log in

Models and Techniques for Communication in Dynamic Networks

  • Conference paper
  • First Online:
STACS 2002 (STACS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2285))

Included in the following conference series:

Abstract

In this paper we will present various models and techniques for communication in dynamic networks. Dynamic networks are networks of dynamically changing bandwidth or topology. Situations in which dynamic networks occur are, for example: faulty networks (links go up and down), the Internet (the bandwidth of connections may vary), and wireless networks (mobile units move around). We investigate the problem of how to ensure connectivity, how to route, and how to perform admission control in these networks. Some of these problems have already been partly solved, but many problems are still wide open. The aim of this paper is to give an overview of recent results in this area, to identify some of the most interesting open problems and to suggest models and techniques that allow us to study them.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Adler and C. Scheideler. Efficient communication strategies for ad hoc wireless networks. Theory Comput. Systems, 33:337–391, 2000.

    Article  MATH  Google Scholar 

  2. W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosén. Adaptive packet routing for bursty adversarial traffic. In Proc. of the 30th ACM Symp. on Theory of Computing (STOC), pages 359–368, 1998.

    Google Scholar 

  3. M. Ajtai, J. Komlós, and E. Szemerédi. Largest random component of a k-cube. Combinatorica, 2(1):1–7, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. In Proc. of the 37th IEEE Symp. on Foundations of Computer Science (FOCS), pages 380–389, 1996.

    Google Scholar 

  5. M. Andrews, A. Fernández, A. Goel, and L. Zhang. Source routing and scheduling in packet networks. In Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 168–177, 2001.

    Google Scholar 

  6. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive on-line routing. In Proc. of the 34th IEEE Symposium on Foundations of Computer Science, pages 32–40, 1993.

    Google Scholar 

  7. B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 158–167, 2001.

    Google Scholar 

  8. B. Awerbuch, A. Brinkmann, and C. Scheideler. Unicasting and multicasting in adversarial systems. Unpublished manuscript, 2001.

    Google Scholar 

  9. A. Bagchi, A. Chaudhary, P. Kolman, and C. Scheideler. Algorithms for the maximum disjoint k-paths problem. Unpublished manuscript, November 2001.

    Google Scholar 

  10. A. Baveja and A. Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research, 25, 2000.

    Google Scholar 

  11. B. Bollobas. The evolution of random graphs. Transactions of the AMS, 286:257–274, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queueing theory. In Proc. of the 28th ACM Symp. on Theory of Computing (STOC), pages 376–385, 1996.

    Google Scholar 

  13. R. Cole, B. Maggs, and R. Sitaraman. Routing on butterfly networks with random faults. In Proc. of the 36th IEEE Symp. on Foundations of Computer Science (FOCS), pages 558–570, 1995.

    Google Scholar 

  14. R. Cole, B. Maggs, and R. Sitaraman. Reconfiguring arrays with faults part I: worst-case faults. SIAM Journal on Computing, 26(6):1581–1611, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. P. Erdős and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5:17–61, 1960.

    Google Scholar 

  16. M. Fischer, T. Lukovski, and M. Ziegler. Partitioned neighborhood spanners of minimal outdegree. In Proc. of the 11th Canadian Conference on Computational Geometry, 1999.

    Google Scholar 

  17. L. Fleischer, A. Meyerson, I. Saniee, and A. Srinivasan. Fast and efficient bandwidth reservation for robust routing. In DIMACS Mini-Workshop on Quality of Service Issues in the Internet, February 2001.

    Google Scholar 

  18. D. Gamarnik. Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks. In Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pages 206–214, 1999.

    Google Scholar 

  19. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proc. of the 39th IEEE Symp. on Foundations of Computer Science (FOCS), pages 300–309, 1998.

    Google Scholar 

  20. I. Gitman, R. Van Slyke, and H. Frank. Routing in packet-switching broadcast radio networks. IEEE Transactions on Communication, 24:926–930, 1976.

    Article  Google Scholar 

  21. P. Gupta and P. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, IT-46(2):388–404, 2000.

    Article  MathSciNet  Google Scholar 

  22. P. Gupta and P. Kumar. Internets in the sky: The capacity of three dimensional wireless networks. Communications in Information and Systems, 1(1):33–50, 2001.

    MATH  MathSciNet  Google Scholar 

  23. R. Hardin, N. Sloane, and W. Smith. A library of putatively optimal coverings of the sphere with n equal caps. http://www.research.att.com/~njas/coverings/.

  24. J. Håstad, T. Leighton, and M. Newman. Reconfiguring a hypercubein the presence of faults. In Proc. of the 19th ACM Symp. on Theory of Computing (STOC), pages 274–284, 1987.

    Google Scholar 

  25. J. Jacobsmeyer. Congestion relief on power-controlled CDMA networks. IEEE Journal on Selected Areas in Communications, 14(9):1758–1761, 1996.

    Article  Google Scholar 

  26. J. Jaromczyk and G. Toussaint. Relative neighborhood graphs and their relatives. Proceedings of the IEEE, 80:1502–1517, 1992.

    Google Scholar 

  27. A. Karlin, G. Nelson, and H. Tamaki. On the fault tolerance of the butterfly. In Proc. of the 26th ACM Symp. on Theory of Computing (STOC), pages 125–133, 1994.

    Google Scholar 

  28. H. Kesten. The critical probability of bond percolation on the square lattice equals 1/2. Communication in Mathematical Physics, 74:41–59, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  29. J. Kleinberg. Approximation Algorithms for Disjoint Paths Problems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1996.

    Google Scholar 

  30. P. Kolman and C. Scheideler. Improved bounds for the unsplittable flow problem. In Proc. of the 13th ACM Symp. on Discrete Algorithms (SODA), 2002.

    Google Scholar 

  31. F. Leighton and B. Maggs. Fast algorithms for routing around faults in multibutter flies and randomly-wired splitter networks. IEEE Transactions on Computers, 41(5):578–587, 1992.

    Article  Google Scholar 

  32. F. Leighton, B. Maggs, and S. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):167–186, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  33. F. Leighton, B. Maggs, and R. Sitaraman. On the fault tolerance of some popular bounded-degree networks. SIAM Journal on Computing, 27(5):1303–1333, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  34. T. Luczak, B. Pittel, and J. Wierman. The structure of a random graph at the point of the phase transition. Transactions of the AMS, 341:721–748, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  35. J. Monks. Transmission Power Control for Enhancing The Performance of Wireless Packet Data Networks. PhD thesis, Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL, March 2001.

    Google Scholar 

  36. S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proc. of the 32nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 495–504, 1991.

    Google Scholar 

  37. M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2):335–348, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  38. J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. In Proc. of the 3rd Canadian Conference on Computational Geometry, pages 207–210, 1991.

    Google Scholar 

  39. S. Ulukus and R. Yates. Stochastic power control for cellular radio systems. IEEE Transactions on Communication, 46:784–798, 1998.

    Article  Google Scholar 

  40. E. Upfal. Tolerating a linear number of faults in networks of bounded degree. Information and Computation, 115(2):312–320, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  41. A. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721–736, 1982.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Johns Hopkins University, 3400 N. Charles Street, 21218, Baltimore, MD, USA

    Christian Scheideler

Authors
  1. Christian Scheideler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Free University of Berlin, Takustraße 9, 14195, Berlin, Germany

    Helmut Alt

  2. CNRS - I3S - INRIA Sophia Antipolis, 2004 Route des Lucioles, 06902, Sophia Antipolis, France

    Afonso Ferreira

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45841-7_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43283-8

  • Online ISBN: 978-3-540-45841-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation