Abstract

In this paper, we present the first open-source path computation element (PCE) emulator along with its key design and implementation features. The PCE is a network control and management entity that can be utilized to perform optimal path computations with multiple constraints in carrier-grade transport networks. The presented architecture incorporates all elements of the standardized PCE framework and is scalable in the number of requests and size of topologies served as well as path computation algorithm complexity. Given the diversity in current control and management practices of carrier-grade transport networks, we also identify key features that are necessary for innovation within the PCE framework, including flexible topology description and update mechanisms, extensible protocol and state machine definitions, and fully programmable path computation. We incorporate all these features in our design and implementation. This work bridges an important gap between network engineering, software system design, and algorithmic studies and shows that deploying a PCE system as such is not only feasible but also well performing in a range of network scenarios from IP/multiprotocol label switching to wavelength-division multiplexing networks.

© 2011 IEEE

PDF Article

References

  • View by:
  • |
  • |

  1. A. Farrel, J. P. Vasseur, J. Ash, “A path computation element-based architecture,” IETF RFC 4655 (2006) http://tools.ietf.org/rfc/rfc4655.txt.
  2. J. P. Vasseur, J. L. Le Roux, “Path computation element communication protocol,” IETF RFC 5440 (2009) http://tools.ietf.org/rfc/rfc5440.txt.
  3. “Scalable Optical Transport, Data Sheet,” RAYControl (2010) http://www.advaoptical.com/~/media/Resources/Data%20Sheets/RAYcontrol.ashx?.pdf.
  4. “Marben PCE, The Advanced Implementation of the IETF PCE protocol.” http://www.marben-products.com/gmpls/PCE-DSH.pdf.
  5. Multi-Technology Operations System Interface (MTOSI) Release 2.0 Tele Management Forum Standard (2007) http://www.tmforum.org/MTOSIRelease20/6076/home.html.
  6. M. Chamania, M. Drogon, A. Jukan, "Lessons learned from implementing a path computation element (PCE) emulator," Tech. Digest Opt. Fiber Commun. Conf. Los AngelesCA (2011) (Postdeadline paper).
  7. E. Mannie, “Generalized multi-protocol label switching (GMPLS) architecture,” IETF RFC 3945 (2004) http://tools.ietf.org/rfc/rfc3945.txt.
  8. R. Braden, L. Zhang, S. Berson, S. Herzog, S. Jamin, Resource reservation protocol (RSVP),” IETF RFC 2205 (1997) http://tools.ietf.org/rfc/rfc2205.txt.
  9. E. Oki, T. Takeda, J. L. Le Roux, A. Farrel, “Framework for PCE-Based inter-layer MPLS and GMPLS traffic engineering,” IETF RFC 5623 (2009) http://tools.ietf.org/rfc/rfc5623.txt.
  10. J. P. Vasseur, R. Zhang, N. Bitar, JL. le Roux, “A backward-recursive PCE-based computation (BRPC) procedure to compute shortest constrained inter-domain traffic engineering label switched paths,” IETF RFC 5441 (2009) http://tools.ietf.org/rfc/rfc5441.txt.
  11. IETF PCE working group http://datatracker.ietf.org/wg/pce/charter/.
  12. I. Bryskin, D. Papadimitriou, L. Berger, J. Ash, “Policy-enabled path computation framework,” IETF RFC 5394 (2008) http://datatracker.ietf.org/doc/rfc5394/.
  13. J. P. Vasseur, JL. le Roux, Y. Ikejiri, “A set of monitoring tools for path computation element (PCE)-based architecture,” IETF RFC 5886 (2010) http://tools.ietf.org/rfc/rfc5886.txt.
  14. Q. Zhao, D. King, F. Verhaeghe, T. Takeda, Z. Ali, J. Meuric, “Extensions to the path computation element communication protocol (PCEP) for point-to-multipoint traffic engineering label switched paths,” IETF RFC 6006 (2010) http://tools.ietf.org/rfc/rfc6006.txt.
  15. Q. Zhao, Z. Ali, T. Saad, S. Sivabalan, D. King, R. Casellas, “PCE-based computation procedure to compute shortest constrained P2MP inter-domain traffic engineering label switched paths,” IETF Internet Draft (2011) http://tools.ietf.org/id/draft-zhao-pce-pcep-inter-domain-p2mp-procedures-07.txt/.
  16. I. Nishioka, D. King, “Use of the synchronization vector (SVEC) list for synchronized dependent path computations,” IETF RFC 6007 (2010) http://tools.ietf.org/rfc/rfc6007.txt.
  17. Y. Lee, G. Bernstein, J. Martensson, T. Takeda, T. Otani, “PCEP requirements for WSON routing and wavelength assignment,” IETF Internet Draft (2011) http://datatracker.ietf.org/doc/draft-ietf-pce-wson-routing-wavelength/.
  18. A. Heffernan, “Protection of BGP sessions via the TCP MD5 signature option,” IETF RFC 2385 (1998) http://tools.ietf.org/rfc/rfc2385.txt.
  19. J. Touch, A. Mankin, R. Bonica, “The TCP authentication option,” IETF RFC 5925 (2010) http://tools.ietf.org/rfc/rfc5925.txt.
  20. S. G. Polito, S. Zaghloul, M. Chamania, A. Jukan, "Inter-domain path provisioning with security features: Architecture and signaling performance," IEEE Trans. Netw. Serv. Manage. 8, 219-233 (2011) .
  21. “CTTC PCE,” (2010) http://wikiona.cttc.es/ona/index.php/Path_Computation_Element_(PCE).
  22. “OSCARS inter-domain controller application programmer interface.” http://code.google.com/p/oscars-idc/.
  23. “Java network I/O (NIO).” http://download.oracle.com/javase/1.4.2/docs/api/java/nio/package-summary.html.
  24. Rocks cluster, open source linux cluster http://www.rocksclusters.org/wordpress/.
  25. “SNDLib: survivable fixed telecommunication network design,” (2006.) http://sndlib.zib.de/home.action.
  26. “BRITE: Boston university representative internet topology generator.” http://www.cs.bu.edu/brite/.
  27. R. Guerin, A. Orda, D. Williams, "QoS routing mechanisms and OSPF extensions," Proc. Global Telecommun. Conf. (1997) pp. 1903-1908.
  28. J. Suurballe, Disjoint paths in a network 14, 125-145 (1974) Networks.
  29. “Gurobi Optimizer 3.0.” http://www.gurobi.com/.
  30. R. Muoz, R. Casellas, R. Martinez, M. Tornatore, A. Pattavina, "An experimental study on the effects of outdated control information in GMPLS-controlled WSON for shared path protection," Proc. 15th Int. Conf. Opt. Netw. Design Modeling (2011) pp. 1-6.
  31. “Open source path computation element emulator,” (2011.) http://pce.ida-cns-group.net/.
  32. “EU Project ONE,” (2010.) http://www.ict-one.eu.
  33. “EU Project GEYSERS,” (2009.) http://www.geysers.eu.

2011 (1)

S. G. Polito, S. Zaghloul, M. Chamania, A. Jukan, "Inter-domain path provisioning with security features: Architecture and signaling performance," IEEE Trans. Netw. Serv. Manage. 8, 219-233 (2011) .

1974 (1)

J. Suurballe, Disjoint paths in a network 14, 125-145 (1974) Networks.

Disjoint paths in a network (1)

J. Suurballe, Disjoint paths in a network 14, 125-145 (1974) Networks.

IEEE Trans. Netw. Serv. Manage. (1)

S. G. Polito, S. Zaghloul, M. Chamania, A. Jukan, "Inter-domain path provisioning with security features: Architecture and signaling performance," IEEE Trans. Netw. Serv. Manage. 8, 219-233 (2011) .

Other (31)

“CTTC PCE,” (2010) http://wikiona.cttc.es/ona/index.php/Path_Computation_Element_(PCE).

“OSCARS inter-domain controller application programmer interface.” http://code.google.com/p/oscars-idc/.

“Java network I/O (NIO).” http://download.oracle.com/javase/1.4.2/docs/api/java/nio/package-summary.html.

Rocks cluster, open source linux cluster http://www.rocksclusters.org/wordpress/.

“SNDLib: survivable fixed telecommunication network design,” (2006.) http://sndlib.zib.de/home.action.

“BRITE: Boston university representative internet topology generator.” http://www.cs.bu.edu/brite/.

R. Guerin, A. Orda, D. Williams, "QoS routing mechanisms and OSPF extensions," Proc. Global Telecommun. Conf. (1997) pp. 1903-1908.

“Gurobi Optimizer 3.0.” http://www.gurobi.com/.

R. Muoz, R. Casellas, R. Martinez, M. Tornatore, A. Pattavina, "An experimental study on the effects of outdated control information in GMPLS-controlled WSON for shared path protection," Proc. 15th Int. Conf. Opt. Netw. Design Modeling (2011) pp. 1-6.

