File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: BGP ingress-to-egress route configuration in a capacity-constrained AS

TitleBGP ingress-to-egress route configuration in a capacity-constrained AS
Authors
KeywordsBGP
Border router advertisements
Most popular prefix first
Issue Date2005
PublisherIEEE.
Citation
2005 Asia-Pacific Conference On Communications, 2005, v. 2005, p. 386-390 How to Cite?
AbstractThe BGP ingress-to-egress route configuration problem is to find a set of paths in an ISP to carry the transit flows, such that the amount of network resources consumed is minimized without violating the bandwidth constraint on all network links. To solve the problem, we first formulate it using Integer Linear Programming (ILP). Due to the high complexity involved in ILP, a heuristic algorithm, called MPPF, is then proposed. MPPF is designed based on the idea that heavily-loaded destination prefixes should be given higher priority to select less expensive edge links and routes. Simulation results show that MPPF requires less network resources and edge link capacity than an alternative heuristic called BTF. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/57271
References

 

DC FieldValueLanguage
dc.contributor.authorChim, TWen_HK
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorLui, KSen_HK
dc.date.accessioned2010-04-12T01:31:28Z-
dc.date.available2010-04-12T01:31:28Z-
dc.date.issued2005en_HK
dc.identifier.citation2005 Asia-Pacific Conference On Communications, 2005, v. 2005, p. 386-390en_HK
dc.identifier.urihttp://hdl.handle.net/10722/57271-
dc.description.abstractThe BGP ingress-to-egress route configuration problem is to find a set of paths in an ISP to carry the transit flows, such that the amount of network resources consumed is minimized without violating the bandwidth constraint on all network links. To solve the problem, we first formulate it using Integer Linear Programming (ILP). Due to the high complexity involved in ILP, a heuristic algorithm, called MPPF, is then proposed. MPPF is designed based on the idea that heavily-loaded destination prefixes should be given higher priority to select less expensive edge links and routes. Simulation results show that MPPF requires less network resources and edge link capacity than an alternative heuristic called BTF. © 2005 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartof2005 Asia-Pacific Conference on Communicationsen_HK
dc.rights©2005 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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectBGPen_HK
dc.subjectBorder router advertisementsen_HK
dc.subjectMost popular prefix firsten_HK
dc.titleBGP ingress-to-egress route configuration in a capacity-constrained ASen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.emailLui, KS:kslui@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.identifier.authorityLui, KS=rp00188en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/APCC.2005.1554086en_HK
dc.identifier.scopuseid_2-s2.0-33845295831en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33845295831&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2005en_HK
dc.identifier.spage386en_HK
dc.identifier.epage390en_HK
dc.identifier.scopusauthoridChim, TW=6507501073en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats