-
1
-
-
0035280154
-
Multiprotocol Lambda switching: Combining MPLS traffic engineering control with optical crossconnects
-
3
-
Awduche D., Rekhter Y. (2001). Multiprotocol Lambda switching: Combining MPLS traffic engineering control with optical crossconnects. IEEE Communications Magazine 39(3): 111-116
-
(2001)
IEEE Communications Magazine
, vol.39
, pp. 111-116
-
-
Awduche, D.1
Rekhter, Y.2
-
2
-
-
0035441841
-
On an IP-centric optical control plane
-
9
-
Xin C., Ye Y., Wang T.S., Dixit S., Qiao C., Yoo M. (2001). On an IP-centric optical control plane. IEEE Communications Magazine 39(9): 88-93
-
(2001)
IEEE Communications Magazine
, vol.39
, pp. 88-93
-
-
Xin, C.1
Ye, Y.2
Wang, T.S.3
Dixit, S.4
Qiao, C.5
Yoo, M.6
-
3
-
-
0030170139
-
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks
-
5
-
Banerjee D., Mukherjee B. (1996). A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE Journal on Selected Areas in Communications 14(5): 903-908
-
(1996)
IEEE Journal on Selected Areas in Communications
, vol.14
, pp. 903-908
-
-
Banerjee, D.1
Mukherjee, B.2
-
4
-
-
0034858504
-
Traffic grooming and Lightpath routing in WDM ring networks with Hop-count constraints
-
Helsinki, Finland, June 2001
-
Yoon, M. G. (2001). Traffic grooming and Lightpath routing in WDM ring networks with Hop-count constraints. In Proceedings of IEEE ICC'01, Vol. 3. Helsinki, Finland, June 2001, pp. 731-737.
-
(2001)
Proceedings of IEEE ICC'01
, vol.3
, pp. 731-737
-
-
Yoon, M.G.1
-
5
-
-
0034865680
-
Traffic grooming in an optical WDM mesh network
-
Helsinki, Finland, June 2001
-
Zhu, K., & Mukherjee, B. (2001). Traffic grooming in an optical WDM mesh network. In Proceedings of IEEE ICC'01, Vol. 3. Helsinki, Finland, June 2001, pp. 721-725.
-
(2001)
Proceedings of IEEE ICC'01
, vol.3
, pp. 721-725
-
-
Zhu, K.1
Mukherjee, B.2
-
6
-
-
6944240954
-
Traffic grooming, routing and wavelength assignment in optical WDM mesh network
-
Hong Kong, PRC, March 2004
-
Hu, J. Q., & Leida, B. (2004). Traffic grooming, routing and wavelength assignment in optical WDM mesh network. In Proc. of IEEE INFOCOM'04, Vol. 1, Hong Kong, PRC, March 2004, pp. 495-501.
-
(2004)
Proc. of IEEE INFOCOM'04
, vol.1
, pp. 495-501
-
-
Hu, J.Q.1
Leida, B.2
-
7
-
-
0033882608
-
Traffic grooming for reducing electronic multiplexing costs in WDM ring networks
-
1
-
Chiu A., Modiano E. (2000). Traffic grooming for reducing electronic multiplexing costs in WDM ring networks. IEEE/OSA Journal of Lightwave Technology 18(1): 2-12
-
(2000)
IEEE/OSA Journal of Lightwave Technology
, vol.18
, pp. 2-12
-
-
Chiu, A.1
Modiano, E.2
-
9
-
-
0042474488
-
MPLS over WDM network design with packet level QoS constraints based on ILP models
-
San Francisco, CA, USA, March/April 2003
-
Gouveia, L., et al.(2003). MPLS over WDM network design with packet level QoS constraints based on ILP models. In Proceedings of IEEE INFOCOM'03, Vol. 1. San Francisco, CA, USA, March/April 2003, pp. 576-586.
-
(2003)
Proceedings of IEEE INFOCOM'03
, vol.1
, pp. 576-586
-
-
Gouveia, L.1
-
10
-
-
0034858636
-
Lightpath configuration of transparent and static WDM Networks for IP Traffic
-
Helsinki, Finland, June 2001
-
Schupke, D. A., & Sellier, D. (2001). Lightpath configuration of transparent and static WDM Networks for IP Traffic. In Proceedings of IEEE ICC'01, Vol. 2. Helsinki, Finland, June 2001, pp. 494-498.
-
(2001)
Proceedings of IEEE ICC'01
, vol.2
, pp. 494-498
-
-
Schupke, D.A.1
Sellier, D.2
-
11
-
-
9744285046
-
A Lagrangean Relaxation-based approach for routing and wavelength assignment in multigranularity optical WDM networks
-
9
-
Lee S.S.W., Yang M.C., Tien P.L., Lin S.H. (2004). A Lagrangean Relaxation-based approach for routing and wavelength assignment in multigranularity optical WDM networks. IEEE Journal on Selected Areas in Communications 22(9): 1741-1751
-
(2004)
IEEE Journal on Selected Areas in Communications
, vol.22
, pp. 1741-1751
-
-
Lee, S.S.W.1
Yang, M.C.2
Tien, P.L.3
Lin, S.H.4
-
13
-
-
0021441708
-
A quick method for finding shortest pairs of disjoint paths
-
Suurballe J.W., Tarjan R.E. (1984). A quick method for finding shortest pairs of disjoint paths. Networks 14, 325-336
-
(1984)
Networks
, vol.14
, pp. 325-336
-
-
Suurballe, J.W.1
Tarjan, R.E.2
-
14
-
-
0003515463
-
-
Prentice Hall
-
Ahuja, R. K., Magnanti, T. L., & Orli, J. B. (1993). Network flows-theory, algorithms, and applications. Prentice Hall.
-
(1993)
Network Flows-theory, Algorithms, and Applications
-
-
Ahuja, R.K.1
Magnanti, T.L.2
Orli, J.B.3
|