Photonic Network Communications

, Volume 12, Issue 1, pp 87–98 | Cite as

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

  • Shinya Ishida
  • Shin’ichi Arakawa
  • Masayuki Murata
Original Article


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.


Wavelength division multiplexing Lightpath Large-scaled network Power-law 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chlamtac, I., Ganz, A., Karmi, G. 1992Lightpath communications: An approach to high bandwidth optical WAN’sIEEE Trans. Comm.4011711182CrossRefGoogle Scholar
  2. 2.
    Dutta, R., Rouskas, G.N. 2000A survey of virtual topology design algorithms for wavelength routed optical networksOpt. Netw. Mag.17389Google Scholar
  3. 3.
    Mukherjee, B., Banerjee, D., Ramamurthy, S., Mukherjee, A. 1996Some principles for designing a wide–area WDM optical networkIEEE/ACM Trans. Netw.4684695CrossRefGoogle Scholar
  4. 4.
    Ramaswami, R., Sivarajan, K.N. 1996Design of logical topologies for wavelength–routed optical networksIEEE J. Sel. Areas Comm.14840851CrossRefGoogle Scholar
  5. 5.
    Bannister, J., Touch, J., Willner, A., Suryaputra, S. 2000How many wavelengths do we really need? A study of the performance limits of packet over wavelengthOpt. Netw. Mag.11128Google Scholar
  6. 6.
    Cardwell, R.H., Wasem, O.J., Kobrinski, H. 2000WDM architectures and economics in metropolitan areasOpt. Netw. Mag.14150Google Scholar
  7. 7.
    Cisco Systems Inc., Comparing metro WDM systems: Unidirectional vs. bidirectional implementations. White paper, Cisco Systems Inc., (2001)Google Scholar
  8. 8.
    Bruyére, F.: Metro WDM. Alcatel telecommunications review, Alcatel, (2002)Google Scholar
  9. 9.
    Yuan, X., Melhem, R., Gupta, R. 1999Distributed path reservation for multiplexed all–optical networksIEEE Trans. Comput.4813551363CrossRefGoogle Scholar
  10. 10.
    Berger, L.: Generalized Multi–Protocol Label Switching (GMPLS) signaling functional description. RFC 3471 (2003)Google Scholar
  11. 11.
    Tomic, S., Statovci-Halimi, B., Halimi, A., Muellner, W., Fruehwirth, J. 2004ASON and GMPLS – overview and comparsionPhotonic Netw. Commun.7111130CrossRefGoogle Scholar
  12. 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)Google Scholar
  13. 13.
    Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C. 2003Power laws and the AS–level Internet topologyIEEE/ACM Trans. Netw.11514524CrossRefGoogle Scholar
  14. 14.
    Barabási, A.-L., Albert, R. 1999Emergence of scaling in random networksScience286509512MathSciNetCrossRefGoogle Scholar
  15. 15.
    Medina, A., Matta, I., Byers, J. 2000On the origin of power laws in Internet topologiesACM SIGCOMM Comput. Commun. Rev.301828CrossRefGoogle Scholar
  16. 16.
    Carlson, J.M., Doyle, J. 1999Highly optimized tolerance: A mechanism for power laws in designed systemsPhys. Rev. E6014121427CrossRefGoogle Scholar
  17. 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)Google Scholar
  18. 18.
    Qiu, L., Yang, Y.R., Zhang, Y., Shenker, S.: On selfish routing in Internet–like environments. In: Proceecdings of SIGOMM 2003, Karlsruhe, Germany 2003Google Scholar
  19. 19.
    Gkantsidis, C., Mihail, M., Saberi, A.: Conductance and congestion in power law graphs. In: Proceedings of SIGMETRIC, San Diego, CA, USA (2003)Google Scholar
  20. 20.
    Erdös, P., Rényi, A. 1960On the evolution of random graphsPub Math Inst Hungarian Acad. Sci.51761Google Scholar
  21. 21.
    Newman, M.E.J.: Random Graphs as Models of Networks, Chap. 2, pp. 35–68, 1edn. Wiley–vch, Berlin (2002)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  • Shinya Ishida
    • 1
  • Shin’ichi Arakawa
    • 2
  • Masayuki Murata
    • 1
  1. 1.Graduate School of Information Science and TechnologyOsaka UniversitySuitaJapan
  2. 2.Graduate School of EconomicsOsaka UniversityToyonakaJapan

Personalised recommendations