File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: The Optimal Virtual Path Design of ATM Networks

TitleThe Optimal Virtual Path Design of ATM Networks
Authors
KeywordsATM
Virtual Path
Issue Date1997
PublisherIEEE, Computer Society. The Journal's web site is located at http://www.ieee.org
Citation
Conference on Local Computer Networks Proceedings, Minneapolis, USA, 2-5 November 1997, p. 159-167 How to Cite?
AbstractThis paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the maximum flow density of links is proposed for the optimal virtual path configuration. The advantage of the modeling is that traffic loads are distributed evenly over entire network. An algorithm based on the multi-commodity approach is proposed to solve the problem. Examples are given to show that this algorithm solves the optimal VP assignment problem very quickly and efficiently. Since only single source-destination linear programming subproblems need to be solved in our approach, this algorithm can be applied to large-scale networks.
Persistent Identifierhttp://hdl.handle.net/10722/46041

 

DC FieldValueLanguage
dc.contributor.authorQin, Zen_HK
dc.contributor.authorLo, Ten_HK
dc.contributor.authorWu, FFen_HK
dc.date.accessioned2007-10-30T06:41:15Z-
dc.date.available2007-10-30T06:41:15Z-
dc.date.issued1997en_HK
dc.identifier.citationConference on Local Computer Networks Proceedings, Minneapolis, USA, 2-5 November 1997, p. 159-167en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46041-
dc.description.abstractThis paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the maximum flow density of links is proposed for the optimal virtual path configuration. The advantage of the modeling is that traffic loads are distributed evenly over entire network. An algorithm based on the multi-commodity approach is proposed to solve the problem. Examples are given to show that this algorithm solves the optimal VP assignment problem very quickly and efficiently. Since only single source-destination linear programming subproblems need to be solved in our approach, this algorithm can be applied to large-scale networks.en_HK
dc.format.extent704237 bytes-
dc.format.extent12538 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE, Computer Society. The Journal's web site is located at http://www.ieee.orgen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectATMen_HK
dc.subjectVirtual Pathen_HK
dc.titleThe Optimal Virtual Path Design of ATM Networksen_HK
dc.typeConference_Paperen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/LCN.1997.630979en_HK
dc.identifier.hkuros34253-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats