File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Joint virtual path routing and capacity design for ATM networks

TitleJoint virtual path routing and capacity design for ATM networks
Authors
KeywordsAtm Networks
Capacity Design
Routing
Issue Date1996
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcom
Citation
Computer Communications, 1996, v. 19 n. 13, p. 1029-1035 How to Cite?
AbstractIn addition to simplifying nodal processing and network architecture, a good virtual path layout/capacity design reduces network system costs and improves overall QoS (Quality of Service) manageability and system utilization. A shortest-path based layout scheme and a virtual path capacity allocation scheme are proposed in this paper. For ease of implementation, we adopt a deterministic Virtual Path (VP) capacity assignment scheme. Each VP contains multiple Virtual Channels (VCs). The bandwidth assigned to each VC affects both the VC's QoS and the remaining capacity in the corresponding VP. We have recently proposed a novel bandwidth allocation scheme, in which bandwidth assignments are made based on a bandwidth queue model, to maximize the network utilization and user satisfaction. In this paper, this bandwidth queue model is used to quantify VP costs and a constrained non-linear optimization problem with VP capacities as decision variables is formulated. Since Switched Virtual Connection (SVC) traffic may be routed through different VPs, and hence affect the optimal VP capacity design, SVC routing parameters are also included as decision variables and determined together with the VP capacities.
Persistent Identifierhttp://hdl.handle.net/10722/155043
ISSN
2015 Impact Factor: 2.099
2015 SCImago Journal Rankings: 0.889
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorYang, TSGen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2012-08-08T08:31:38Z-
dc.date.available2012-08-08T08:31:38Z-
dc.date.issued1996en_US
dc.identifier.citationComputer Communications, 1996, v. 19 n. 13, p. 1029-1035en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://hdl.handle.net/10722/155043-
dc.description.abstractIn addition to simplifying nodal processing and network architecture, a good virtual path layout/capacity design reduces network system costs and improves overall QoS (Quality of Service) manageability and system utilization. A shortest-path based layout scheme and a virtual path capacity allocation scheme are proposed in this paper. For ease of implementation, we adopt a deterministic Virtual Path (VP) capacity assignment scheme. Each VP contains multiple Virtual Channels (VCs). The bandwidth assigned to each VC affects both the VC's QoS and the remaining capacity in the corresponding VP. We have recently proposed a novel bandwidth allocation scheme, in which bandwidth assignments are made based on a bandwidth queue model, to maximize the network utilization and user satisfaction. In this paper, this bandwidth queue model is used to quantify VP costs and a constrained non-linear optimization problem with VP capacities as decision variables is formulated. Since Switched Virtual Connection (SVC) traffic may be routed through different VPs, and hence affect the optimal VP capacity design, SVC routing parameters are also included as decision variables and determined together with the VP capacities.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcomen_US
dc.relation.ispartofComputer Communicationsen_US
dc.subjectAtm Networksen_US
dc.subjectCapacity Designen_US
dc.subjectRoutingen_US
dc.titleJoint virtual path routing and capacity design for ATM networksen_US
dc.typeArticleen_US
dc.identifier.emailLi, VOK:vli@eee.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/S0140-3664(97)84933-Xen_US
dc.identifier.scopuseid_2-s2.0-0030286745en_US
dc.identifier.hkuros27308-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0030286745&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume19en_US
dc.identifier.issue13en_US
dc.identifier.spage1029en_US
dc.identifier.epage1035en_US
dc.identifier.isiWOS:A1996WB09800002-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridYang, TSG=7404656632en_US
dc.identifier.scopusauthoridLi, VOK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats