Advertisement

Routing and Call Control Algorithms for Ring Networks

  • R. Sai Anand
  • Thomas Erlebach
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)

Abstract

A vast majority of communications in a network occurs between pairs of nodes, each such interaction is termed a call. The job of a call control algorithm is to decide which of a set of calls to accept in the network so as to maximize the number of accepted calls or the profit associated with the accepted calls. When a call is accepted it uses up some network resources, like bandwidth, along the path through which it is routed. The call control algorithm needs to make intelligent trade-offs between resource constraints and profits. We investigate two variants of call control problems on ring networks; in the first, the algorithm is allowed to determine the route connecting the end nodes of a call, while in the second, the route is specified as part of the input. For the first variant, we show an efficient algorithm that achieves the objective of routing and maximizing the number of accepted calls within an additive constant of at most 3 to an optimal algorithm. For the fixed path variant, we derive a 2-approximation for maximizing the profits (which could be arbitrary) of accepted calls. For several important special cases we show polynomial time optimal algorithms.

Keywords

Integer Linear Program Opposite Edge Call Admission Control Ring Network Capacity Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adamy, U., Ambuehl, C., Anand, R.S., Erlebach, T.: Call control in rings. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 788–799. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1999, pp. 1–10 (1999)Google Scholar
  3. 3.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, algorithms and application. Prentice-Hall, NewYork (1993)Google Scholar
  4. 4.
    Anand, R.S., Erlebach, T.: Routing and call control algorithms for ring networks. Technical Report TIK-Report 171, ETH Zürich, (May 2003), Available electronically at ftp://ftp.tik.ee.ethz.ch/pub/publications/TIK-Report171.pdf
  5. 5.
    Blum, A., Kalai, A., Kleinberg, J.: Admission control to minimize rejections. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 155–164. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics 59, 225–235 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Erlebach, T.: Approximation algorithms and complexity results for path problems in trees of rings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 351–362. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Erlebach, T., Jansen, K.: The maximum edge-disjoint paths problem in bidirected trees. SIAM Journal on Discrete Mathematics 14(3), 326–355 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Garay, J.A., Gopal, I.S., Kutten, S., Mansour, Y., Yung, M.: Efficient on-line call control algorithm. Journal of Algorithms 23, 180–194 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: IEEE INFOCOM (2003)Google Scholar
  12. 12.
    Okamura, H., Seymour, P.: Multicommodity flows in planar graphs. Journal of Combinatorial Theory, Series B 31, 75–81 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Wan, P.J., Liu, L.: Maximal throughput in wavelength-routed optical networks. In: Multichannel Optical Networks: Theory and Practice. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 46, pp. 15–26. AMS (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • R. Sai Anand
    • 1
  • Thomas Erlebach
    • 1
  1. 1.Computer Engineering and Networks LabEidgenössische Technische HochschuleZürich

Personalised recommendations