The Experts below are selected from a list of 3834 Experts worldwide ranked by ideXlab platform
Alan Mycroft - One of the best experts on this subject based on the ideXlab platform.
-
linear types for Packet processing
European Symposium on Programming, 2004Co-Authors: Robert Ennals, Richard Sharp, Alan MycroftAbstract:We present PacLang: an imperative, concurrent, linearly-typed language designed for expressing Packet processing applications. PacLang’s linear type system ensures that no Packet is referenced by more than one thread, but allows multiple references to a Packet within a thread. We argue (i) that this property greatly simplifies compilation of high-level programs to the distributed memory architectures of modern Network Processors; and (ii) that PacLang’s type system captures that style in which imperative Packet processing programs are already written. Claim (ii) is justified by means of a case-study: we describe a PacLang implementation of the IPv4 Unicast Packet forwarding algorithm.
-
Linear types for Packet processing
Lecture Notes in Computer Science, 2004Co-Authors: Robert Ennals, Richard Sharp, Alan MycroftAbstract:We present PACLANG: an imperative, concurrent, linearly-typed language designed for expressing Packet processing applications. PACLANG's linear type system ensures that no Packet is referenced by more than one thread, but allows multiple references to a Packet within a thread. We argue (i) that this property greatly simplifies compilation of high-level programs to the distributed memory architectures of modern Network Processors; and (ii) that PACLANG's type system captures that style in which imperative Packet processing programs are already written. Claim (ii) is justified by means of case-study: we describe a PACLANG implementation of the IPv4 Unicast Packet forwarding algorithm. PACLANG is formalised by means of an operational semantics and a Unique Ownership theorem formalises its correctness with respect to the type system.
Robert Ennals - One of the best experts on this subject based on the ideXlab platform.
-
linear types for Packet processing
European Symposium on Programming, 2004Co-Authors: Robert Ennals, Richard Sharp, Alan MycroftAbstract:We present PacLang: an imperative, concurrent, linearly-typed language designed for expressing Packet processing applications. PacLang’s linear type system ensures that no Packet is referenced by more than one thread, but allows multiple references to a Packet within a thread. We argue (i) that this property greatly simplifies compilation of high-level programs to the distributed memory architectures of modern Network Processors; and (ii) that PacLang’s type system captures that style in which imperative Packet processing programs are already written. Claim (ii) is justified by means of a case-study: we describe a PacLang implementation of the IPv4 Unicast Packet forwarding algorithm.
-
Linear types for Packet processing
Lecture Notes in Computer Science, 2004Co-Authors: Robert Ennals, Richard Sharp, Alan MycroftAbstract:We present PACLANG: an imperative, concurrent, linearly-typed language designed for expressing Packet processing applications. PACLANG's linear type system ensures that no Packet is referenced by more than one thread, but allows multiple references to a Packet within a thread. We argue (i) that this property greatly simplifies compilation of high-level programs to the distributed memory architectures of modern Network Processors; and (ii) that PACLANG's type system captures that style in which imperative Packet processing programs are already written. Claim (ii) is justified by means of case-study: we describe a PACLANG implementation of the IPv4 Unicast Packet forwarding algorithm. PACLANG is formalised by means of an operational semantics and a Unique Ownership theorem formalises its correctness with respect to the type system.
Richard Sharp - One of the best experts on this subject based on the ideXlab platform.
-
linear types for Packet processing
European Symposium on Programming, 2004Co-Authors: Robert Ennals, Richard Sharp, Alan MycroftAbstract:We present PacLang: an imperative, concurrent, linearly-typed language designed for expressing Packet processing applications. PacLang’s linear type system ensures that no Packet is referenced by more than one thread, but allows multiple references to a Packet within a thread. We argue (i) that this property greatly simplifies compilation of high-level programs to the distributed memory architectures of modern Network Processors; and (ii) that PacLang’s type system captures that style in which imperative Packet processing programs are already written. Claim (ii) is justified by means of a case-study: we describe a PacLang implementation of the IPv4 Unicast Packet forwarding algorithm.
-
Linear types for Packet processing
Lecture Notes in Computer Science, 2004Co-Authors: Robert Ennals, Richard Sharp, Alan MycroftAbstract:We present PACLANG: an imperative, concurrent, linearly-typed language designed for expressing Packet processing applications. PACLANG's linear type system ensures that no Packet is referenced by more than one thread, but allows multiple references to a Packet within a thread. We argue (i) that this property greatly simplifies compilation of high-level programs to the distributed memory architectures of modern Network Processors; and (ii) that PACLANG's type system captures that style in which imperative Packet processing programs are already written. Claim (ii) is justified by means of case-study: we describe a PACLANG implementation of the IPv4 Unicast Packet forwarding algorithm. PACLANG is formalised by means of an operational semantics and a Unique Ownership theorem formalises its correctness with respect to the type system.
Ye Tao - One of the best experts on this subject based on the ideXlab platform.
-
dupe duplicated Unicast Packet encapsulation in position based routing vanet
2016 9th IFIP Wireless and Mobile Networking Conference (WMNC), 2016Co-Authors: Ye Tao, Manabu Tsukada, Hiroshi EsakiAbstract:Position-based Routing Vehicular Ad-hoc Network (PBR-VANET) is a specific type of mobile Ad-hoc network where the nodes are present as vehicles and the routing is decided based on node position. However, PBR-VANET routing protocols greatly suffer from mass Packet loss due to frequent changes in topology. We discuss the requirements of the routing protocol and propose a routing encapsulation protocol called Duplicated Unicast Packet Encapsulation (DUPE). The protocol is compatible with original GeoNetworking standard, and can cooperate with the existing implementations without modification to neither GeoNetworking infrastructure nor user applications. The protocol encapsulates GeoNetworking Packet in BTP Packet (a Layer 4 protocol in GeoNetworking) and duplicates the original Packet into different paths to reduce Packet loss caused by failure and stale paths. The evaluations on DUPE in different scenarios show that, with reasonable latency and bandwidth overhead achieved, Packet loss in certain scenarios is eliminated, where standard GeoNetworking protocol has Packet loss of up to 94.5% in worst case.
-
DUPE: Duplicated Unicast Packet Encapsulation in Position-Based Routing VANET
HAL CCSD, 2016Co-Authors: Ye Tao, Li Xin, Tsukada Manabu, Esaki HiroshiAbstract:International audiencePosition-based Routing Vehicular Ad-hoc Network (PBR-VANET) is a specific type of mobile Ad-hoc network where the nodes are present as vehicles and the routing is decided based on node position. However, PBR-VANET routing protocols greatly suffer from mass Packet loss due to frequent changes in topology. We discuss the requirements of the routing protocol and propose a routing encapsulation protocol called Duplicated Unicast Packet Encapsulation (DUPE). The protocol is compatible with original GeoNetworking standard, and can cooperate with the existing implementations without modification to neither GeoNetworking infrastructure nor user applications. The protocol encapsulates GeoNetworking Packet in BTP Packet (a Layer 4 protocol in GeoNetworking) and duplicates the original Packet into different paths to reduce Packet loss caused by failure and stale paths. The evaluations on DUPE in different scenarios show that, with reasonable latency and bandwidth overhead achived, Packet loss in certain scenarios is eliminated, where standard GeoNetworking protocol has Packet loss of up to 94.5% in worst case
Wolfgang Effelsberg - One of the best experts on this subject based on the ideXlab platform.
-
position based Unicast routing for city scenarios
World of Wireless Mobile and Multimedia Networks, 2008Co-Authors: Sascha Schnaufer, Wolfgang EffelsbergAbstract:In vehicular ad-hoc networks Unicast Packet forwarding can be separated into the one-dimensional highway case and the two-dimensional city case; in this paper, we deal with the latter. We survey existing position-based routing protocols and present GRANT, our own approach of greedy routing with an abstract neighbor table. We simulate each protocol in our city scenario of Karlsruhe, consisting of streets with a length of 66 km, 390 junctions, and radio obstacles derived from high-definition satellite images. We also simulate the protocols with a FACE-2- and a distance vector-based recovery strategy. As a result we propose GRANT as a routing protocol for Unicast city scenarios.
-
Unicast ad hoc routing in vehicular city scenarios
2006Co-Authors: Sascha Schnaufer, Holger Fusler, Matthias Transier, Wolfgang EffelsbergAbstract:Within Vehicular Ad-Hoc Networking (VANET), i.e., networking between radio-equipped vehicles, Unicast Packet forwarding can be separated into the one-dimensional highway case and the two-dimensional city case. In this report, we survey the routing methods developed in the FleetNet and Network-on-Wheels projects plus a novel combination of two wellknown methods called PBR-DV or Position-Based Routing with Distance-Vector recovery. On the quest for a city-capable candidate routing algorithm as a possible standard, we discuss the usability and performance of the protocols in city scenarios. Finally, we conclude proposing PBR-DV as a candidate protocol for small-hop-count Unicast VANET scenarios.
