Please use this identifier to cite or link to this item:
https://dspace.iiti.ac.in/handle/123456789/4757
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chaudhari, Narendra S. | en_US |
dc.date.accessioned | 2022-03-17T01:00:00Z | - |
dc.date.accessioned | 2022-03-17T15:35:23Z | - |
dc.date.available | 2022-03-17T01:00:00Z | - |
dc.date.available | 2022-03-17T15:35:23Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Kumar Singh, R., Chaudhari, N. S., & Saxena, K. (2012). Enhanced traffic aware LSP selection method in MPLS networks. Paper presented at the IFIP International Conference on Wireless and Optical Communications Networks, WOCN, doi:10.1109/WOCN.2012.6335535 | en_US |
dc.identifier.isbn | 9781467319881 | - |
dc.identifier.issn | 2151-7681 | - |
dc.identifier.other | EID(2-s2.0-84870821712) | - |
dc.identifier.uri | https://doi.org/10.1109/WOCN.2012.6335535 | - |
dc.identifier.uri | https://dspace.iiti.ac.in/handle/123456789/4757 | - |
dc.description.abstract | One of the advanced features of Multi-Protocol Label Switching (MPLS) is traffic engineering, which is concerned with the engineering of Label Switched Paths (LSPs) onto the physical network topology so as to improve resource utilization and network performance. Selecting LSP pair i.e. both upward and downward LSP is practically beneficial, but before that we should assure that the selection does not contribute to network congestion and packet losses and at the same time it should increase the efficiency of network. In this paper we propose a new algorithm for an optimum LSP pair selection from multiple parallel LSP pairs. This algorithm minimizes the probability of request loss, network congestion and packet loss by selecting the LSP which is lightly loaded and possess upward and downward bandwidth proportional to the service request. The algorithm is simulated for analysis of number of requests rejected and found out that there is considerable gain (more than 35%) in serving the number of requests as compared to the conventional resource LSP pair allocation algorithm. © 2012 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.source | IFIP International Conference on Wireless and Optical Communications Networks, WOCN | en_US |
dc.subject | Allocation algorithm | en_US |
dc.subject | Label switched paths | en_US |
dc.subject | LSP pair | en_US |
dc.subject | MPLS | en_US |
dc.subject | MPLS network | en_US |
dc.subject | Multi protocol label switching | en_US |
dc.subject | Network congestions | en_US |
dc.subject | Physical network | en_US |
dc.subject | Resource utilizations | en_US |
dc.subject | Selection methods | en_US |
dc.subject | Service requests | en_US |
dc.subject | Traffic aware | en_US |
dc.subject | Traffic Engineering | en_US |
dc.subject | Electric network topology | en_US |
dc.subject | Network performance | en_US |
dc.subject | Optical communication | en_US |
dc.subject | Packet loss | en_US |
dc.subject | Telecommunication networks | en_US |
dc.subject | Telecommunication traffic | en_US |
dc.subject | Algorithms | en_US |
dc.title | Enhanced traffic aware LSP selection method in MPLS networks | en_US |
dc.type | Conference Paper | en_US |
Appears in Collections: | Department of Computer Science and Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Altmetric Badge: