Relevant bibliographies by topics / Label Switched Path (LSP)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Label Switched Path (LSP)'

Author: Grafiati
Published: 5 June 2025
Last updated: 24 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Label Switched Path (LSP).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Label Switched Path (LSP)"

1

Susueno, Hendra Bayu, Imam Tri Wibowo, Siti Ummi Masruroh, Dewi Khairani, and I’im Umamil Khoiri. "Analisis Routing Protocol Is-Is Dengan MPLS Traffic Engineering Menggunakan GNS3." Jurnal Ilmiah FIFO 13, no. 1 (2021): 32. http://dx.doi.org/10.22441/fifo.2021.v13i1.004.

Full text
Abstract:
In the digital era is , the internet becomes a necessity . the increasing number of internet usage by various parties encourages ISPs to improve their service quality . To overcome the problem the IETF has introduced a service Multiprotcol . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. TE consists of three steps principal that is the size , model, and control . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. ISIS is one of the routing protocol that was created for the OSI mode, using the method of link state as a method of collecting the route , ISIS also will perform the collection of information and the status of all the links that exist in the network . Analysis of the IS-IS routing protocol with the Multiprotocol label switch Traffic Engineering based on the parameters of quality of service (QoS), namely throughput and packet loss where the simulation uses the GNS3 network emulator. The test results prove that the values of throughput and packet loss are not much different.
APA, Harvard, Vancouver, ISO, and other styles
2

Muñoz, Raül, Ramon Casellas, Ricard Vilalta, and Ricardo Martínez. "Dynamic and Adaptive Control Plane Solutions for Flexi-grid Optical Networks based on Stateful PCE." Journal of Lightwave Technology 32, no. 16 (2016): 2703–15. https://doi.org/10.5281/zenodo.57996.

Full text
Abstract:
Adaptive flexi-grid optical networks should be able to autonomously decide where and when to dynamically setup, reoptimize, and release elastic optical connections, in reaction to network state changes. A stateful path computation element (PCE) is a key element for the introduction of dynamics and adaptation in generalized multiprotocol label switching (GMPLS)-based distributed control plane for flexi-grid DWDM networks (e.g., global concurrent reoptimization, defragmentation, or elastic inverse-multiplexing), as well as for enabling the standardized deployment of the GMPLS control plane in the software defined network control architecture. First, this paper provides an overview of passive and active stateful PCE architectures for GMPLS-enabled flexi-grid DWDM networks. A passive stateful PCE allows for improved path computation considering not only the network state (TED) but also the global connection state label switched paths database (LSPDB), in comparison with a (stateless) PCE. However, it does not have direct control (modification, rerouting) of path reservations stored in the LSPDB. The lack of control of these label switched paths (LSPs) may result in the suboptimal performance. To this end, an active stateful PCE allows for optimal path computation considering the LSPDB for the control of the state (e.g., increase of LSP bandwidth, LSP rerouting) of the stored LSPs. More recently, an active stateful PCE architecture has also been proposed that exposes the capability of setting up and releasing new LSPs. It is known as active stateful PCE with instantiation capabilities. This paper presents the first prototype implementation and experimental evaluation of an active stateful PCE with instantiation capabilities for the GMPLS-controlled flexi-grid DWDM network of the ADRENALINE testbed.
APA, Harvard, Vancouver, ISO, and other styles
3

PROF., DIPTI SONAWANE, and MANGESH T. CHAUDHARI MR. "ANALYSIS OF MECHANISMS FOR TOLERATING MULTIPLE LINK FAILURES IN MPLS NETWORK." JournalNX - A Multidisciplinary Peer Reviewed Journal 2, no. 12 (2017): 95–101. https://doi.org/10.5281/zenodo.1466877.

Full text
Abstract:
Multiprotocol Label Switching (MPLS) is switching network and provides significant benefits by fast forwarding packets. MPLS is scalable network and it is useful for end-to-end quality of service (QoS), it also enabling efficient utilization of existing network resources. In MPLS, there is no admission control for nodes and it is connection-oriented network which makes network more reliable. For MPLS network, failure can be occur at any point of time if the network link is overloading with traffic or node leave network. If the link failure occur in the MPLS network then there is need to establish a new label switched path (LSP) and then forward the packets to the newly established LSP. The forwarding of failed link traffic to different or backup path this may leads LSP get more congested. Here some mechanisms used for to tolerate these link failures in MPLS network. The main focus to analyze the various mechanisms used for tolerates the link failure in MPLS based on the Quality of Service (QoS) parameters. The expected result from this thesis, the network should maintain connectivity after multiple failures without causing congestion. https://journalnx.com/journal-article/20150156
APA, Harvard, Vancouver, ISO, and other styles
4

Arshad, M. J., H. Ahmad, M. Samiullah, and A. Basit. "ISP-BASED MPLS VPN: OVERVIEW, TRAFFIC ENGINEERING SERVICES AND SOLUTIONS." Nucleus 51, no. 1 (2014): 117–24. https://doi.org/10.71330/thenucleus.2014.728.

Full text
Abstract:
In recent years MPLS-Multiprotocol Label Switching enabled VPNs-Virtual Private Network have gained popularity as alternative to private WANs. MPLS-VPNs are more reliable, secure, scalable and cost effective than other candidate solutions. Traffic engineering (TE) is supported over MPLS, which allows network organizations to associate a LSP-Label Switched Path with the physical path they select. In this article, we present an implementation of traffic engineering over an Internet Service Prov ider (ISP)- based MPLS-VPN. We will start by defining the features, modes and preconditions for traffic engineering. Then we will explain what information needs to be disseminated to all the TE enabled routers and how the underlying routing protocol is modified to send it. Then we will define and configure MPLS TE tunnels. Finally, we will show how to achieve link protection in TE supported MPLS-VPN.
APA, Harvard, Vancouver, ISO, and other styles
5

Pratima, Pandhare*. "MPLS-TP: LABEL SWITCH PATH: CREATION AND MANAGEMENT." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 5, no. 5 (2016): 157–60. https://doi.org/10.5281/zenodo.51012.

Full text
Abstract:
MPLS Transport Profile (MPLS-TP) technology is gaining importance as it becomes a dominant solution for a converged transport network in recent years. This paper outlines how MPLS-TP methodology can be implemented in the real world scenario. A comprehensive study is carried out on MPLS recovery mechanisms for protecting and restoring traffic after failure occurrence. In this paper the requirements of designing an efficient and reliable MPLS-TP label switch paths and tunnel are well considered and also set concrete evaluating criteria. In this paper, a full comprehensive simulation environment is created for a conventional network and MPLS applied over that traditional network to evaluate the comparative performance of network traffic behavior. Finally, the results are evaluated and analyzed on different versions of network simulators.
APA, Harvard, Vancouver, ISO, and other styles
6

Muñoz, Raül, Ramon Casellas, Ricardo Martínez, and Ricard Vilalta. "PCE: What is It, How Does It Work and What are its Limitations?" IEEE/OSA Journal of Lightwave Technology 32, no. 4 (2014): 528–43. https://doi.org/10.5281/zenodo.58585.

Full text
Abstract:
In GMPLS-controlled optical networks, the utilization of source-based path computation has some limitations, especially in large networks with stringent constraints (e.g., optical impairments) or in multilayer and multidomain networks, which leads to suboptimal routing solutions. The path computation eElement (PCE) can mitigate some weaknesses of GMPLS-controlled optical networks. The main idea behind the PCE is to decouple the path computation function from the GMPLS controllers into a dedicated entity with an open and well-defined interface and protocol. A (stateless) PCE is capable of computing a network path or route based on a network graph (i.e., the traffic engineering database-TED) and applying computational constraints. First, we present an overview of the PCE architecture and its communication protocol (PCEP). Then, we present in detail the considered source-routing shortcomings in GMPLS-controlled networks, namely, impairment-aware path computation, multidomain path computation and multilayer path computation, as well as the different PCE-based solutions that have been proposed to overcome each one of these problems. However, PCE-based computation also presents some limitations that lead to an increase in the path computation blocking or to suboptimal path computations. The stateful PCE overcomes the limitations of the stateless PCE, such as the outdated TED, the lack of global LSP state (i.e., set of computed paths and reserved resources in use in the network), and the lack of control of path reservations. A passive stateful PCE allows optimal path computation and increased path computation success, considering both the network state (TED) and the Label Switched Paths (LSP) state (LSP Database-LSPDB). Additionally, an active stateful PCE can modify existing LSPs (i.e., connections), and optionally, setup and/or release existing LSPs. Finally, the formal decoupling of the path computation allows more flexibility in the deployment of PCEs in other control- paradigms outside their original scope (MPLS/GMPLS). In this sense, we provide an overview of three PCE deployment models in the software defined network (SDN) control architecture.
APA, Harvard, Vancouver, ISO, and other styles
7

Mustapha, Oba Zubair, Muhammad Ali, Yim Fun Hu, and Raed A. Abd-Alhameed. "Service-aware LSP selection with fuzzy based packet scheduling scheme for non-real time traffics." International Journal of Informatics and Communication Technology (IJ-ICT) 10, no. 2 (2021): 126. http://dx.doi.org/10.11591/ijict.v10i2.pp126-139.

Full text
Abstract:
An essential solution is available in Multi-protocol label switching (MPLS), which solve the problems faced by present-day networks: speed, scalability, quality-of-service (QoS) management, and traffic engineering. This paper is an extension of work on Fuzzy based Packet Scheduling Algorithm (FPSA) combined with Packets Processing Algorithm (PPA) in an Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) networks. This will make provision for an intelligent service to the Label Switched Path (LSP) in MPLS networks. Several research work have been proposed on the MPLS Traffic Engineering. However, it is still imperative to further research on the effect of bandwidth increment on the core network using different mechanisms such as the analytical model of MPLS, expert-based packet scheduling algorithm for MPLS QoS support. Since MPLS is not able to provide intelligent routing, it is necessary to propose an intelligent expert system of FPSA combined with PPA. And analytical model of packet forwarding in the MPLS network would be given to provide suitable solution to traffic congestion and reliable services. Furthermore, the network model created using Network Simulator (NS 2), which carries non-real time application such as File Transfer Protocol (FTP) with bandwidth variations. The results obtained from trace files are interpreted by AWK script and used for the further analysis.
APA, Harvard, Vancouver, ISO, and other styles
8

Kashif, R. Khawaja, M. Khaldi Hulaiyel, I. Shukri Majed, H. Mutairi Baraka, and Nasser Al-Khaldi Fahad. "The Usage of MPLS in Voice over IP Network." International Journal of Engineering Research and Reviews 10, no. 3 (2022): 6–10. https://doi.org/10.5281/zenodo.6985144.

Full text
Abstract:
<strong>Abstract:</strong> The article focused on the usage of Multiprotocol Label Switching (MPLS) over VOIP network. One of the features that MPLS has is Traffic Engineering (TE) which can help overcome potential pot holes in the network or to circumvent sub-optimal paths, especially in a network consisting of a diverse geographical terrain. The prevalence of MPLS IP VPN networks make them the de facto transport for inter-connecting IMS based VoIP devices. Inevitably, this creates the need for a fundamental set of guidelines, which can ensure that the quality of service for real time traffic is acceptable. To that end, a systematic approach was taken to implement traffic engineering LSPs which enabled the real time multimedia traffic to be delivered with highest priority and minimal loss and delay. This helped provide tangible network operations benefits such as, early detection of service disruption because of faults in the desired end to end label switched paths, reduction of the Mean Time to Resolve (MTTR) and lead to proposals for further improvements which could produce a more intelligent re-routing of the LSPs&nbsp;&nbsp; <strong>Keywords:</strong> Multiprotocol Label Switching (MPLS), Traffic Engineering (TE), Voice over Internet Protocol (VoIP), Internet Protocol (IP), Label Switched Path (LSP). <strong>Title:</strong> The Usage of MPLS in&nbsp;Voice over IP Network <strong>Author:</strong> Kashif R. Khawaja, Hulaiyel M. Khaldi, Majed I. Shukri, Baraka H. Mutairi, Fahad Nasser Al-Khaldi <strong>International Journal of Engineering Research and Reviews</strong> <strong>ISSN 2348-697X (Online)</strong> <strong>Vol. 10, Issue 3, July 2022 - September 2022</strong> <strong>Page No: 6-10</strong> <strong>Research Publish Journals</strong> <strong>Website: www.researchpublish.com</strong> <strong>Published Date: 12-August-2022</strong> <strong>DOI: </strong><strong>https://doi.org/10.5281/zenodo.6985144</strong> <strong>Paper Download Link (Source)</strong> <strong>https://www.researchpublish.com/papers/the-usage-of-mpls-in-voice-over-ip-network</strong>
APA, Harvard, Vancouver, ISO, and other styles
9

Castro, A., Ricardo Martínez, Ramon Casellas, et al. "Experimental Assessment of Bulk Path Restoration in Multi-layer Networks using PCE-based Global Concurrent Optimization." Journal of Lightwave Technology 32, no. 1 (2014): 81–90. https://doi.org/10.1109/JLT.2013.2290588.

Full text
Abstract:
Generalized multi-protocol label switching-based multi-layer networks (MLN) combining packet and optical switching lead to jointly leverage intrinsic per-layer benefits such as statistical multiplexing and huge transport capacity. By doing so, efficient network resource utilization is attained through MLN traffic engineering (TE) strategies, i.e. grooming. In this context, an optical link failure may cause the disruption of multiple groomed packet label switched paths (LSPs). Thereby, efficient recovery schemes such as restoration are required. In dynamic restoration, the centralized path computation element (PCE) sequentially computes backup paths for the set of failed packet LSPs using the TE database (TED). Since the TED is not updated until an LSP is actually set up, it is very likely that the PCE assigns the same network resources to different backup paths. This does increase resource contention and not fully exploits the potential grooming opportunities among the backup LSPs; consequently, the restorability metric performs poorly. To improve this, a designed PCE global concurrent optimization (GCO) architecture is implemented favoring grooming and lowering resource contention. The addressed problem, referred to as bulk path restoration in multi-layer optical networks (BAREMO), is formally modeled and stated using a mixed integer linear programming formulation. Then, a heuristic algorithm solving the BAREMO problem is devised. The experimental performance evaluation is conducted within the ADRENALINE testbed. Besides validating the PCE GCO architecture, its performance is compared with a sequential PCE for several traffic loads and failure rates. The results show that the PCE GCO improves remarkably restorability compared to the sequential PCE at the expenses, however, of increasing the restoration time.
APA, Harvard, Vancouver, ISO, and other styles
10

Ariyanti, Dwi, and Unan Yusmaniar Oktiawati. "Analisis Perbandingan Performa Traffic Engineering Dengan Resource Reservation Protocol (RSVP) dan Segment Routing." Teknika 8, no. 2 (2019): 86–91. http://dx.doi.org/10.34148/teknika.v8i2.176.

Full text
Abstract:
Kualitas koneksi khususnya pada backbone menjadi tantangan Internet Service Provider (ISP). MPLS berkerja di layer 2,5 OSI yang mampu mempercepat pengiriman paket pada jaringan backbone. MPLS melekatkan label pada paket yang dikirimkan. Salah satu layanan dari MPLS adalah traffic engineering yang dibuat dengan protokol RSVP. Terdapat protokol baru untuk memberi label pada paket dan mendukung traffic engineering, yaitu Segment Routing. Penelitian ini menganalisis perbandingan performa traffic engineering dengan RSVP dan Segment Routing. Baik pada penerapan RSVP maupun Segment Routing dibuat tunnel untuk jalur utama dan reroute menuju jalur cadangan. Penelitian dilakukan pada emulator EVE-NG dengan mengambil studi kasus topologi backbone di PT ICON+.Hasil penelitian adalah Segment Routing di MPLS menyederhanakan kinerja dari router dalam hal pelabelan dan dalam memelihara Label Switch Path (LSP), tidak membutuhkan protokol signaling. Hasil pengujian latency pada jalur utama, dengan Segment Routing maupun dengan RSVP mempunyai nilai sama. Sedangkan pada jalur cadangan, nilai latency dari Segment Routing lebih kecil, sehingga Segment Routing dapat mengirim data dengan lebih cepat daripada dengan RSVP. Hasil pengujian packet delivery ratio dan packet loss ratio dengan Segment Routing dan dengan RSVP baik di jalur utama maupun jalur cadangan bernilai sama, yaitu 100% dan 0%. Baik pada jalur utama maupun jalur cadangan, penerapan Segment Routing mempunyai nilai throughput yang lebih besar daripada penerapan RSVP, sehingga Segment Routing dapat mengirim data dengan lebih cepat daripada RSVP. Pada kondisi link mengalami kegagalan saat pengujian, keduanya memiliki 1% packet loss, namun perpindahan jalur dilakukan dengan lebih cepat pada Segment Routing.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Label Switched Path (LSP)"

1

Hundessa, Gonfa Lemma. "Enhanced Fast Rerouting Mechanisms for Protected Traffic in MPLS Networks." Doctoral thesis, Universitat Politècnica de Catalunya, 2003. http://hdl.handle.net/10803/5977.

Full text
Abstract:
Multiprotocol Label Switching (MPLS) fuses the intelligence of routing with the performance of switching and provides significant benefits to networks with a pure IP architecture as well as those with IP and ATM or a mix of ther Layer 2 technologies. MPLS technology is key to scalable virtual private networks (VPNs) and end-to-end quality of service (QoS), enabling efficient utilization of existing networks to meet future growth. The technology also helps to deliver highly scalable, differentiated end-to-end IP services with simpler configuration, management, and provisioning for both Internet providers and end-users. However, MPLS is a connection-oriented architecture. In case of failure MPLS first has to establish a new label switched path (LSP) and then forward the packets to the newly established LSP. For this reason MPLS has a slow restoration response to a link or node failure on the LSP.<br/>The thesis provides a description of MPLS-based architecture as a preferred technology for integrating ATM and IP technologies, followed by a discussion of the motivation for the fast and reliable restoration mechanism in an MPLS network. In this thesis first we address the fast rerouting mechanisms for MPLS networks and then we focus on the problem of packet loss, packet reordering and packet delay for protected LSP in MPLS-based network for a single node/link failure. In order to deliver true service assurance for guaranteed traffic on a protected LSP we use the fast rerouting mechanism with a preplanned alternative LSP. We propose enhancements to current proposals described in extant literature. Our fast rerouting mechanism avoids packet disorder and significantly reduces packet delay during the restoration period.<br/>An extension of the Fast Rerouting proposal, called Reliable and Fast Rerouting (RFR), provides some preventive actions for the protected LSP against packet loss during a failure. RFR maintains the same advantages of Fast Rerouting while eliminating packet losses, including those packet losses due to link or node failure (circulating on the failed links), which were considered to be "inevitable" up to now.<br/>For the purpose of validating and evaluating the behavior of these proposals a simulation tool was developed. It is based on the NS, a well-known network simulator that is being used extensively in research work. An extension featuring the basic functionality of MPLS (MNS) is also available for the NS, and this is the basis of the developed simulation tool.<br/>Simulation results allow the comparison of Fast Rerouting and RFR with previous rerouting proposals.<br/>In addition to this we propose a mechanism for multiple failure recovery in an LSP. This proposal combines the path protection, segment protection and local repair methods. In addition to the multiple link/node failure protection, the multiple fault tolerance proposal provides a significant reduction of delay that the rerouted traffic can experience after a link failure, because the repair action is taken close to the point of failure.<br/>Then we proceed to address an inherent problem of the preplanned alternative LSP. As alternative LSPs are established together with the protected LSP it may happen that the alternative is not the optimal LSP at the time the failure occurs. To overcome this undesired behavior, we propose the Optimal and Guaranteed Alternative Path (OGAP). The proposal uses a hybrid of fast-rerouting and a dynamic approach to establish the optimal alternative LSP while rerouting the affected traffic using the preplanned alternative LSP. This hybrid approach provides the best of the fast rerouting and the dynamic approaches.<br/>At the same time we observed that the protection path becomes in fact unprotected from additional failures after the traffic is rerouted onto it.<br/>To address this we propose a guarantee mechanism for protection of the new protected LSP carrying the affected traffic, by establishing an alternative LSP for the rerouted traffic after a failure, avoiding the vulnerability problem for the protected traffic.<br/>Finally, we present a further optimization mechanism, adaptive LSP, to enhance the existing traffic engineering for Quality of Services (QoS)provision and improve network resource utilization. The adaptive LSP proposal allows more flexibility in network resource allocation and utilization by adapting the LSP to variations in all network loads,resulting in an enhancement of existing MPLS traffic engineering.
APA, Harvard, Vancouver, ISO, and other styles
2

Vlček, Martin. "Pokročilé možnosti technologie MPLS." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218141.

Full text
Abstract:
Tato práce se zabývá technologií Multiprotocol Label Switching a to zejména moderními metodami, které je možné použít v rámci této technolologie. Jako příklad lze uvést využití podpory kvality služeb při směrování. V práci jsou navrhnuty a simulovány různé topologie a scénáře, které ověřují možnosti využití MPLS v podpoře kvality služeb.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Label Switched Path (LSP)"

1

