Advertisement

Abstract

The demand routing and slotting problem on unit demands (unit-DRSP) arises from constructing a SONET ring to minimize cost. Given a set of unit demands on an n-node ring, each demand must be routed clockwise or counterclockwise and assigned a slot so that no two routes that overlap occupy the same slot. The objective is to minimize the total number of slots used.

It is well known that unit-DRSP is NP-complete. The best approximation algorithm guarantees a solution to within twice of optimality. In the special case when the optimal solution uses many colors, a recent algorithm by Kumar [12] beats the approximation factor of 2. A demand of unit-DRSP can be viewed as a chord on the ring whose endpoints correspond to the source and destination of the demand. Let w denote the size of the largest set of demand chords that pairwise intersect in the interior of the ring. We first present an algorithm that achieves an approximation factor of 2–2/(w+1) in an n-node network. We then show how to combine our algorithm with Kumar’s to achieve a hybrid algorithm with an an approximation factor of (2–max{4/n,1/(50log n)}).

Keywords

DRSP slotting SONET rings bandwidth allocation problem WDM networks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph Problems Arising from Wavelength-Routing in All-Optical Networks. In: Proc. 2nd Workshop on Optics and Computer Science, part of IPPS (1997)Google Scholar
  2. 2.
    Bermond, J.-C., Gargano, L., Perennes, S., Rescigno, A.A., Vaccaro, U.: Efficient Collective Communication in Optical Networks. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 574–585. Springer, Heidelberg (1996)Google Scholar
  3. 3.
    Carpenter, T.: personal communicationGoogle Scholar
  4. 4.
    Carpenter, T., Cosares, S., Saniee, I.: Demand Routing and Slotting on Ring Networks, Technical Report 97-02, Bellcore (1997)Google Scholar
  5. 5.
    Erlebach, T., Jansen, K.: Call Scheduling in Trees, Rings and Meshes. In: Proc. 30th Hawaii Int’l Conf. on System Sciencs, vol. 1, pp. 221–222 (1997)Google Scholar
  6. 6.
    Frank, A.: Edge-disjoint Paths in Planar Graphs. J. Comb. Theory Series B 39, 164–178 (1985)zbMATHCrossRefGoogle Scholar
  7. 7.
    Garey, M., Johnson, D., Miller, G., Papadimitriou, C.: The Complexity of Col- oring Circular Arcs and Chords. SIAM J. Alg. Disc. Methods 1(2), 216–227 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Gavril, F.: Algorithms for a Maximum Clique and a Maximum Independent Set of Circle Graphs. Networks 3, 261–273 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Academic Press Inc., London (1980)zbMATHGoogle Scholar
  10. 10.
    Hsu, W.L., Shih, W.K.: An Approximation Algorithm for Coloring Circular Arc Graphs. SIAM Conf. on Disc. Math. (1990)Google Scholar
  11. 11.
    Kumar, V.: An Approximation Algorithm for Circular Arc Coloring, preprint (1998)Google Scholar
  12. 12.
    Kumar, V.: Efficient Bandwidth Allocation in Ring Networks, preprint (1998) (Note: An early version of this work was presented at APPROX 1998.)Google Scholar
  13. 13.
    Kumar, V., Schwabe, E.J.: Improved Access to Optical Bandwidth in Trees. In: Proc. 8th Annual ACM-SIAM Symp. on Disc. Algs., pp. 437–444 (1997)Google Scholar
  14. 14.
    Litman, A., Rosenberg, A.L.: Balancing Communication in Ring-Structured Net- works, Technical Report 93-80, University of Massachusetts (1993)Google Scholar
  15. 15.
    Mihail, M., Kaklamanis, C., Rao, S.: Efficient Access to Optical Bandwidth. In: Proc. 36th IEEE Symp. on Foundations of Computer Science, pp. 548–557 (1995)Google Scholar
  16. 16.
    Raghavan, P., Upfal, E.: Efficient Routing in All-optical Networks. In: Proc. 26th ACM Symp. on Theory of Comput., pp. 134–143 (1994)Google Scholar
  17. 17.
    Tucker, A.: Coloring a Family of Circular Arcs. SIAM J. Appl. Math. 229(3), 493–502 (1975)CrossRefGoogle Scholar
  18. 18.
    Schrijver, A., Seymour, P., Winkler, P.: The Ringloading Problem. SIAM J. Disc. Math. 11(1), 1–14 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Wilfong, G., Winkler, P.: Ring Routing and Wavelength Translation. In: Proc. 9th Annu. ACM-SIAM Symp. on Disc. Algs., pp. 333–341 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Christine T. Cheng
    • 1
  1. 1.Department of Mathematical SciencesJohns Hopkins UniversityBaltimoreUSA

Personalised recommendations