Single Routing Path Research Articles

Big data over wireless pipe-Path: Queuing model for multi-Directional radio links

Big data needs to be delivered to remote devices via wireless links in many applications such as North Pole monitoring, UAV communications, smart city crowd-sourcing, etc. Single routing path may not be able to meet the ultra-high-throughout requirements of wireless big data delivery. A pipe-like path consisting of closely coupled links (forming a bundle) is more suitable to big data transmissions. The queuing model for such a coupled routing pipe is important to network congestion diagnosis and avoidance. Particularly, the queuing analysis between neighboring hops can help to analyze the pipe traffic accumulation dynamics. Our pioneering work presented here first develops a queuing model for a single node of the pipe. We design a full Markov-Chain-based queuing model for bulk arrival, bulk service queues with multiple vacations. We then extend such a single node queuing model to the pipe-based queuing scenarios, and deduce the closed-form equations for the typical queue statistics such as the service delay. The numerical results can serve as the guidelines for big data transmission protocols. Comprehensive, accurate simulations have been conducted to verify the correctness of our proposed pipe queuing models.

Transient Multipath routing protocol for low power and lossy networks

RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

Reverse-trace routing scheme in content centric networking

Content center networking (CCN) is one of the most promising future network architectures. Current researches on CCN routing scheme mainly focus on finding the best single routing path, which may induce to low usage of the in-network caches. In order to overcome this problem, a reverse trace routing (RTR) scheme is proposed in this paper, in which Interest packet is sent to the edge-cache along with the reverse trace of the corresponding former Data packet. By doing this, the Interest packets will have better chances to be routed to the promising in-network caches before reaching the source server, which could increase the in-network hit rate, while decrease the server stress. The simulation results show clearly that the RTR scheme decreases the source server load, while reducing the mean hops of entire data retrieval process under certain circumstances.

Dynamic Multi-Path Service Provisioning under Differential Delay Constraint in Elastic Optical Networks

Optical orthogonal frequency-division multiplexing (O-OFDM) technology has the elastic feature of allocating spectrum resources based on subcarrier slots with bandwidths at a few GHz or even narrower. This feature enables us to utilize link capacity more efficiently by splitting a connection's traffic over multiple routing paths. In this paper, we propose a novel dynamic multi-path provisioning algorithm for O-OFDM based elastic optical networks. The algorithm tries to set up dynamic connections with single-path routing in a best-effort manner. When a connection cannot be served with a single routing path, the algorithm uses an auxiliary-graph based approach to calculate a multi-path provisioning scheme based on two parameters, i.e., the differential delay upper-bound and the bandwidth allocation granularity. Simulation results indicate that compared with several existing single-path provisioning algorithms, the proposed algorithm provides lower bandwidth blocking probability and achieves 10-18% improvement on average network throughput.