“Open source path computation element emulator,” (2011.) http://pce.ida-cns-group.net/.

“EU Project ONE,” (2010.) http://www.ict-one.eu.

“EU Project GEYSERS,” (2009.) http://www.geysers.eu.

A. Farrel, J. P. Vasseur, J. Ash, “A path computation element-based architecture,” IETF RFC 4655 (2006) http://tools.ietf.org/rfc/rfc4655.txt.

J. P. Vasseur, J. L. Le Roux, “Path computation element communication protocol,” IETF RFC 5440 (2009) http://tools.ietf.org/rfc/rfc5440.txt.

“Scalable Optical Transport, Data Sheet,” RAYControl (2010) http://www.advaoptical.com/~/media/Resources/Data%20Sheets/RAYcontrol.ashx?.pdf.

“Marben PCE, The Advanced Implementation of the IETF PCE protocol.” http://www.marben-products.com/gmpls/PCE-DSH.pdf.

Multi-Technology Operations System Interface (MTOSI) Release 2.0 Tele Management Forum Standard (2007) http://www.tmforum.org/MTOSIRelease20/6076/home.html.

M. Chamania, M. Drogon, A. Jukan, "Lessons learned from implementing a path computation element (PCE) emulator," Tech. Digest Opt. Fiber Commun. Conf. Los AngelesCA (2011) (Postdeadline paper).

E. Mannie, “Generalized multi-protocol label switching (GMPLS) architecture,” IETF RFC 3945 (2004) http://tools.ietf.org/rfc/rfc3945.txt.

R. Braden, L. Zhang, S. Berson, S. Herzog, S. Jamin, Resource reservation protocol (RSVP),” IETF RFC 2205 (1997) http://tools.ietf.org/rfc/rfc2205.txt.

E. Oki, T. Takeda, J. L. Le Roux, A. Farrel, “Framework for PCE-Based inter-layer MPLS and GMPLS traffic engineering,” IETF RFC 5623 (2009) http://tools.ietf.org/rfc/rfc5623.txt.

J. P. Vasseur, R. Zhang, N. Bitar, JL. le Roux, “A backward-recursive PCE-based computation (BRPC) procedure to compute shortest constrained inter-domain traffic engineering label switched paths,” IETF RFC 5441 (2009) http://tools.ietf.org/rfc/rfc5441.txt.

IETF PCE working group http://datatracker.ietf.org/wg/pce/charter/.

I. Bryskin, D. Papadimitriou, L. Berger, J. Ash, “Policy-enabled path computation framework,” IETF RFC 5394 (2008) http://datatracker.ietf.org/doc/rfc5394/.

J. P. Vasseur, JL. le Roux, Y. Ikejiri, “A set of monitoring tools for path computation element (PCE)-based architecture,” IETF RFC 5886 (2010) http://tools.ietf.org/rfc/rfc5886.txt.

Q. Zhao, D. King, F. Verhaeghe, T. Takeda, Z. Ali, J. Meuric, “Extensions to the path computation element communication protocol (PCEP) for point-to-multipoint traffic engineering label switched paths,” IETF RFC 6006 (2010) http://tools.ietf.org/rfc/rfc6006.txt.

Q. Zhao, Z. Ali, T. Saad, S. Sivabalan, D. King, R. Casellas, “PCE-based computation procedure to compute shortest constrained P2MP inter-domain traffic engineering label switched paths,” IETF Internet Draft (2011) http://tools.ietf.org/id/draft-zhao-pce-pcep-inter-domain-p2mp-procedures-07.txt/.

I. Nishioka, D. King, “Use of the synchronization vector (SVEC) list for synchronized dependent path computations,” IETF RFC 6007 (2010) http://tools.ietf.org/rfc/rfc6007.txt.

Y. Lee, G. Bernstein, J. Martensson, T. Takeda, T. Otani, “PCEP requirements for WSON routing and wavelength assignment,” IETF Internet Draft (2011) http://datatracker.ietf.org/doc/draft-ietf-pce-wson-routing-wavelength/.

A. Heffernan, “Protection of BGP sessions via the TCP MD5 signature option,” IETF RFC 2385 (1998) http://tools.ietf.org/rfc/rfc2385.txt.

J. Touch, A. Mankin, R. Bonica, “The TCP authentication option,” IETF RFC 5925 (2010) http://tools.ietf.org/rfc/rfc5925.txt.

Cited By

OSA participates in CrossRef's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.