Monika, Simranjit Singh, and Amit Wason. "Performance Evaluation of Path Computation Algorithms in Generalized Multiprotocol Label-Switched Optical Networks." In Broadband Connectivity in 5G and Beyond. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06866-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kim, Chulsoo, Taewan Kim, Jin hyuk Son, and Sang Ho Ahn. "Preventive Congestion Control Mechanisms in ATM Based MPLS on BcN: Detection and Control Mechanisms for a Slim Chance of Label Switched Path." In Management of Convergence Networks and Services. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11876601_52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Scoglio, C., T. Anjali, J. C. de Oliveira, I. F. Akyildiz, and G. Uhl. "A new threshold-based policy for label switched path (LSP) set-up in MPLS networks." In Teletraffic Engineering in the Internet Era, Proceedings of the International Teletraffic Congress - ITC-I7. Elsevier, 2001. http://dx.doi.org/10.1016/s1388-3437(01)80106-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Label Switched Path (LSP)"

1

Zijie Xing, Weiqiang Sun, Yaohui Jin, Wei Guo, and Weisheng Hu. "Dynamic label switched path provisioning performance in GMPLS networks." In 2009 14th OptoElectronics and Communications Conference (OECC). IEEE, 2009. http://dx.doi.org/10.1109/oecc.2009.5213105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kim, Bosung, Hyungjoon Park, Kwangsoo Kim, and Byeong-hee Roh. "Label-Switched Multi-Path Routing for Mission-Critical Tactical Message Delivery." In Applications (CUTE). IEEE, 2010. http://dx.doi.org/10.1109/icut.2010.5677892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Aslam, F., Z. A. Uzmi, A. Farrel, and M. Pioro. "Inter-Domain Path Computation using Improved Crankback Signaling in Label Switched Networks." In 2007 IEEE International Conference on Communications. IEEE, 2007. http://dx.doi.org/10.1109/icc.2007.336.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Du, Shu, Yunfeng Peng, and Keping Long. "A distributed multicast label switched path setup scheme to solve the multi-destination reservation collision." In Asia Pacific Optical Communications, edited by Weisheng Hu, Shoa-Kai Liu, Ken-ichi Sato, and Lena Wosinska. SPIE, 2008. http://dx.doi.org/10.1117/12.803812.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Label Switched Path (LSP)"

1

Bonica, R., I. Minei, M. Conn, D. Pacella, and L. Tomotaki. Label Switched Path (LSP) Self-Ping. RFC Editor, 2016. http://dx.doi.org/10.17487/rfc7746.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, M., W. Cao, S. Ning, F. Jounay, and S. Delord. Return Path Specified Label Switched Path (LSP) Ping. RFC Editor, 2014. http://dx.doi.org/10.17487/rfc7110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, M., W. Cao, A. Takacs, and P. Pan. LDP Extensions for Pseudowire Binding to Label Switched Path (LSP) Tunnels. RFC Editor, 2016. http://dx.doi.org/10.17487/rfc7965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ikejiri, Y. Analysis of Inter-Domain Label Switched Path (LSP) Recovery. Edited by T. Takeda and A. Farrel. RFC Editor, 2008. http://dx.doi.org/10.17487/rfc5298.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, L., and C. Scoglio. Label Switched Path (LSP) Preemption Policies for MPLS Traffic Engineering. Edited by J. de. RFC Editor, 2007. http://dx.doi.org/10.17487/rfc4829.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Akiya, N., G. Swallow, C. Pignataro, L. Andersson, and M. Chen. Label Switched Path (LSP) Ping and Traceroute Reply Mode Simplification. RFC Editor, 2016. http://dx.doi.org/10.17487/rfc7737.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Luo, J., L. Jin, T. Nadeau, and G. Swallow, eds. Relayed Echo Reply Mechanism for Label Switched Path (LSP) Ping. RFC Editor, 2016. http://dx.doi.org/10.17487/rfc7743.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xiong, Q. Label Switched Path (LSP) Object Flag Extension for Stateful PCE. RFC Editor, 2023. http://dx.doi.org/10.17487/rfc9357.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Martinelli, G., S. Balls, and B. Wright. Label Switched Path (LSP) Attribute in the Explicit Route Object (ERO). Edited by C. Margaria. RFC Editor, 2015. http://dx.doi.org/10.17487/rfc7570.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, H., A. Liu, T. Saad, F. Xu, and L. Huang. Extensions to RSVP-TE for Label Switched Path (LSP) Egress Protection. RFC Editor, 2018. http://dx.doi.org/10.17487/rfc8400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Label Switched Path (LSP)' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography