Skip to main content

Advertisement

SpringerLink
Log in

Multihop Virtual Topology Design in WDM Optical Networks for Self-Similar Traffic

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

In this paper, we consider the problem of designing virtual topologies for multihop optical WDM networks when the traffic is self-similar in nature. Studies over the last few years suggest that the network traffic is bursty and can be much better modeled using self similar process instead of Poisson process. We examine buffer sizes of a network and observe that, even with reasonably low buffer overflow probability, the maximum buffer size requirement for self-similar traffic can be very large. Therefore, a self-similar traffic model has an impact on the queuing delay which is usually much higher than that obtained with the Poisson model. We investigate the problem of constructing the virtual topology with these two types of traffic and solve it with two algorithmic approaches: Greedy (Heuristic) algorithm and Evolutionary algorithm. While the greedy algorithm performs a least-cost search on the total delay along paths for routing traffic in a multihop fashion, the evolutionary algorithm uses genetic methods to optimize the average delay in a network. We analyze and compare our proposed algorithms with an existing algorithm via different performance parameters. Interestingly, with both the proposed algorithms the difference in the queuing delays, caused by self-similar and Poisson traffic, results in different multihop virtual topologies.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Mukherjee D. Banerjee S. Ramamurthy A. Mukherjee (Oct. 1996) ArticleTitleSome principles for designing a wide-area WDM optical network IEEE/ACM Transactions on Networking 4 IssueID5 684–695 Occurrence Handle10.1109/90.541317

    Article  Google Scholar 

  2. I. Chlamtac, A. Ganz, G. Karmi, Lightpath based solutions for wide bandwidth WANs, Proc. INFOCOM 1990 (San Francisco, LA, USA, June 1990), pp. 1014–1021.

  3. Z. Zhang A. Acampora (June 1995) ArticleTitleA heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use IEEE/ACM Transactions on Networking 3 IssueID3 281–288 Occurrence Handle10.1109/90.392387

    Article  Google Scholar 

  4. R. Ramaswami K. N. Sivarajan (June 1996) ArticleTitleDesign of logical topologies for wavelength-routed optical networks IEEE Journal of Selected Areas of Communications 14 IssueID5 840–851 Occurrence Handle10.1109/49.510907

    Article  Google Scholar 

  5. I. Chlamtac A. Farago T. Zhang (June 1996) ArticleTitleLightpath (wavelength) routing in large WDM networks IEEE Journal of Selected Areas of Communications 14 IssueID5 909–913 Occurrence Handle10.1109/49.510914

    Article  Google Scholar 

  6. J.-F. P. Labourdette A. S. Acampora (Aug. 1991) ArticleTitleLogically rearrangeable multihop lightwave networks IEEE/ACM Transactions on Communications 39 IssueID8 1223–1230 Occurrence Handle10.1109/26.134012

    Article  Google Scholar 

  7. J.A. Bannister, L. Fratta, M. Gerla, Topological design of the wavelength-division optical network, Proc. INFOCOM 90 (San Francisco, LA, USA, June 1990), pp. 1005–1013.

  8. R. M. Krishnaswamy K. N. Sivarajan (Apr. 2001) ArticleTitleDesign of logical topologies: A linear formulation for wavelength-routed optical networks with no wavelength changers IEEE/ACM Transactions on Networking 9 IssueID2 186–198 Occurrence Handle10.1109/90.917075

    Article  Google Scholar 

  9. S. Banerjee B. Mukherjee D. Sarkar (Feb.–Apr. 1994) ArticleTitleHeuristic algorithms for constructing optimized structures of linear multihop lightwave networks IEEE Transactions on Networking 2 IssueID2–4 1811–1826

    Google Scholar 

  10. D. Banerjee B. Mukherjee (Oct. 2000) ArticleTitleWavelength routed optical networks: Linear formulation, resource budget tradeoffs and a reconfiguration study IEEE/ACM Transactions on Networking 8 IssueID9 598–607 Occurrence Handle10.1109/90.879346

    Article  Google Scholar 

  11. V. Paxson S. Floyd (June 1995) ArticleTitleWide-area traffic: The failure of Poisson modeling IEEE/ACM Transactions on Networking 3 IssueID3 226–244

    Google Scholar 

  12. W. Willinger V. Paxon M. S. Taqqu (1998) Self-similarity and heavy tails: Structural modeling of network traffic R. Adler R. Feldman M. S. Taqqu (Eds) A Practical Guide To Heavy Tails: Statistical Techniques and Applications Birkhauser Boston, MA 27–53

    Google Scholar 

  13. K. Thompson G. J. Miller R. Wilder (Nov. 1997) ArticleTitleWide-area Internet traffic patterns and characteristics IEEE Network 11 IssueID6 10–23 Occurrence Handle10.1109/65.642356

    Article  Google Scholar 

  14. H.-P. Schwefel L. Lipsky (Mar. 2001) ArticleTitleImpact of self-similar On/Off traffic on delay in stationary queueing models Performance Evaluation 43 IssueID4 203–221 Occurrence Handle10.1016/S0166-5316(00)00046-8

    Article  Google Scholar 

  15. P. Fiorini, L. Lipsky, H.-P. Schwefel, Analytical models of performance in telecommunication systems based on On-Off traffic sources with self-similar behavior, Proc, of 7th Int. Conf. Telecommunication Systems and Modeling (Nashville, TN, USA, Mar, 1999).

  16. H.-P. Schwefel, Performance analysis of intermediate systems serving aggregated On/Off traffic with long-range dependent properties, Ph.D. dissertation, Institute für Informatik: Technischen Universität München, 2000.

  17. M. S. Kumar P. S. Kumar (Jan. 2002) ArticleTitleStatic lightpath establishment in WDM networks: New ILP formulations and heuristic algorithms Computer Communications 25 IssueID1 109–114 Occurrence Handle10.1016/S0140-3664(01)00339-5

    Article  Google Scholar 

  18. R. Jain S. Routhier (Sept. 1986) ArticleTitlePacket trains-measurements and a new model for computer network traffic IEEE/ACM Journal of Selected Areas of Communication 4 IssueID6 986–995 Occurrence Handle10.1109/JSAC.1986.1146410

    Article  Google Scholar 

  19. H. Fowler W. Leland (Sept. 1991) ArticleTitleLocal area network traffic characteristics with implications for broadband network congestion management IEEE/ACM Journal of Selected Areas of Communication 9 IssueID7 1139–1149 Occurrence Handle10.1109/49.103559

    Article  Google Scholar 

  20. P. Danzig et al. (Mar. 1992) ArticleTitleAn empirical workload model for driving wide-area TCP/IP network simulations Internetworking: Research and Experiences 3 IssueID1 1–26

    Google Scholar 

  21. W. Leland M. Taqqu W. Willinger D. Wilson (Feb. 1994) ArticleTitleOn the self-similar nature of Ethernet traffic IEEE/ACM Transactions on Networking 2 IssueID1 1–15 Occurrence Handle10.1109/90.282603

    Article  Google Scholar 

  22. M. E. Crovella A. Bestavros (Dec. 1997) ArticleTitleSelf similarity in world wide web traffic: Evidence and possible causes IEEE Transactions on Networking 5 IssueID6 835–846 Occurrence Handle10.1109/90.650143

    Article  Google Scholar 

  23. F. N. Abuali, D. A. Schnoenefeld, R. L. Wainwright, Designing telecommunication networks using genetic algorithms and probabilistic minimum spanning trees, Proc. ACM Symp. Applied Computing (Phoenix, AZ, USA, Mar. 1994), pp. 242–246.

  24. R. Kumar, N. Banerjee, Multicriteria network design using evolutionary algorithm, Proc. Genetic and Evolutionary Computation Conference (Chicago, IL, USA, July 2003), Lecture Notes in Computer Science, vol. 2724, pp. 2179–2190.

  25. K. T. Ko K. S. Tang C. Chan K. F. Man S. Kwong (Aug. 1997) ArticleTitleUsing genetic algorithms to design mesh network IEEE Computer 30 IssueID8 56–61

    Google Scholar 

  26. C. Gazen C. Ersoy (1999) ArticleTitleGenetic algorithms for designing multihop lightwave network topologies Artificial Intelligence in Engineering 13 IssueID1999 211–221 Occurrence Handle10.1016/S0954-1810(98)00019-3

    Article  Google Scholar 

  27. D. Saha M. D. Purkayastha A. Mukherjee (Jan. 1999) ArticleTitleAn approach to wide-area WDM optical network design using genetic algorithm Computer Communications 22 IssueID2 156–172 Occurrence Handle10.1016/S0140-3664(98)00238-2

    Article  Google Scholar 

  28. H.-S. Yang M. Maier M. Reisslein W. M. Carlyle (May 2003) ArticleTitleA genetic algorithm based methodology for optimizing multi-service convergence in a metro WDM network IEEE/OSA Journal of Lightwave Technology 21 IssueID5 1114–1133 Occurrence Handle10.1109/JLT.2003.811564

    Article  Google Scholar 

  29. M. Kato, Y. Oie, Reconfiguration algorithms based on meta-heuristics for multihop WDM lightwave networks, Proc. IEEE Int. Conf. Communications (New Orleans, LA, USA, June 2000), pp. 1638–1644.

  30. Y. Xin, G. N. Rouskas, H. G. Perros, Design of large-scale optical networks, Proc. 14th IASTED Int. Conf. Parallel and Distributed Computing and Systems (Cambridge, MA, USA, Nov. 2002), pp. 822–827.

  31. D. Bisbal I. Miguel Particlede F. Gonzalez J. Blas J. C. Aguado P. Fernandez J. Duran R. Duran R. M. Lorenzo E. J. Abril M. Lopez (Jan. 2004) ArticleTitleDynamic routing and wavelength assignment in optical networks by means of genetic algorithms Photonic Network Communications 7 IssueID1 43–58 Occurrence Handle10.1023/A:1027401202391

    Article  Google Scholar 

  32. T. G. Robertazzi, Computer Networks and Systems: Queueing Theory and Performance Evaluation (Springer-Verlag), 2000.

  33. C. S. R. Murthy, M. Gurusamy, WDM Optical Networks: Concepts, Design, and Algorithms, Pearson Education Inc., 2002.

  34. E. de Queiros Vieira Martins, M. Pascoal, J. dos Santos, The k shortest loopless paths problem, CISUC Tech. Rep., 1998.

  35. V. M. Jimenez A. Marzal (1999) ArticleTitleComputing the k shortest paths: A new algorithm and experimental comparison Lecture Notes in Computer Science 1668 15–28

    Google Scholar 

  36. E. de Queiros Vieira Martins, M. Pascoal, J. dos Santos, A new implementation of Yen’s ranking loopless path algorithm, CISUC, Tech, Rep., 2000.

  37. D. Brelaz (Apr. 1979) ArticleTitleNew methods to color vertices of a graph Communications of the ACM 22 IssueID4 251–256 Occurrence Handle10.1145/359094.359101

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India

    Sujoy Ghose, Rajeev Kumar, Nilanjan Banerjee & Raja Datta

Authors
  1. Sujoy Ghose
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nilanjan Banerjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Raja Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rajeev Kumar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghose, S., Kumar, R., Banerjee, N. et al. Multihop Virtual Topology Design in WDM Optical Networks for Self-Similar Traffic. Photon Netw Commun 10, 199–214 (2005). https://doi.org/10.1007/s11107-005-2484-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-005-2484-2

Keywords

Search

Navigation