343 research outputs found
An anycast based feedback aggregation scheme for efficient network transparency in cross-layer design
To ensure Quality of Service for multimedia data sessions in next generation mobile telecommunication systems, jointly-optimized cross-layer architectures were introduced recently. Such shemes usually require an adaptive media source which is able to modify the main parameters of ongoing connections by transferring control and feedback information via the network and through different protocol layers from application layer to physical layer and vice versa, according to the actual state of the path between peer nodes. This concept of transmitting cross-layer information is referred as network transparency in the literature, meaning that the underlying infrastructure is almost invisible to all the entities involved in joint optimization due to the continuous conveyance of cross-layer feedbacks. In this paper we introduce and evaluate a possible solution for reducing the network overhead caused by this volume of information exchange. Our soulution is based on the anycasting communication paradigm and creates a hierarchical data aggregation scheme allowing to adapt each entity of the multimedia transmission chain based on frequent feedbacks and even so in a low-bandwitdh manner
Research on network anycast
Anycast is defined as a service in IPv6, which provides stateless best effort delivery of an anycast datagram to at least one, and preferably only one host. It is a topic of increasing interest. This paper is an attempt to gather and report on the work done on anycast. There are two main categories at present: network-layer anycast and application-layer anycast. Both involve anycast architectures, routing algorithms, metrics, applications, etc. We also present an efficient algorithm for application-layer anycast, and point out possible research directions based on our research. <br /
Network layer access control for context-aware IPv6 applications
As part of the Lancaster GUIDE II project, we have developed a novel wireless access point protocol designed to support the development of next generation mobile context-aware applications in our local environs. Once deployed, this architecture will allow ordinary citizens secure, accountable and convenient access to a set of tailored applications including location, multimedia and context based services, and the public Internet. Our architecture utilises packet marking and network level packet filtering techniques within a modified Mobile IPv6 protocol stack to perform access control over a range of wireless network technologies. In this paper, we describe the rationale for, and components of, our architecture and contrast our approach with other state-of-the- art systems. The paper also contains details of our current implementation work, including preliminary performance measurements
Effective Mobile Routing Through Dynamic Addressing
Military communications has always been an important factor in military victory and will surely play an important part in future combat. In modern warfare, military units are usually deployed without existing network infrastructure. The IP routing protocol, designed for hierarchical networks cannot easily be applied in military networks due to the dynamic topology expected in military environments. Mobile ad-hoc networks (MANETs) represent an appropriate network for small military networks. But, most ad-hoc routing protocols suffer from the problem of scalability for large networks. Hierarchical routing schemes based on the IP address structure are more scalable than ad-hoc routing but are not flexible for a network with very dynamic topology. This research seeks a compromise between the two; a hybrid routing structure which combines mobile ad-hoc network routing with hierarchical network routing using pre-planned knowledge about where the various military units will be located and probable connections available. This research evaluates the performance of the hybrid routing and compares that routing with a flat ad-hoc routing protocol, namely the Ad-hoc On-demand Distance Vector (AODV) routing protocol with respect to goodput ratio, packet end to- end delay, and routing packet overhead. It shows that hybrid routing generates lower routing control overhead, better goodput ratio, and lower end-to-end packet delay than AODV routing protocol in situations where some a-priori knowledge is available
Segment Routing: a Comprehensive Survey of Research Activities, Standardization Efforts and Implementation Results
Fixed and mobile telecom operators, enterprise network operators and cloud
providers strive to face the challenging demands coming from the evolution of
IP networks (e.g. huge bandwidth requirements, integration of billions of
devices and millions of services in the cloud). Proposed in the early 2010s,
Segment Routing (SR) architecture helps face these challenging demands, and it
is currently being adopted and deployed. SR architecture is based on the
concept of source routing and has interesting scalability properties, as it
dramatically reduces the amount of state information to be configured in the
core nodes to support complex services. SR architecture was first implemented
with the MPLS dataplane and then, quite recently, with the IPv6 dataplane
(SRv6). IPv6 SR architecture (SRv6) has been extended from the simple steering
of packets across nodes to a general network programming approach, making it
very suitable for use cases such as Service Function Chaining and Network
Function Virtualization. In this paper we present a tutorial and a
comprehensive survey on SR technology, analyzing standardization efforts,
patents, research activities and implementation results. We start with an
introduction on the motivations for Segment Routing and an overview of its
evolution and standardization. Then, we provide a tutorial on Segment Routing
technology, with a focus on the novel SRv6 solution. We discuss the
standardization efforts and the patents providing details on the most important
documents and mentioning other ongoing activities. We then thoroughly analyze
research activities according to a taxonomy. We have identified 8 main
categories during our analysis of the current state of play: Monitoring,
Traffic Engineering, Failure Recovery, Centrally Controlled Architectures, Path
Encoding, Network Programming, Performance Evaluation and Miscellaneous...Comment: SUBMITTED TO IEEE COMMUNICATIONS SURVEYS & TUTORIAL
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling
Traditionally, routing in wireless sensor networks consists of
two steps: First, the routing protocol selects a next hop,
and, second, the MAC protocol waits for the intended destination
to wake up and receive the data. This design makes
it difficult to adapt to link dynamics and introduces delays
while waiting for the next hop to wake up.
In this paper we introduce ORW, a practical opportunistic
routing scheme for wireless sensor networks. In a dutycycled
setting, packets are addressed to sets of potential receivers
and forwarded by the neighbor that wakes up first
and successfully receives the packet. This reduces delay and
energy consumption by utilizing all neighbors as potential
forwarders. Furthermore, this increases resilience to wireless
link dynamics by exploiting spatial diversity. Our results
show that ORW reduces radio duty-cycles on average
by 50% (up to 90% on individual nodes) and delays by 30%
to 90% when compared to the state of the art
- âŠ