article

(Non-)reconfigurable virtual topology design under multihour traffic in optical networks

Authors:

Ramon Aparicio-Pardo,

Nina Skorin-Kapov,

Pablo Pavon-Marino,

Belen Garcia-ManrubiaAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 20, Issue 5

Pages 1567 - 1580

https://doi.org/10.1109/TNET.2012.2184300

Published: 01 October 2012 Publication History

Abstract

This paper investigates offline virtual topology design in transparent optical networks under a multihour traffic demand. The main problem variant addressed here designs a reconfigurable virtual topology that evolves over time to more efficiently utilize network resources (the MH-VTD-R problem). The case of designing a static non-reconfigurable virtual topology that can accommodate the time-varying traffic (the MH-VTD-NR problem) is also considered. The objectives are to minimize: 1) the number of transceivers, which make up for the main network cost; and 2) the frequency of reconfiguration (for MH-VTD-R), which incurs additional overhead and potential service disruption. We formulate this multiobjective problem as an exact mixed integer linear program (MILP). Due to its high complexity, we propose a very efficient heuristic algorithm called Greedy Approach with Reconfiguration Flattening (GARF). GARF not only solves both (non-)reconfigurable problem variants, but it allows for tuning of the relative importance of the two objectives. Exhaustive experiments on real and synthetic traffic and comparison to previous proposals and bounds reveal the merits of GARF with respect to both solution quality and execution time. Furthermore, the obtained results indicate that the maximal transceiver cost savings achieved by the fully reconfigurable case may not be enough to justify the associated increase in reconfiguration cost. However, results show that an advantageous tradeoff between transceiver cost savings and reconfiguration cost can be achieved by a allowing a small number of virtual topology reconfigurations over time.

References

[1]

J. Berthold, A. A. M. Saleh, L. Blair, and J. M. Simmons, "Optical networking: Past, present, and future," J. Lightw. Technol., vol. 26, no. 9, pp. 1104-1118, May 2008.

[2]

S. Sygletos, I. Tomkos, and J. Leuthold, "Technological challenges on the road toward transparent networking," J. Opt. Netw., vol. 7, no. 4, pp. 321-350, Apr. 2008.

[3]

H. Zang, J. P. Jue, and B. Mukherjee, "A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks," Opt. Netw. Mag., pp. 47-59, Jan. 2000.

[4]

Totem Project, "TOTEM Project: Toolbox for traffic engineering methods," 2008 {Online}. Available: http://totem.run.montefiore.ulg.ac.be/datatools.html

[5]

V. R. Konda and T. Y. Chow, "Algorithm for traffic grooming in optical networks to minimize the number of transceivers," in Proc. IEEE Workshop High Perform. Switching Routing, Dallas, TX, 2001, pp. 218-221.

[6]

K. Zhu, H. Zhu, and B. Mukherjee, "Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming," IEEE Netw., vol. 12, no. 2, pp. 8-15, Mar./Apr. 2003.

[7]

N. Srinivas and C. S. R. Murthy, "Design and dimensioning of a WDM mesh network to groom dynamically varying traffic," Photon. Netw. Commun., vol. 7, no. 2, pp. 179-191, 2004.

[8]

I. Baldine and G. N. Rouskas, "Traffic adaptive WDM networks: A study of reconfiguration issues," J. Lightw. Technol., vol. 19, no. 4, pp. 433-455, Apr. 2001.

[9]

P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, and N. Skorin-Kapov, "Virtual topology design and flow routing in optical networks under multihour traffic demand," Photon. Netw. Commun., vol. 19, no. 1, pp. 42-54, Feb. 2010.

[10]

B. Mukherjee, D. Banerjee, S. Ramamurthy, and A. Mukherjee, "Some principles for designing a wide-area WDM optical network," IEEE/ACM Trans. Netw., vol. 4, no. 5, pp. 684-696, Oct. 1996.

[11]

G. R. Ash, R. H. Cardwell, and R. P. Murray, "Design and optimization of networks with dynamic routing," Bell Syst. Tech. J., vol. 60, pp. 1787-1820, Oct. 1981.

[12]

M. Pioro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks. San Francisco, CA: Morgan Kaufmann, 2004, pp. 455-474.

[13]

G. Rouskas and M. H. Ammar, "Dynamic reconfiguration in multihop WDM networks," J. High Speed Netw., vol. 4, no. 3, pp. 221-238, 1995.

[14]

A. Gencata and B. Mukherjee, "Virtual-topology adaptation for WDM mesh networks under dynamic traffic," IEEE/ACM Trans. Netw., vol. 11, no. 2, pp. 236-247, Apr. 2003.

[15]

D. Banerjee and B. Mukerjee, "Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and a reconfiguration study," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 598-607, Oct. 2000.

[16]

B. Ramamurthy and A. Ramakrishnan, "Virtual topology reconfiguration of wavelength-routed optical WDM networks," in Proc. IEEE GLOBECOM, 2000, vol. 2, pp. 1269-1275.

[17]

K. Liu, C. Liu, J. Pastor, A. Roy, and J. Wei, "Performance and testbed study of topology reconfiguration in IP over optical networks," IEEE Trans. Commun., vol. 50, no. 10, pp. 1662-1679, Oct. 2002.

[18]

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, and R. Douville, "Routing and wavelength assignment of scheduled lightpath demands," IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231-1240, Oct. 2003.

[19]

N. Skorin-Kapov, "Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks," IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 2-15, Aug. 2006.

[20]

