1,903 research outputs found
A Novel Network Coded Parallel Transmission Framework for High-Speed Ethernet
Parallel transmission, as defined in high-speed Ethernet standards, enables
to use less expensive optoelectronics and offers backwards compatibility with
legacy Optical Transport Network (OTN) infrastructure. However, optimal
parallel transmission does not scale to large networks, as it requires
computationally expensive multipath routing algorithms to minimize differential
delay, and thus the required buffer size, optimize traffic splitting ratio, and
ensure frame synchronization. In this paper, we propose a novel framework for
high-speed Ethernet, which we refer to as network coded parallel transmission,
capable of effective buffer management and frame synchronization without the
need for complex multipath algorithms in the OTN layer. We show that using
network coding can reduce the delay caused by packet reordering at the
receiver, thus requiring a smaller overall buffer size, while improving the
network throughput. We design the framework in full compliance with high-speed
Ethernet standards specified in IEEE802.3ba and present solutions for network
encoding, data structure of coded parallel transmission, buffer management and
decoding at the receiver side. The proposed network coded parallel transmission
framework is simple to implement and represents a potential major breakthrough
in the system design of future high-speed Ethernet.Comment: 6 pages, 8 figures, Submitted to Globecom201
GEAMS: a Greedy Energy-Aware Multipath Stream-based Routing Protocol for WMSNs
Because sensor nodes operate on power limited batteries, sensor
functionalities have to be designed carefully. In particular, designing
energy-efficient packet forwarding is important to maximize the lifetime of the
network and to minimize the power usage at each node. This paper presents a
Geographic Energy-Aware Multipath Stream-based (GEAMS) routing protocol for
WMSNs. GEAMS routing decisions are made online, at each forwarding node in such
a way that there is no need to global topology knowledge and maintenance. GEAMS
routing protocol performs load-balancing to minimize energy consumption among
nodes using twofold policy: (1) smart greedy forwarding and (2) walking back
forwarding. Performances evaluations of GEAMS show that it can maximize the
network lifetime and guarantee quality of service for video stream transmission
in WMSNs
Identifying Design Requirements for Wireless Routing Link Metrics
In this paper, we identify and analyze the requirements to design a new
routing link metric for wireless multihop networks. Considering these
requirements, when a link metric is proposed, then both the design and
implementation of the link metric with a routing protocol become easy.
Secondly, the underlying network issues can easily be tackled. Thirdly, an
appreciable performance of the network is guaranteed. Along with the existing
implementation of three link metrics Expected Transmission Count (ETX), Minimum
Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with
Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show
that how the computational burden of a metric degrades the performance of the
respective protocol and how a metric has to trade-off between different
performance parameters
Resource Allocation in Ad Hoc Networks
Unlike the centralized network, the ad hoc network does not have any central administrations and energy is constrained, e.g. battery, so the resource allocation plays a
very important role in efficiently managing the limited energy in ad hoc networks.
This thesis focuses on the resource allocation in ad hoc networks and aims to develop
novel techniques that will improve the network performance from different network
layers, such as the physical layer, Medium Access Control (MAC) layer and network
layer.
This thesis examines the energy utilization in High Speed Downlink Packet Access (HSDPA) systems at the physical layer. Two resource allocation techniques,
known as channel adaptive HSDPA and two-group HSDPA, are developed to improve the performance of an ad hoc radio system through reducing the residual
energy, which in turn, should improve the data rate in HSDPA systems. The channel adaptive HSDPA removes the constraint on the number of channels used for
transmissions. The two-group allocation minimizes the residual energy in HSDPA
systems and therefore enhances the physical data rates in transmissions due to adaptive modulations. These proposed approaches provide better data rate than rates
achieved with the current HSDPA type of algorithm.
By considering both physical transmission power and data rates for defining the
cost function of the routing scheme, an energy-aware routing scheme is proposed
in order to find the routing path with the least energy consumption. By focusing
on the routing paths with low energy consumption, computational complexity is
significantly reduced. The data rate enhancement achieved by two-group resource
allocation further reduces the required amount of energy per bit for each path. With
a novel load balancing technique, the information bits can be allocated to each path
in such that a way the overall amount of energy consumed is minimized.
After loading bits to multiple routing paths, an end-to-end delay minimization
solution along a routing path is developed through studying MAC distributed coordination function (DCF) service time. Furthermore, the overhead effect and the
related throughput reduction are studied. In order to enhance the network throughput at the MAC layer, two MAC DCF-based adaptive payload allocation approaches
are developed through introducing Lagrange optimization and studying equal data
transmission period
Exploiting the power of multiplicity: a holistic survey of network-layer multipath
The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work
- …