Abstract
A network flow decomposition algorithm is proposed to achieve a lower block probability. The algorithm is designed to achieve a flow balance between domains, advertising TE information that is necessary for network to build a TED (Traffic Engineer Database) to calculate a suitable route for each service request for network optimization.
© 2009 OSA, IEEE Photonics Society, SPIE, COS, CIC
PDF ArticleMore Like This
Kohei Shimada, Soichiro Araki, Hiroshi Hasegawa, and Ken-ichi Sato
FG3 Asia Communications and Photonics Conference and Exhibition (ACP) 2009
Kai-hua Suo, Ming-lei Fu, and Zi-chun Le
83101K Asia Communications and Photonics Conference and Exhibition (ACP) 2011
Xiaolan J. Zhang, Sun-il Kim, and Steven S. Lumetta
OWL4 Optical Fiber Communication Conference (OFC) 2009