B. Wang, T. Li, X. Luo, Y. Fan, and C. Xin, "On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks," in Proc. BroadNets, Boston, MA, Oct. 2005, pp. 13-22.

[21]

C. V. Saradhi, M. Gurusamy, and R. Piesiewicz, "Routing fault-tolerant sliding scheduled traffic in WDM optical mesh networks," in Proc. BroadNets, London, U.K., Sep. 2008, pp. 197-202.

[22]

F. Ricciato, S. Salsano, A. Belmonte, and M. Listanti, "Off-line configuration of a MPLS over WDM network under time-varying offered traffic," in Proc. IEEE INFOCOM, 2002, pp. 57-65.

[23]

G. Agrawal and D. M. Edhi, "Lightpath topology configuration for wavelength-routed IP/MPLS network for time-dependent traffic," in Proc. IEEE GLOBECOM, San Francisco, CA, 2006, pp. CAM05-6:1-CAM05-6:5.

[24]

B. Garcia-Manrubia, R. Aparicio-Pardo, P. Pavon-Marino, N. Skorin-Kapov, and J. Garcia-Haro, "MILP formulations for scheduling lightpaths under periodic traffic," in Proc. 11th ICTON, Azores, Portugal, Jun. 2009, Paper Tu.C3.4.

[25]

N. Skorin-Kapov, P. Pavon-Marino, B. Garcia-Manrubia, and R. Aparicio-Pardo, "Scheduled virtual topology design under periodic traffic in transparent optical networks," in Proc. 6th ICST BroadNets, Madrid, Spain, Sep. 2009.

[26]

R. Aparicio-Pardo, P. Pavon-Marino, N. Skorin-Kapov, B. Garcia-Manrubia, and J. Garcia-Haro, "Algorithms for virtual topology reconfiguration under multi-hour traffic," in Proc. 12th ICTON, Munich, Germany, Jun. 2010, p. We.B1.2.

[27]

G. Oriolo, "Domination between traffic matrices," Math. Oper. Res., vol. 33, no. 1, pp. 91-96, Feb. 2008.

[28]

R. K. Ahuja, T. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ: Prentice-Hall, 1993, pp. 4-8.

[29]

P. Pavon-Marino, R. Aparicio-Pardo, G. Moreno-Muñoz, J. Garcia-Haro, and J. Veiga-Gontan, "MatPlan WDM: An educational tool for network planning in wavelength-routing networks," in Proc. IFIP Int. Conf. Opt. Netw. Design Model., Athens, Greece, 2007, pp. 58-67.

[30]

TOMLAB Optimization, "TOMLAB Optimization," 2011 {Online}. Available: http://tomopt.com/

[31]

J. Milbrandt, M. Menth, and S. Kopf, "Adaptive bandwidth allocation: Impact of traffic demand models for wide area networks," in Proc. 19th ITC, Beijing, China, 2005.

[32]

D. Medhi, "Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks," IEEE/ACM Trans. Netw., vol. 3, no. 6, pp. 809-818, Dec. 1995.

Cited By

Agrawal GMedhi D(2016)Embedding IP unique shortest path topology on a wavelength-routed networkIEEE/ACM Transactions on Networking10.5555/3001647.300168124:2(1109-1124)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.5555/3001647.3001681
Hanay YArakawa SMurata M(2015)Network topology selection with multistate neural memoriesExpert Systems with Applications: An International Journal10.1016/j.eswa.2014.12.00542:6(3219-3226)Online publication date: 15-Apr-2015
https://dl.acm.org/doi/10.1016/j.eswa.2014.12.005

Index Terms

(Non-)reconfigurable virtual topology design under multihour traffic in optical networks
1. Hardware
  1. Communication hardware, interfaces and storage
2. Networks
  1. Network properties
    1. Network structure
      1. Network topology types
        Ring networks
        Fiber distributed data interface (FDDI)

Recommendations

Virtual topology reconfiguration on optical WDM networks considering traffic grooming

This paper investigates the virtual topology reconfiguration (VTR) problem of optical WDM networks by taking the traffic grooming factor into consideration. Firstly, by applying a common ''divide and conquer'' approach, the problem is categorized and ...
Virtual topology reconfiguration for mixed-line-rate optical WDM networks under dynamic traffic

For the mixed-line-rate (MLR) wavelength-division multiplexing (WDM) networks, each wavelength in a fiber can provide different transmitting rates (in 10/40/100 Gbps) by using different modulation formats. Since the MLR-WDM becomes a cost-efficient ...
A scalable approach for survivable virtual topology routing in optical WDM networks
Part Supplement

The survivable virtual topology routing problem is to route a virtual topology graph on a optical fiber physical topology such that the virtual topology remains connected when failures occur in the physical topology. In this work we study the problem of ...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 20, Issue 5

October 2012

345 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 October 2012

Accepted: 22 December 2011

Revised: 13 May 2011

Received: 19 March 2010

Published in TON Volume 20, Issue 5

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
101
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Agrawal GMedhi D(2016)Embedding IP unique shortest path topology on a wavelength-routed networkIEEE/ACM Transactions on Networking10.5555/3001647.300168124:2(1109-1124)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.5555/3001647.3001681
Hanay YArakawa SMurata M(2015)Network topology selection with multistate neural memoriesExpert Systems with Applications: An International Journal10.1016/j.eswa.2014.12.00542:6(3219-3226)Online publication date: 15-Apr-2015
https://dl.acm.org/doi/10.1016/j.eswa.2014.12.005

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents