Skip to main content
SpringerLink
Log in

Virtual Fiber Configuration for Dynamic Lightpath Establishment in Large-scaled Optical Networks

  • Original Article
  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

Recently, progress has been made in the Generalized Multi-Protocol Label Switching (GMPLS) and Automatic Switched Optical Networks (ASON) standardizations. These technologies realize construction of large-scaled optical networks, interconnections among single-domain Wavelength Division Multiplexing (WDM) networks, and direct communication over multi-domain WDM networks. Meanwhile, it is known that the topology of the Internet exhibits the power-law attribute. Since the topology of the Internet, which is constructed by interconnecting ASs, exhibits the power-law, there is a possibility that large-scale WDM networks, which are constructed by interconnecting WDM networks, will also exhibit the power-law attribute. One of the structural properties of a topology that adheres to the power-law is that most nodes have just a few links, although some have a tremendous number of them. Another property is that the average distance between nodes is smaller than in a mesh-like network. A natural question is how such a structural property performs in WDM networks. In this paper, we first investigate the property of the power-law attribute of physical topologies for WDM networks. We compare the performance of WDM networks with mesh-like and power-law topologies, and show that links connected to high-degree nodes are bottlenecks in power-law topologies. To relax this, we introduce a concept of virtual fiber, which consists of two or more fibers, and propose its configuration method to utilize wavelength resources more effectively. We compare performances of power-law networks with and without our method by computer simulations. The results show that our method reduces the blocking probabilities by more than one order of magnitude.

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. I. Chlamtac A. Ganz G. Karmi (1992) ArticleTitleLightpath communications: An approach to high bandwidth optical WAN’s IEEE Trans. Comm. 40 1171–1182 Occurrence Handle10.1109/26.153361

    Article  Google Scholar 

  2. R. Dutta G.N. Rouskas (2000) ArticleTitleA survey of virtual topology design algorithms for wavelength routed optical networks Opt. Netw. Mag. 1 73–89

    Google Scholar 

  3. B. Mukherjee D. Banerjee S. Ramamurthy A. Mukherjee (1996) ArticleTitleSome principles for designing a wide–area WDM optical network IEEE/ACM Trans. Netw. 4 684–695 Occurrence Handle10.1109/90.541317

    Article  Google Scholar 

  4. R. Ramaswami K.N. Sivarajan (1996) ArticleTitleDesign of logical topologies for wavelength–routed optical networks IEEE J. Sel. Areas Comm. 14 840–851 Occurrence Handle10.1109/49.510907

    Article  Google Scholar 

  5. J. Bannister J. Touch A. Willner S. Suryaputra (2000) ArticleTitleHow many wavelengths do we really need? A study of the performance limits of packet over wavelength Opt. Netw. Mag. 1 11–28

    Google Scholar 

  6. R.H. Cardwell O.J. Wasem H. Kobrinski (2000) ArticleTitleWDM architectures and economics in metropolitan areas Opt. Netw. Mag. 1 41–50

    Google Scholar 

  7. Cisco Systems Inc., Comparing metro WDM systems: Unidirectional vs. bidirectional implementations. White paper, Cisco Systems Inc., (2001)

  8. Bruyére, F.: Metro WDM. Alcatel telecommunications review, Alcatel, (2002)

  9. X. Yuan R. Melhem R. Gupta (1999) ArticleTitleDistributed path reservation for multiplexed all–optical networks IEEE Trans. Comput. 48 1355–1363 Occurrence Handle10.1109/12.817397

    Article  Google Scholar 

  10. Berger, L.: Generalized Multi–Protocol Label Switching (GMPLS) signaling functional description. RFC 3471 (2003)

  11. S. Tomic B. Statovci-Halimi A. Halimi W. Muellner J. Fruehwirth (2004) ArticleTitleASON and GMPLS – overview and comparsion Photonic Netw. Commun. 7 111–130 Occurrence Handle10.1023/B:PNET.0000012432.77218.10

    Article  Google Scholar 

  12. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: Proceedings of ACM SIGCOMM ’99, pp. 251–262 Cambridge University Press, MA, USA (1999)

  13. G. Siganos M. Faloutsos P. Faloutsos C. Faloutsos (2003) ArticleTitlePower laws and the AS–level Internet topology IEEE/ACM Trans. Netw. 11 514–524 Occurrence Handle10.1109/TNET.2003.815300

    Article  Google Scholar 

  14. A.-L. Barabási R. Albert (1999) ArticleTitleEmergence of scaling in random networks Science 286 509–512 Occurrence Handle2091634 Occurrence Handle10.1126/science.286.5439.509

    Article  MathSciNet  Google Scholar 

  15. A. Medina I. Matta J. Byers (2000) ArticleTitleOn the origin of power laws in Internet topologies ACM SIGCOMM Comput. Commun. Rev. 30 18–28 Occurrence Handle10.1145/505680.505683

    Article  Google Scholar 

  16. J.M. Carlson J. Doyle (1999) ArticleTitleHighly optimized tolerance: A mechanism for power laws in designed systems Phys. Rev. E 60 1412–1427 Occurrence Handle10.1103/PhysRevE.60.1412

    Article  Google Scholar 

  17. Fabrikant, A., Koutsoupias, E., Papadimitriou, C.H.: Heuristically optimized trade–offs: A new paradigm for power laws in the Internet. In: Proceedings of 29–th International Colloquium on Automata, Languages, and Programming (ICALP 2002), pp. 110–122, Málaga, Spain (2002)

  18. Qiu, L., Yang, Y.R., Zhang, Y., Shenker, S.: On selfish routing in Internet–like environments. In: Proceecdings of SIGOMM 2003, Karlsruhe, Germany 2003

  19. Gkantsidis, C., Mihail, M., Saberi, A.: Conductance and congestion in power law graphs. In: Proceedings of SIGMETRIC, San Diego, CA, USA (2003)

  20. P. Erdös A. Rényi (1960) ArticleTitleOn the evolution of random graphs Pub Math Inst Hungarian Acad. Sci. 5 17–61

    Google Scholar 

  21. Newman, M.E.J.: Random Graphs as Models of Networks, Chap. 2, pp. 35–68, 1edn. Wiley–vch, Berlin (2002)

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Osaka University, 1–5 Yamadaoka, Suita, Osaka, 565–0871, Japan

    Shinya Ishida & Masayuki Murata

  2. Graduate School of Economics, Osaka University, 1–7 Machikaneyama, Toyonaka, Osaka, 560–0043, Japan

    Shin’ichi Arakawa

Authors
  1. Shinya Ishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shin’ichi Arakawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masayuki Murata
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shinya Ishida.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ishida, S., Arakawa, S. & Murata, M. Virtual Fiber Configuration for Dynamic Lightpath Establishment in Large-scaled Optical Networks. Photon Netw Commun 12, 87–98 (2006). https://doi.org/10.1007/s11107-006-0017-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-006-0017-2

Keywords

Search

Navigation