File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Time-efficient algorithms for BGP route configuration

TitleTime-efficient algorithms for BGP route configuration
Authors
KeywordsBGP
Egress Selection
OSPF Weight Assignment
Issue Date2004
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
Ieee International Conference On Communications, 2004, v. 2, p. 1197-1201 How to Cite?
AbstractBased on the concept of most popular prefix first, two efficient algorithms for BGP route configuration are proposed. The first algorithm MPPF_SES is designed for solving the single egress selection (SES) problem, and the second algorithm MPPF_MES is for multiple egress selection (MES). MPPF_MES has two variants, one aims at minimizing the total amount of resources consumed for carrying the transit traffic, and the other tries to minimize the egress link capacity required. Compared with the existing algorithms, a comparable performance in terms of network resources consumed can be obtained. In case of SES, our MPPF_SES can carry a given traffic load with much lower egress link capacity requirement. In case of MES, our MPPF_MES tends to provide a more stable performance. Last but not the least, our proposed algorithms have a much lower time complexity than the existing approach.
Persistent Identifierhttp://hdl.handle.net/10722/46456
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChim, TWen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2007-10-30T06:50:15Z-
dc.date.available2007-10-30T06:50:15Z-
dc.date.issued2004en_HK
dc.identifier.citationIeee International Conference On Communications, 2004, v. 2, p. 1197-1201en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46456-
dc.description.abstractBased on the concept of most popular prefix first, two efficient algorithms for BGP route configuration are proposed. The first algorithm MPPF_SES is designed for solving the single egress selection (SES) problem, and the second algorithm MPPF_MES is for multiple egress selection (MES). MPPF_MES has two variants, one aims at minimizing the total amount of resources consumed for carrying the transit traffic, and the other tries to minimize the egress link capacity required. Compared with the existing algorithms, a comparable performance in terms of network resources consumed can be obtained. In case of SES, our MPPF_SES can carry a given traffic load with much lower egress link capacity requirement. In case of MES, our MPPF_MES tends to provide a more stable performance. Last but not the least, our proposed algorithms have a much lower time complexity than the existing approach.en_HK
dc.format.extent380421 bytes-
dc.format.extent519608 bytes-
dc.format.extent8014 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104en_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.rights©2004 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.subjectEgress Selectionen_HK
dc.subjectOSPF Weight Assignmenten_HK
dc.titleTime-efficient algorithms for BGP route configurationen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=2&spage=1197&epage=1201&date=2004&atitle=Time-efficient+Algorithms+for+BGP+Route+Configurationen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.scopuseid_2-s2.0-4143061600en_HK
dc.identifier.hkuros90909-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-4143061600&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2en_HK
dc.identifier.spage1197en_HK
dc.identifier.epage1201en_HK
dc.identifier.scopusauthoridChim, TW=6507501073en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats