We introduce a XOR-based source routing (XSR) scheme as a novel approach to enable fast forwarding and low-latency communications. XSR uses linear encoding operation to both 1)~build the path labels of unicast and multicast data transfers; 2)~perform fast computational efficient routing decisions compared to standard table lookup procedure without any packet modification all along the path. XSR specifically focuses on decreasing the complexity of forwarding router operations. This allows packet switches (e.g, link-layer switch or router) to perform only simple linear operations over a binary vector label which embeds the path. XSR provides the building blocks to speed up the forwarding plane and can be applied to different data planes such as MPLS or IPv6. Compared to recent approaches based on modular arithmetic, XSR computes the smallest label possible and presents strong scalable properties allowing to be deployed over any kind of core vendor or datacenter networks. At last but not least, the same computed label can be used interchangeably to cross the path forward or reverse in the context of unicast communication.
Integration of a software router into embedded systems is obtained possibility of the most modern routers, at a much more affordable price. Transfer services TV and radio signals over the IP network are only activated by using multicast 1 protocol for routing. Multicast routing 2 is currently a feature of only costly hardware solutions. The XORP open-source platform offers multicast routing through a software router, with the ability to integrate into cheap embedded platforms. ---- Integracijom softverskog rutera u embedded sisteme dobija se mogućnost najsavremenijih rutera, po znatno pristupa…
Dynamic Source Routing (DSR) is an efficient on-demand routing protocol for mobile ad-hoc networks (MANET). It depends on two main procedures: Route Discovery and Route Maintenance. Route discovery is the procedure used at the source of the packets to discover a route to the destination. Route Maintenance is the procedure that discovers link failures and repairs them. Route caching is the sub procedure serviceable to avoid the demand for discovering a route or to reduce route discovery delay before every data packet is sent. The goal of this paper is to evaluate the performance of DSR. Differe…
Data center networks need load balancing mechanisms to dynamically serve a large number of flows with different service requirements. However, traditional load-balancing approaches do not allow the full utilization of network resources in a simple, programmable, and scalable way. In this context, this paper proposes RDNA Balance that exploits elephant flow isolation and source routing in core nodes. Flow classification operations are performed on the edge using features of the OpenFlow protocol. The results show that with this approach it is possible to provide a simple, scalable, and programm…
Source location privacy (SLP) protection is an emerging research topic in wireless sensor networks (WSNs). Because the source location represents the valuable information of the target being monitored and tracked, it is of great practical significance to achieve a high degree of privacy of the source location. Although many studies based on phantom nodes have alleviates the protection of source location privacy to some extent. It is urgent to solve the problems such as complicate the ac path between nodes, improve the centralized distribution of Phantom nodes near the source nodes and reduce t…
In this paper, we study the downward routing for network control/actuation in large-scale and heterogeneous wireless sensor networks (WSNs) and Internet of Things (IoT). We propose the Opportunistic Source Routing (OSR), a scalable and reliable downward routing protocol for WSNs/IoT. OSR introduces opportunistic routing into traditional source routing based on the parent set of a node's upward routing in data collection, significantly addressing the drastic link dynamics in low-power and lossy WSNs. We devise a novel adaptive Bloom filter mechanism to effectively and efficiently encode a downw…
Information-Centric Networking is still an incomplete paradigm which introduces a large variety of new topics and approaches over the traditional networking. Since it is a relatively new concept which promises for easier and faster data access many aspects of it have been studied intensely in recent years. Nonetheless, load balancing is one of the least focused but high potency, open-ended areas. The aim of this project is to present an alternative technique to load balancing in the domain of pre-suggested routing method LSCR (Link State Content Routing). We suggested multi-path interest and m…
Multipath routing in Mobile Ad Hoc Network (MANET) plays a significant concern for secured data transmission by avoiding the attack nodes in the network. In order to overcome such limitations, a Winnow Trust based Multipath Route Discovery (WT-MRD) Mechanism is proposed. It constructs multiple paths from source to destination with higher security and lesser time. Initially, the trust value of each node is calculated based on the node cooperative count, data packet forwarding rate and packet drop rate by Neighbor Node-based Trust Calculation (NN-TC) Model. After calculating the trust value, the…
Flying ad hoc network (FANET) provides portable and flexible communication for many applications and possesses several unique design challenges; a key one is the successful delivery of messages to the destination, reliably. For reliable communication, routing plays an important role, which establishes a path between source and destination on the basis of certain criteria. Conventional routing protocols of FANET generally use a minimum hop count criterion to find the best route between source and destination, which results in lower latency with the consideration that there is single source/dest…
Quantum networks are gaining momentum in finding applications in a wide range of domains. However, little research has investigated the potential of a quantum network framework to enable highly reliable communications. The goal of this work is to investigate and design the multiple-entanglement routing framework, namely k-entangled routing. In particular, the $k$-entangled routing will enable k paths connecting all demands (source-destination pairs) in the network. To design the $k$-entangled routing, we propose two algorithms that are called Sequential Multi-path Scheduling Algorithm and Min-…
We propose to raise network domain to the first-class citizen in packet routing and forwarding. By making domain explicit in packet header, it can be held responsible for committed services and quality of service. Since the service is easier to be monitored, verified, and compensated, a new business model catering for emerging cross-domain, high-value, and performance-sensitive applications can be fostered. The domain-level routing and forwarding essentially create a L3.5 in the network protocol stack. We extend IPv6 with new routing headers to support two types of forwarding approaches. One i…
The opportunistic routing has great advantages on improving packet delivery probability between the source node and candidate forwarding set. For improving and reducing energy consumption and network interference, in this paper, we propose an efficient and reliable transmission power control based opportunistic routing (ERTO) for wireless ad hoc networks. In ERTO, the network interference and fading, which are critical to routing performances but not taken into account in previous works, are considered during the prediction of. The, the expected energy consumption, and the relationship between…
This paper introduces an efficient reactive routing protocol considering the mobility and the reliability of a node in Cognitive Radio Sensor Networks (CRSNs). The proposed protocol accommodates the dynamic behavior of the spectrum availability and selects a stable transmission path from a source node to the destination. Outlined as a weighted graph problem, the proposed protocol measures the weight for an edge the measuring the mobility patterns of the nodes and channel availability. Furthermore, the mobility pattern of a node is defined in the proposed routing protocol from the viewpoint of …
Cognitive radio technology offers an important function in the efficient utilization of the radio spectrum. Besides, it is expected that CR-enabled vehicular ad-hoc networks (CR-VANETs) enrich the communication performance of the existing vehicular networks (VANETs). However, to ensure efficient performance in a multi-hop communication, the routing protocol in CR-VANETs needs to consider the autonomous mobility of the vehicles as well as the stochastic availability of the channels. Hence, this paper introduces a spectrum-aware mobility pattern based reactive routing protocol for CR-VANET. The …
Vel Tech University（Vel Tech大学）；Indian Institute of Technology, Kharagpur（印度理工学院卡拉格普尔分校）
In underwater acoustic sensor networks (UWASN), energy-reliable data transmission is a challenging task. This is due to acoustic transmission disturbances caused by excessive noise, exceptionally long propagation delays, a high bit error rate, limited bandwidth capability, and interference. One of the most important issues of UWASN for research is how to extend the life span of data transmission. Data transfer from a source node to a destination node in UWASN is a complicated topic for researchers. Many routing algorithms, such as vector base forwarding and depth base routing, have been develo…
Penn State University（宾夕法尼亚州立大学）；Nokia Bell Labs（诺基亚贝尔实验室）
This paper explores a deep reinforcement learning approach applied to the packet routing problem with high-dimensional constraints instigated by dynamic and autonomous communication networks. Our approach is motivated by the fact that centralized path calculation approaches are often not scalable, whereas the distributed approaches with locally acting nodes are not fully aware of the end-to-end performance. We instead hierarchically distribute the path calculation over designated nodes in the network while taking into account the end-to-end performance. Specifically, we develop a hierarchical …
