Configuring Traffic Grooming VPλNs

被引:0
|
作者
Tibor Cinkler
机构
[1] Budapest University of Technology and Economics,High
来源
关键词
VON; optical VON; traffic grooming; optimization; ILP; wavelength graph; survivability; disjoint paths;
D O I
暂无
中图分类号
学科分类号
摘要
A VPλN is an optical virtual private network (oVPN) built of wavelength paths within a multihop wavelength routing (WR) dense wavelength division multiplexing (DWDM) network. An efficient and general graph-theoretic model (the wavelength-graph (WG)) has been proposed along with an integer linear programming (ILP) formulation of setting up VPλNs with given traffic requirements over a given WR-DWDM network with two protection scenarios. Here, we have exploited the advantages of traffic grooming, i.e., numerous traffic streams of a VPN can share a wavelength path. We have also generalized the model for setting up VPNs over a WR-DWDM system where multiple VPNs can share a single wavelength path. The objective of the optimization is in all cases to reduce resource usage at upper (electrical) layers (i.e., to reduce the load of the virtual routers), subject to constrained amount of capacity of each wavelength channel and limited number of wavelengths. Here, we propose and compare three basic methods for configuring oVPNs and investigate various parameter settings.
引用
收藏
页码:239 / 253
页数:14
相关论文
共 50 条
  • [1] Configuring traffic grooming VPλNs
    Cinkler, T
    PHOTONIC NETWORK COMMUNICATIONS, 2004, 7 (03) : 239 - 253
  • [2] DYNAMIC TRAFFIC GROOMING: THE CHANGING ROLE OF TRAFFIC GROOMING
    Huang, Shu
    Dutta, Rudra
    IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2007, 9 (01): : 32 - 49
  • [3] Traffic and λ grooming
    Cinkler, T
    IEEE NETWORK, 2003, 17 (02): : 16 - 21
  • [4] Traffic grooming on the path
    Bermond, Jean-Claude
    Braud, Laurent
    Coudert, David
    THEORETICAL COMPUTER SCIENCE, 2007, 384 (2-3) : 139 - 151
  • [5] Traffic grooming on the path
    Bermond, JC
    Braud, L
    Coudert, D
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2005, 3499 : 34 - 48
  • [6] Maximizing throughput for traffic grooming with limited grooming resources
    Wang, Yong
    Gu, Qian-Ping
    GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11, 2007, : 2337 - 2341
  • [7] On the Complexity of Path Traffic Grooming
    Iyer, Prashant
    Dutta, Rudra
    Savage, Carla D.
    2ND INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS (BROADNETS 2005), 2005, : 308 - +
  • [8] Hierarchical traffic grooming: A tutorial
    Wang, Hui
    Rouskas, George N.
    COMPUTER NETWORKS, 2014, 69 : 147 - 156
  • [9] Approximating the traffic grooming problem
    Flammini, M
    Moscardelli, L
    Shalom, M
    Zaks, S
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 915 - 924
  • [10] Hardness and approximation of traffic grooming
    Amini, Omid
    Perennes, Stephane
    Sau, Ignasi
    ALGORITHMS AND COMPUTATION, 2007, 4835 : 561 - 573