T. K. Nayak, K. N. Sivaranjan, “Dimensioning optical networks under traffic growth models,” IEEE/ACM Trans. Netw., vol. 11, no. 6, pp. 935–947, Dec. 2003.

[CrossRef]

T. K. Nayak, K. N. Sivaranjan, “A new approach to dimensioning optical networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 134–148, Jan. 2002.

[CrossRef]

K. Zhu, L. Sahasrabuddhe, B. Mukherjee, “Topology design and upgrade of an optical network by bottleneck-cut identification,” J. High Speed Networks, vol. 10, no. 4, pp. 293–301, Oct. 2001.

T. Leighton, S. Rao, “Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms,” J. ACM, vol. 46, no. 6, pp. 787–832, Nov. 1999.

[CrossRef]

S. Tsukiyama, I. Shirakawa, H. Ozaki, H. Ariyoshi, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. ACM, vol. 27, no. 4, pp. 619–632, Oct. 1980.

[CrossRef]

S. Tsukiyama, I. Shirakawa, H. Ozaki, H. Ariyoshi, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. ACM, vol. 27, no. 4, pp. 619–632, Oct. 1980.

[CrossRef]

W. Feller, An Introduction to Probability Theory and Its Applications. New York: Wiley, 1968.

A. Girard, R. Page, “Dimensioning of telephone networks with nonhierarchical routing and trunk reservation,” in Proc. Network Planning Symp., June 1986, pp. 85–93.

R. J. Harris, “Comparison of network dimensioning models,” in Proc. Australian Telecommunication Research, 1984, pp. 59–69.

F. P. Kelly, “Routing and capacity allocation in networks with trunk reservation,” in Proc. Mathematics of Operations Research, 1990, pp. 771–793.

J. Kleinberg, E. Tardos, Algorithm Design. Addison Wesley, 2005.

T. Leighton, S. Rao, “Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms,” J. ACM, vol. 46, no. 6, pp. 787–832, Nov. 1999.

[CrossRef]

M. Pioro, D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, 2004.

K. Zhu, L. Sahasrabuddhe, B. Mukherjee, “Topology design and upgrade of an optical network by bottleneck-cut identification,” J. High Speed Networks, vol. 10, no. 4, pp. 293–301, Oct. 2001.

B. Mukherjee, Optical WDM Networks. Springer, 2006.

T. K. Nayak, K. N. Sivaranjan, “Dimensioning optical networks under traffic growth models,” IEEE/ACM Trans. Netw., vol. 11, no. 6, pp. 935–947, Dec. 2003.

[CrossRef]

T. K. Nayak, K. N. Sivaranjan, “A new approach to dimensioning optical networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 134–148, Jan. 2002.

[CrossRef]

S. Tsukiyama, I. Shirakawa, H. Ozaki, H. Ariyoshi, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. ACM, vol. 27, no. 4, pp. 619–632, Oct. 1980.

[CrossRef]

A. Girard, R. Page, “Dimensioning of telephone networks with nonhierarchical routing and trunk reservation,” in Proc. Network Planning Symp., June 1986, pp. 85–93.

M. Pioro, D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, 2004.

M. P. Pioro, “A uniform approach to the analysis and optimization of circuit switched communication networks,” in Proc. Int. Teletraffic Congr., 1983.

T. Leighton, S. Rao, “Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms,” J. ACM, vol. 46, no. 6, pp. 787–832, Nov. 1999.

[CrossRef]

R. Roy, M. Tornatore, “Cost-efficient non-blocking WDM network upgrade,” in Optical Fiber Communication Conf. and Expo., San Diego, Mar. 2009.

K. Zhu, L. Sahasrabuddhe, B. Mukherjee, “Topology design and upgrade of an optical network by bottleneck-cut identification,” J. High Speed Networks, vol. 10, no. 4, pp. 293–301, Oct. 2001.

S. Tsukiyama, I. Shirakawa, H. Ozaki, H. Ariyoshi, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. ACM, vol. 27, no. 4, pp. 619–632, Oct. 1980.

[CrossRef]

T. K. Nayak, K. N. Sivaranjan, “Dimensioning optical networks under traffic growth models,” IEEE/ACM Trans. Netw., vol. 11, no. 6, pp. 935–947, Dec. 2003.

[CrossRef]

T. K. Nayak, K. N. Sivaranjan, “A new approach to dimensioning optical networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 134–148, Jan. 2002.

[CrossRef]

J. Kleinberg, E. Tardos, Algorithm Design. Addison Wesley, 2005.

R. Roy, M. Tornatore, “Cost-efficient non-blocking WDM network upgrade,” in Optical Fiber Communication Conf. and Expo., San Diego, Mar. 2009.

S. Tsukiyama, I. Shirakawa, H. Ozaki, H. Ariyoshi, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. ACM, vol. 27, no. 4, pp. 619–632, Oct. 1980.

[CrossRef]

K. Zhu, L. Sahasrabuddhe, B. Mukherjee, “Topology design and upgrade of an optical network by bottleneck-cut identification,” J. High Speed Networks, vol. 10, no. 4, pp. 293–301, Oct. 2001.

T. K. Nayak, K. N. Sivaranjan, “A new approach to dimensioning optical networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 134–148, Jan. 2002.

[CrossRef]

T. K. Nayak, K. N. Sivaranjan, “Dimensioning optical networks under traffic growth models,” IEEE/ACM Trans. Netw., vol. 11, no. 6, pp. 935–947, Dec. 2003.

[CrossRef]

S. Tsukiyama, I. Shirakawa, H. Ozaki, H. Ariyoshi, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. ACM, vol. 27, no. 4, pp. 619–632, Oct. 1980.

[CrossRef]

T. Leighton, S. Rao, “Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms,” J. ACM, vol. 46, no. 6, pp. 787–832, Nov. 1999.

[CrossRef]

K. Zhu, L. Sahasrabuddhe, B. Mukherjee, “Topology design and upgrade of an optical network by bottleneck-cut identification,” J. High Speed Networks, vol. 10, no. 4, pp. 293–301, Oct. 2001.

W. Feller, An Introduction to Probability Theory and Its Applications. New York: Wiley, 1968.

J. Kleinberg, E. Tardos, Algorithm Design. Addison Wesley, 2005.

B. Mukherjee, Optical WDM Networks. Springer, 2006.

A. Girard, R. Page, “Dimensioning of telephone networks with nonhierarchical routing and trunk reservation,” in Proc. Network Planning Symp., June 1986, pp. 85–93.

F. P. Kelly, “Routing and capacity allocation in networks with trunk reservation,” in Proc. Mathematics of Operations Research, 1990, pp. 771–793.

M. Pioro, D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, 2004.

M. P. Pioro, “A uniform approach to the analysis and optimization of circuit switched communication networks,” in Proc. Int. Teletraffic Congr., 1983.

R. J. Harris, “Comparison of network dimensioning models,” in Proc. Australian Telecommunication Research, 1984, pp. 59–69.

R. Roy, M. Tornatore, “Cost-efficient non-blocking WDM network upgrade,” in Optical Fiber Communication Conf. and Expo., San Diego, Mar. 2009.