A Path Computation Element (PCE)-Based Architecture

Farrel, Adrian; Vasseur, Jean-Philippe; Ash, Jerry

doi:10.17487/rfc4655

Cited by 416 publications

(428 citation statements)

References 5 publications

(5 reference statements)

Supporting

Mentioning

423

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, solving the ID-MCP problem using a centralized method is a very complex problem. Therefore, the research community has recently been exploring the use of distributed architectures to solve this problem, such as the PCE (Path Computation Element) architecture [6]. Distributing the computation over domains preserves confidentiality of each domain and solves the scaling problem.…”

Section: Definitionmentioning

confidence: 99%

“…Upon the reception of a QoS request, the source and the destination domains are determined. According to the cooperation policy, the service provider computes the best domain sequence that links the source and the destination domain [6]. The path computation is triggered in the destination domain toward the source domain following the selected domain sequence.…”

Section: The Online Path Computation Phasementioning

confidence: 99%

See 1 more Smart Citation

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Frikha

Lahoud

Cousin

2011

Smart Spaces and Next Generation Wired/Wireless Networking

View full text Add to dashboard Cite

Abstract. In this paper we tackle the challenging problem of Quality of Service (QoS) routing in multiple domains. We propose a novel inter-domain QoS routing algorithm named HID-MCP. HID-MCP benefits from two major concepts that ensure high performance in terms of success rate and computational complexity. First, HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Second, HID-MCP integrates crankback mechanisms for improving the path computation results in a single domain or in multiple domains. Extensive simulations confirm the efficiency of our algorithm on randomly generated topologies.

show abstract

Section: Definitionmentioning

confidence: 99%

Section: The Online Path Computation Phasementioning

confidence: 99%

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Frikha

Lahoud

Cousin

2011

Smart Spaces and Next Generation Wired/Wireless Networking

View full text Add to dashboard Cite

show abstract

“…For example, [RPL] describes how the allocation of bandwidth can be optimized by an external PCE [RFC4655]. Another centralized (PCE-based) traffic-aware scheduling algorithm is defined in [TASA-PIMRC].…”

Section: Scheduling Mechanismsmentioning

confidence: 99%

Using IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) in the Internet of Things (IoT): Problem Statement

Palattella¹,

Grieco²

2015

114

View full text Add to dashboard Cite

“…Upper layer modules such as self-configuration, routing, mobility management and monitoring are implemented on top of those abstract primitives and can therefore operate with any technology that provides a proper MAC adaptor. The concept of Traffic Engineering (TE) using Path Computation Elements (PCEs) as specified in [4] is adapted by the routing module to perform inter and intra area routing. Our work focuses of the seamless integration of unidirectional technologies so that they can be utilized when beneficial for a specific content or user distribution.…”

Section: Introductionmentioning

confidence: 99%

“…The functionality of a module varies depending on the function of a node. Our CG-WMAN design is based on a centralized approach, where the centralized management nodes maintain the state of their area following the concept of a centralized and stateful PCE [4]. In the centralized approach unicast or multicast path computation as well as resource accounting and allocation can be performed optimally according to TE policies set forth by the operator.…”

Section: Introductionmentioning

confidence: 99%

Towards QoS Provisioning in a Heterogeneous Carrier-Grade Wireless Mesh Access Networks Using Unidirectional Overlay Cells

Kretschmer

Niephaus

Ghinea

2009

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. The visibility and success of Wireless Mesh Network (WMN) deployments has raised interest among commercial operators in this technology. Compared to traditional operator access networks WMNs have the potential to offer easier deployment and flexible self-reconfiguration at lower costs. A WMN-type architecture considered as an alternative for an operator access network must meet similar requirements such as high availability and guaranteed QoS in order to support triple-play content provisioning. In this paper we introduce an architecture of such a Carrier-grade Wireless Mesh Access Network (CG-WMAN). We then present our contribution, an approach to seamlessly integrate unidirectional broadcast cells (i.e. DVB-T) into such a CG-WMAN. This allows higher layer protocols to utilize broadcast cells like regular mesh links, where beneficial for a given payload and receiver distribution. We then present a typical use case and discuss for which combinations of traffic type, user distribution and QoS requirements the use of longer range broadcast technologies can help to improve the overall CG-WMAN performance in terms of throughput and reliability.

show abstract

A Path Computation Element (PCE)-Based Architecture

Cited by 416 publications

References 5 publications

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Using IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) in the Internet of Things (IoT): Problem Statement

Towards QoS Provisioning in a Heterogeneous Carrier-Grade Wireless Mesh Access Networks Using Unidirectional Overlay Cells

Contact Info

Product

Resources

About