This document is a product of the Internet Engineering Task Force (IETF). It represents the conse... more This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc5712.
Path computation elements (PCE's) are used to com- pute end-to-end paths across multiple are... more Path computation elements (PCE's) are used to com- pute end-to-end paths across multiple areas. Multiple PCE's may be dedicated to each area to provide su cient 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 overall 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 tra c engineering (MPLS- TE) network running the PCE communication protocol (PCEP). The study shows that the use of product form yields approxima- tions that are up to 15% at practical o...
International Journal of Vehicular Technology, 2012
This paper focuses on routing for vehicles getting access to infrastructure either directly or vi... more This paper focuses on routing for vehicles getting access to infrastructure either directly or via multiple hops through other vehicles. We study routing protocol for low-power and lossy networks (RPL), a tree-based routing protocol designed for sensor networks. Many design elements from RPL are transferable to the vehicular environment. We provide a simulation performance study of RPL and RPL tuning in VANETs. More specifically, we seek to study the impact of RPL's various parameters and external factors (e.g., various timers and speeds) on its performance and obtain insights on RPL tuning for its use in VANETs. We then fine tune RPL and obtain performance gain over existing RPL.
In this paper, a novel distributed dynamic MPLS traffic engineering (dynamic TE) mechanism is pro... more In this paper, a novel distributed dynamic MPLS traffic engineering (dynamic TE) mechanism is proposed and its performance under failure scenarios and increased traffic load is analyzed when compared to other traditional approaches (static IP and TE). The new mechanism periodically updates bandwidth reservation and selects path (resizing and rerouting) for each TE LSP according to its computed traffic load,
Metal plated aluminum product with good adhesion between aluminum substrate and plated metal are ... more Metal plated aluminum product with good adhesion between aluminum substrate and plated metal are found to be producible by the process which comprises: electrolyzing aluminum or aluminum alloys by A.C. or superimposed A.C. and D.C. in an electrolytic solution capable of producing a growth type or barrier type anodic oxide coating onto the surface of the aluminum or aluminum alloy and comprising an aqueous solution containing a water-soluble acid and a water-soluble heavy metal salt, thereby to impart good adhesion properties to the aluminum or aluminum alloy surface and render it suitable as a substrate for plating of additional metal thereon, metal plating on the resulting aluminum substrate, and subjecting said plated substrate to a heat treatment to enhance the adhesion between the substrate and the additional metal plated thereon.
Constraint-based path computation is a fundamental building block for traffic engineering systems... more Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domains. This document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space. This document does not attempt to provide a detailed description of all the architectural components, but rather it describes a set of building blocks for the PCE architecture from which solutions may be constructed.
Status of This Memo This memo provides information for the Internet community. It does not specif... more Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited.
This document is a product of the Internet Engineering Task Force (IETF). It represents the conse... more This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc5712.
This document is a product of the Internet Engineering Task Force (IETF). It represents the conse... more This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc5712.
Path computation elements (PCE's) are used to com- pute end-to-end paths across multiple are... more Path computation elements (PCE's) are used to com- pute end-to-end paths across multiple areas. Multiple PCE's may be dedicated to each area to provide su cient 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 overall 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 tra c engineering (MPLS- TE) network running the PCE communication protocol (PCEP). The study shows that the use of product form yields approxima- tions that are up to 15% at practical o...
International Journal of Vehicular Technology, 2012
This paper focuses on routing for vehicles getting access to infrastructure either directly or vi... more This paper focuses on routing for vehicles getting access to infrastructure either directly or via multiple hops through other vehicles. We study routing protocol for low-power and lossy networks (RPL), a tree-based routing protocol designed for sensor networks. Many design elements from RPL are transferable to the vehicular environment. We provide a simulation performance study of RPL and RPL tuning in VANETs. More specifically, we seek to study the impact of RPL's various parameters and external factors (e.g., various timers and speeds) on its performance and obtain insights on RPL tuning for its use in VANETs. We then fine tune RPL and obtain performance gain over existing RPL.
In this paper, a novel distributed dynamic MPLS traffic engineering (dynamic TE) mechanism is pro... more In this paper, a novel distributed dynamic MPLS traffic engineering (dynamic TE) mechanism is proposed and its performance under failure scenarios and increased traffic load is analyzed when compared to other traditional approaches (static IP and TE). The new mechanism periodically updates bandwidth reservation and selects path (resizing and rerouting) for each TE LSP according to its computed traffic load,
Metal plated aluminum product with good adhesion between aluminum substrate and plated metal are ... more Metal plated aluminum product with good adhesion between aluminum substrate and plated metal are found to be producible by the process which comprises: electrolyzing aluminum or aluminum alloys by A.C. or superimposed A.C. and D.C. in an electrolytic solution capable of producing a growth type or barrier type anodic oxide coating onto the surface of the aluminum or aluminum alloy and comprising an aqueous solution containing a water-soluble acid and a water-soluble heavy metal salt, thereby to impart good adhesion properties to the aluminum or aluminum alloy surface and render it suitable as a substrate for plating of additional metal thereon, metal plating on the resulting aluminum substrate, and subjecting said plated substrate to a heat treatment to enhance the adhesion between the substrate and the additional metal plated thereon.
Constraint-based path computation is a fundamental building block for traffic engineering systems... more Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domains. This document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space. This document does not attempt to provide a detailed description of all the architectural components, but rather it describes a set of building blocks for the PCE architecture from which solutions may be constructed.
Status of This Memo This memo provides information for the Internet community. It does not specif... more Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited.
This document is a product of the Internet Engineering Task Force (IETF). It represents the conse... more This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc5712.
Uploads
Papers by JP V