View : 568 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author이미정*
dc.date.accessioned2018-06-02T08:14:17Z-
dc.date.available2018-06-02T08:14:17Z-
dc.date.issued2003*
dc.identifier.issn0302-9743*
dc.identifier.otherOAK-17630*
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/244068-
dc.description.abstractExploiting the efficient explicit routing capability of MPLS, we propose a dynamic multipath traffic engineering mechanism named LDM(Load Distribution over Multipath). The main goal of LDM is to enhance the network utilization as well as the network performance by adaptively splitting traffic load among multiple paths. LDM makes decisions at the flow level, and distribute traffic based on both the length and the load of a path. LDM also dynamically selects a number of good Label Switched Paths (LSPs) for traffic delivery according to the state of the entire network. We use simulation to compare the performance of LDM with the performance of several representative dynamic load distribution approaches as well as the traditional static shortest path only routing. The numerical results show that LDM outperforms the compared approaches in both the blocking ratio as well as the performance of the accepted traffic flows. © Springer-Verlag Berlin Heidelberg 2003.*
dc.languageEnglish*
dc.titleDynamic load distribution in MPLS networks*
dc.typeArticle*
dc.relation.volume2662*
dc.relation.indexSCOPUS*
dc.relation.startpage989*
dc.relation.lastpage999*
dc.relation.journaltitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*
dc.identifier.scopusid2-s2.0-33645586342*
dc.author.googleSong J.*
dc.author.googleKim S.*
dc.author.googleLee M.*
dc.contributor.scopusid이미정(7409118870)*
dc.date.modifydate20240322133142*
Appears in Collections:
인공지능대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE