메뉴 건너뛰기




Volumn 1, Issue , 2003, Pages 576-586

MPLS over WDM network design with packet level QoS constraints based on ILP models

Author keywords

ILP models; MPLS over WDM; Network design planning

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; NETWORK PROTOCOLS; PACKET NETWORKS; QUALITY OF SERVICE; WAVELENGTH DIVISION MULTIPLEXING; BRANCH AND BOUND METHOD; DESIGN; ELECTRIC NETWORK TOPOLOGY; FIBER OPTIC NETWORKS; LIGHT TRANSMISSION; NETWORK LAYERS; PACKET SWITCHING; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

EID: 0042474488     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (59)

References (20)
  • 2
    • 0003187047 scopus 로고    scopus 로고
    • Multiprotocol label switching
    • Special issue on, December
    • Special issue on "Multiprotocol Label Switching", IEEE Communications Magazine, vol. 37, December 1999, pp. 36-68.
    • (1999) IEEE Communications Magazine , vol.37 , pp. 36-68
  • 3
    • 0028407068 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The multiple node Case
    • April
    • A. Parekh and R. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case", IEEE/ACM Transactions on Networking, vol. 2, April 1994, pp. 137-150.
    • (1994) IEEE/ACM Transactions on Networking , vol.2 , pp. 137-150
    • Parekh, A.1    Gallager, R.2
  • 6
    • 0034296173 scopus 로고    scopus 로고
    • Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and reconfiguration study
    • October
    • D. Banerjee and B. Mukherjee, "Wavelength-routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and Reconfiguration Study", IEEE/ACM Transactions on Networking, vol. 8, October 2000, pp. 598-607.
    • (2000) IEEE/ACM Transactions on Networking , vol.8 , pp. 598-607
    • Banerjee, D.1    Mukherjee, B.2
  • 7
    • 0035015951 scopus 로고    scopus 로고
    • Integrated dynamic IP and wavelength routing in IP over WDM networks
    • April
    • M. Kodialam and T.V. Lakshman, "Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks", Proceedings of IEEE INFOCOM2001, April 2001.
    • (2001) Proceedings of IEEE INFOCOM2001
    • Kodialam, M.1    Lakshman, T.V.2
  • 9
    • 0026839532 scopus 로고
    • Using a hop-constrained model to generate alternative communication network design
    • A. Balakrishnan, and K. Altinkemer, "Using a Hop-Constrained Model to Generate Alternative Communication Network Design", ORSA Journal on Computing, vol. 4,1992, pp. 192 - 205.
    • (1992) ORSA Journal on Computing , vol.4 , pp. 192-205
    • Balakrishnan, A.1    Altinkemer, K.2
  • 10
    • 0001258594 scopus 로고
    • Modeling and solving the two-facility capacitated network loading problem
    • T. Magnanti, P. Mirchandani and R. Vachani, "Modeling and Solving the Two-Facility Capacitated Network Loading Problem", Operations Research, vol 43, 1995, pp 142 - 157.
    • (1995) Operations Research , vol.43 , pp. 142-157
    • Magnanti, T.1    Mirchandani, P.2    Vachani, R.3
  • 11
    • 0029533861 scopus 로고
    • The hop-limit approach for spare-capacity assignment in survivable networks
    • December
    • M. Herzberg, S. Bye and A. Utano, "The Hop-Limit Approach for Spare-Capacity Assignment in Survivable Networks", IEEE/ACM Transactions on Networking, vol. 3, December 1995, pp 775-784.
    • (1995) IEEE/ACM Transactions on Networking , vol.3 , pp. 775-784
    • Herzberg, M.1    Bye, S.2    Utano, A.3
  • 12
    • 0001276437 scopus 로고    scopus 로고
    • Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints
    • L. Gouveia, "Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints", INFORMS Journal on Computing, vol. 10, 1998, pp. 180-188.
    • (1998) INFORMS Journal on Computing , vol.10 , pp. 180-188
    • Gouveia, L.1
  • 13
    • 0012590682 scopus 로고    scopus 로고
    • Packet routing in telecommunications network with path and flow restrictions
    • L. LeBlanc, J. Chifflet and P. Mahey, "Packet Routing in Telecommunications Network with Path and Flow Restrictions", INFORMS Journal on Computing, vol. 11, 1999, pp 188-197.
    • (1999) INFORMS Journal on Computing , vol.11 , pp. 188-197
    • LeBlanc, L.1    Chifflet, J.2    Mahey, P.3
  • 16
    • 0035184607 scopus 로고    scopus 로고
    • Heuristics for dimensioning largescale MPLS networks
    • Internet Performance and Control of Network Systems II, Robert D. van der Mei, Frank Huebner-Szabo de Bues, Editors
    • C. Lopes, A. de Sousa, R. Valadas, "Heuristics for Dimensioning Largescale MPLS Networks", in Internet Performance and Control of Network Systems II, Robert D. van der Mei, Frank Huebner-Szabo de Bues, Editors, Proceedings of SPIE Vol. 4523, 2001.
    • (2001) Proceedings of SPIE , vol.4523
    • Lopes, C.1    De Sousa, A.2    Valadas, R.3
  • 18
    • 84855530844 scopus 로고    scopus 로고
    • Network flow models for designing diameter constrained spanning and steiner trees
    • Centra de Investigac̃āo Operacional, University of Lisbon, W.P. 5/2000,2000 (to appear in Networks)
    • L. Gouveia and T. Magnanti, "Network Flow Models for Designing Diameter Constrained Spanning and Steiner Trees", Technical Report, Centra de Investigac̃āo Operacional, University of Lisbon, W.P. 5/2000,2000 (to appear in Networks).
    • Technical Report
    • Gouveia, L.1    Magnanti, T.2
  • 19
    • 0042596061 scopus 로고    scopus 로고
    • On formulations of the hop-constrained minimum spanning tree problem
    • Centra de Investigac̃āo Operacional, University of Lisbon, W.P. 2/2000
    • G. Dahl and L. Gouveia, "On Formulations of the Hop-Constrained Minimum Spanning Tree Problem", Technical Report, Centra de Investigac̃āo Operacional, University of Lisbon, W.P. 2/2000, 2000.
    • (2000) Technical Report
    • Dahl, G.1    Gouveia, L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.