36,758 research outputs found
An Experimental Investigation of Hyperbolic Routing with a Smart Forwarding Plane in NDN
Routing in NDN networks must scale in terms of forwarding table size and
routing protocol overhead. Hyperbolic routing (HR) presents a potential
solution to address the routing scalability problem, because it does not use
traditional forwarding tables or exchange routing updates upon changes in
network topologies. Although HR has the drawbacks of producing sub-optimal
routes or local minima for some destinations, these issues can be mitigated by
NDN's intelligent data forwarding plane. However, HR's viability still depends
on both the quality of the routes HR provides and the overhead incurred at the
forwarding plane due to HR's sub-optimal behavior. We designed a new forwarding
strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HR's
sub-optimal path selection. This paper describes our experimental investigation
into the packet delivery delay and overhead under HR as compared with
Named-Data Link State Routing (NLSR), which calculates shortest paths. We run
emulation experiments using various topologies with different failure
scenarios, probing intervals, and maximum number of next hops for a name
prefix. Our results show that HR's delay stretch has a median close to 1 and a
95th-percentile around or below 2, which does not grow with the network size.
HR's message overhead in dynamic topologies is nearly independent of the
network size, while NLSR's overhead grows polynomially at least. These results
suggest that HR offers a more scalable routing solution with little impact on
the optimality of routing paths
Openflow switching: data plane performance
AbstractâOpenFlow is an open standard that can be implemented in Ethernet switches, routers and wireless access points (AP). In the OpenFlow framework, packet forwarding (data plane) and routing decisions (control plane) run on different devices. OpenFlow switches are in charge of packet forwarding, whereas a controller sets up switch forwarding tables on a perflow basis, to enable flow isolation and resource slicing. We focus on the data path and analyze the OpenFlow implementation in Linux based PCs. We compare OpenFlow switching, layer-2 Ethernet switching and layer-3 IP routing performance. Forwarding throughput and packet latency in underloaded and overloaded conditions are analyzed, with different traffic patterns. System scalability is analyzed using different forwarding table size, and fairness in resource distribution is measured. I
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
Evaluation of tree-based routing Ethernet
Tree-based Routing (TRE) revisits Tree-based Routing Architecture for Irregular Networks (TRAIN)âa forwarding scheme based on a spanning tree that was extended to use some shortcut links.We propose its adaptation to Ethernet, using a new type of hierarchical Ethernet addresses and a procedure to assign them to bridges. We show that compared to RSTP, TRE offers improved throughput. The impact of transient loops in TRE is lower compared to the application of the classical shortest path routing protocols to Ethernet. Finally, TRE is self-configuring and its forwarding process is simpler and more efficient than in standard Ethernet and shortest path routing proposals.Publicad
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
Several social-aware forwarding strategies have been recently introduced in
opportunistic networks, and proved effective in considerably in- creasing
routing performance through extensive simulation studies based on real-world
data. However, this performance improvement comes at the expense of storing a
considerable amount of state information (e.g, history of past encounters) at
the nodes. Hence, whether the benefits on routing performance comes directly
from the social-aware forwarding mechanism, or indirectly by the fact state
information is exploited is not clear. Thus, the question of whether
social-aware forwarding by itself is effective in improving opportunistic
network routing performance remained unaddressed so far. In this paper, we give
a first, positive answer to the above question, by investigating the expected
message delivery time as the size of the net- work grows larger
Robust geometric forest routing with tunable load balancing
Although geometric routing is proposed as a memory-efficient alternative to traditional lookup-based routing and forwarding algorithms, it still lacks: i) adequate mechanisms to trade stretch against load balancing, and ii) robustness to cope with network topology change.
The main contribution of this paper involves the proposal of a family of routing schemes, called Forest Routing. These are based on the principles of geometric routing, adding flexibility in its load balancing characteristics. This is achieved by using an aggregation of greedy embeddings along with a configurable distance function. Incorporating link load information in the forwarding layer enables load balancing behavior while still attaining low path stretch. In addition, the proposed schemes are validated regarding their resilience towards network failures
Space Shuffle: A Scalable, Flexible, and High-Bandwidth Data Center Network
Data center applications require the network to be scalable and
bandwidth-rich. Current data center network architectures often use rigid
topologies to increase network bandwidth. A major limitation is that they can
hardly support incremental network growth. Recent work proposes to use random
interconnects to provide growth flexibility. However routing on a random
topology suffers from control and data plane scalability problems, because
routing decisions require global information and forwarding state cannot be
aggregated. In this paper we design a novel flexible data center network
architecture, Space Shuffle (S2), which applies greedy routing on multiple ring
spaces to achieve high-throughput, scalability, and flexibility. The proposed
greedy routing protocol of S2 effectively exploits the path diversity of
densely connected topologies and enables key-based routing. Extensive
experimental studies show that S2 provides high bisectional bandwidth and
throughput, near-optimal routing path lengths, extremely small forwarding
state, fairness among concurrent data flows, and resiliency to network
failures
Towards Loop-Free Forwarding of Anonymous Internet Datagrams that Enforce Provenance
The way in which addressing and forwarding are implemented in the Internet
constitutes one of its biggest privacy and security challenges. The fact that
source addresses in Internet datagrams cannot be trusted makes the IP Internet
inherently vulnerable to DoS and DDoS attacks. The Internet forwarding plane is
open to attacks to the privacy of datagram sources, because source addresses in
Internet datagrams have global scope. The fact an Internet datagrams are
forwarded based solely on the destination addresses stated in datagram headers
and the next hops stored in the forwarding information bases (FIB) of relaying
routers allows Internet datagrams to traverse loops, which wastes resources and
leaves the Internet open to further attacks. We introduce PEAR (Provenance
Enforcement through Addressing and Routing), a new approach for addressing and
forwarding of Internet datagrams that enables anonymous forwarding of Internet
datagrams, eliminates many of the existing DDoS attacks on the IP Internet, and
prevents Internet datagrams from looping, even in the presence of routing-table
loops.Comment: Proceedings of IEEE Globecom 2016, 4-8 December 2016, Washington,
D.C., US
Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks
In this paper, we evaluate available bandwidth as a routing metric for IEEE 802.15.4-based ad-hoc networks. The available bandwidth on a data forwarding path is an approximation of the forwarding pathâs residual data relaying capacity. High available bandwidth on a data forwarding path implies low data traffic load on the path, therefore data flows may experience low delay and high packet delivery ratio (PDR). Our aim is to evaluate available bandwidth as a routing metric. We present different available-bandwidth-based routing protocols for IEEE 802.15.40-based networks, namely: end-to-end available-bandwidth-based routing protocol (ABR), available bandwidth and contention-aware routing protocol (ABCR), and shortest hop-count and available-bandwidth-based opportunistic routing protocol (ABOR). Moreover, we also present variants of ABR and ABCR capable of distributing a flowâs data packets on multiple paths by maintaining the top K downstream nodes (the downstream nodes that advertised best data forwarding paths towards a sink node) corresponding to each sink node in a routing table. We focus on both single-sink and multi-sink networks. We performed extensive simulations, and the simulation results demonstrate that the available bandwidth routing metric shows better results when combined with a routing metric that helps to limit a data forwarding pathâs length, i.e., shortest hop-count or intra-flow contention count. For multi-path data forwarding towards the same sink node, and at high traffic volumes, the available bandwidth metric demonstrates best performance when combined with the shortest hop-count routing metric
- âŠ