A queueing model for PCEP (Path Computation Element Protocol)

Date

2013-06-18

ORCID

Journal Title

Journal ISSN

Volume Title

Publisher

The University of Texas at Dallas

item.page.doi

Abstract

Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path computation capacity and redundancy. An open problem is which PCE should be chosen to send the path computation request to, that may be a non trivial problem if PCE’s have uneven processing capacities. This paper presents a product form queueing model to estimate the latencies in path computation while accounting for the arrival rate of path computation requests. The model is used to find the PCE selection policy to minimize the average expected latencies in path computation. The model is validated against two simulation benchmarks obtained using OPNET, i.e., a network of queues and the multi protocol label switching with traffic engineering (MPLSTE) network running the PCE communication protocol (PCEP). The study shows that the use of product form yields approximations that are up to 15% at practical offered loads. Moreover, the PCE selection policy derived under the product form assumption is showed to be effective in minimizing the overall expected latencies in path computation.

Description

"This research is supported in part by NSF Grant No. CNS-0435393."

Keywords

Path computation element (PCE), Path computation element profile (PCEP), MPLS standard, Telecommunication--Traffic, Load-balancing, lnter-area-

item.page.sponsorship

Rights

CC BY 3.0 (Attribution)

Citation