-
1
-
-
0031628329
-
Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restoration
-
98, 1, pp, Jun
-
W. D. Grover and D. Stamatelakis, "Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration," IEEE ICC '98, vol. 1, pp. 537-543, Jun. 1998.
-
(1998)
IEEE ICC
, pp. 537-543
-
-
Grover, W.D.1
Stamatelakis, D.2
-
2
-
-
27844507544
-
A matrix-based analytical approach to connection unavailability estimation in shared backup path protection
-
Sept
-
D. A. A. Mello, D. A. Schupke and H. Waldman, "A matrix-based analytical approach to connection unavailability estimation in shared backup path protection," IEEE Communications Letters, vol. 9, no. 9, pp. 844-846, Sept. 2005.
-
(2005)
IEEE Communications Letters
, vol.9
, Issue.9
, pp. 844-846
-
-
Mello, D.A.A.1
Schupke, D.A.2
Waldman, H.3
-
3
-
-
33846644449
-
Traffic grooming in WDM/SONET BLSR rings with multiple line speeds
-
Dec
-
Huan Liu and F. A. Tobagi, "Traffic grooming in WDM/SONET BLSR rings with multiple line speeds," IEEE GLOBECOM '05, vol. 4, pp. 2096-2101, Dec. 2005.
-
(2005)
IEEE GLOBECOM '05
, vol.4
, pp. 2096-2101
-
-
Liu, H.1
Tobagi, F.A.2
-
4
-
-
84948755425
-
Advances in optical network design with p-cycles: Joint optimization and pre-selection of candidate p-cycles
-
Jul
-
W. D. Grover and J. Doucette, "Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles," in Proc. IEEE LEOS Summer Topicals, pp. 49-50, Jul. 2002.
-
(2002)
Proc. IEEE LEOS Summer Topicals
, pp. 49-50
-
-
Grover, W.D.1
Doucette, J.2
-
5
-
-
0036286449
-
Optimal configuration of p-cycles in WDM network
-
May
-
D. A. Schupke, C. G. Gruber and A. Autenrieth, "Optimal configuration of p-cycles in WDM network," IEEE ICC '02, vol. 5, pp. 2761-2765, May 2002.
-
(2002)
IEEE ICC '02
, vol.5
, pp. 2761-2765
-
-
Schupke, D.A.1
Gruber, C.G.2
Autenrieth, A.3
-
6
-
-
27844501604
-
Failure-independent path-protecting p-cycles: Efficient and simple fully preconnected optical-path protection
-
Oct
-
A. Kodian and W. D. Grover, "Failure-independent path-protecting p-cycles: efficient and simple fully preconnected optical-path protection," Journal of Lightwave Technology, vol. 23, no. 10, pp. 3241-3259, Oct. 2005.
-
(2005)
Journal of Lightwave Technology
, vol.23
, Issue.10
, pp. 3241-3259
-
-
Kodian, A.1
Grover, W.D.2
-
7
-
-
0141986688
-
Extending the p-cycle concept to path segment protection for span and node failure recovery
-
Oct
-
Gangxiang Shen and W. D. Grover, "Extending the p-cycle concept to path segment protection for span and node failure recovery," IEEE Journal on Selected Areas in Communications, vol. 21, no. 8, pp. 1306-1319, Oct. 2003.
-
(2003)
IEEE Journal on Selected Areas in Communications
, vol.21
, Issue.8
, pp. 1306-1319
-
-
Shen, G.1
Grover, W.D.2
-
8
-
-
34547324254
-
Mesh-based survivable networks: Options and strategies for optical, MPLS, SONET and ATM networking
-
W. D. Grover, "Mesh-based survivable networks: options and strategies for optical, MPLS, SONET and ATM networking," Prentice-Hall PTR, 2003.
-
(2003)
Prentice-Hall PTR
-
-
Grover, W.D.1
-
10
-
-
84945972941
-
Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design
-
Oct
-
J. Doucette, D. He, W. D. Grover and O. Yang, "Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design," Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings. Fourth International Workshop on, pp. 212-220, Oct. 2003.
-
(2003)
Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings. Fourth International Workshop on
, pp. 212-220
-
-
Doucette, J.1
He, D.2
Grover, W.D.3
Yang, O.4
-
11
-
-
0036283284
-
Finding protection cycles in DWDM networks
-
May
-
H. X. Zhang and O. Yang, "Finding protection cycles in DWDM networks," IEEE ICC '02, vol. 5, pp. 2756-2760, May 2002.
-
(2002)
IEEE ICC '02
, vol.5
, pp. 2756-2760
-
-
Zhang, H.X.1
Yang, O.2
-
12
-
-
38549157778
-
A new ILP-based p-cycle construction algorithm without candidate cycle enumeration
-
Jun
-
B. Wu, K. L. Yeung, K. S. Lui and S. Z. Xu, "A new ILP-based p-cycle construction algorithm without candidate cycle enumeration," IEEE ICC '07, Jun. 2007.
-
(2007)
IEEE ICC '07
-
-
Wu, B.1
Yeung, K.L.2
Lui, K.S.3
Xu, S.Z.4
-
13
-
-
2342512216
-
Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks
-
Apr
-
A. Sack and W. D. Grover, "Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks," IEEE Network, vol. 18, no. 2, pp. 49-56, Apr. 2004.
-
(2004)
IEEE Network
, vol.18
, Issue.2
, pp. 49-56
-
-
Sack, A.1
Grover, W.D.2
-
14
-
-
0001909598
-
Finding all the elementary circuits of a directed graph
-
Mar
-
B. J. Donald, "Finding all the elementary circuits of a directed graph," SIAM J. Comput., vol. 4, no. 1, pp. 77-84, Mar. 1975.
-
(1975)
SIAM J. Comput
, vol.4
, Issue.1
, pp. 77-84
-
-
Donald, B.J.1
|