scholarly journals A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Gaurantees

VLSI Design ◽  
2007 ◽  
Vol 2007 ◽  
pp. 1-11 ◽  
Author(s):  
Srinivasan Murali ◽  
David Atienza ◽  
Luca Benini ◽  
Giovanni De Micheli
Keyword(s):  
Power Consumption ◽  
Network Performance ◽  
Multipath Routing ◽  
Experimental Studies ◽  
Packet Delivery ◽  
Network Bandwidth ◽  
Routing Strategy ◽  
Communication Architectures ◽  
Multiple Paths ◽  
Single Path

Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today's NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in the network is reduced significantly, which translates to improved network performance or reduced network bandwidth requirements and power consumption. Multiple paths can also be utilized to achieve spatial redundancy, which helps in achieving tolerance against faults or errors in the NoC. A major problem with multipath routing is that packets can reach the destination in an out-of-order fashion, while many applications require in-order packet delivery. In this work, we present a multipath routing strategy that guarantees in-order packet delivery for NoCs. It is based on the idea of routing packets on partially nonintersecting paths and rebuilding packet order at path reconvergent nodes. We present a design methodology that uses the routing strategy to optimally spread the traffic in the NoC to minimize the network bandwidth needs and power consumption. We also integrate support for tolerance against transient and permanent failures in the NoC links in the methodology by utilizing spatial and temporal redundancy for transporting packets. Our experimental studies show large reduction in network bandwidth requirements (36.86% on average) and power consumption (30.51% on average) compared to single-path systems. The area overhead of the proposed scheme is small (a modest 5% increase in network area). Hence, it is practical to be used in the on-chip domain.

Research on QoS Multipath Routing on ACO Algorithm

2011 ◽  
Vol 219-220 ◽  
pp. 762-765
Author(s):  
Na Lin ◽  
Zhi Xue Shao ◽  
Xiang Yu Chen
Keyword(s):  
Ant Colony Algorithm ◽  
Traditional Approach ◽  
Multipath Routing ◽  
Network Resources ◽  
Data Simulation ◽  
Routing Schemes ◽  
Network Loading ◽  
Multiple Paths ◽  
Utilization Ratio ◽  
Single Path

Unlike traditional routing schemes that route all traffic along a single path, multipath routing strategies split the traffic among several paths in order to ease congestion. It has been widely recognized that multipath routing can be fundamentally more efficient than the traditional approach of routing along single paths. According to the characteristics of ant colony algorithm and the ideal of multipath routing. This paper proposes a QoS multipath routing on ACO Algorithm. ACO was improved in three aspects. As a ant selects the next hop, the utilization ratio of router's buffer queue is added into the criterion of selection, introducing the utilization ratio of link to update the global pheromone, selecting multiple paths to transfer data. Simulation experiments show the algorithm can achieve network loading balance, reduce the likelihood of congestion, and impove the utilization of network resources.

Adaptive Congestion Controlled Multipath Routing in VANET

2017 ◽  
Vol 9 (1) ◽  
pp. 43-68
Author(s):  
Anil D. Devangavi ◽  
Rajendra Gupta
Keyword(s):  
Routing Protocols ◽  
Multipath Routing ◽  
Data Communication ◽  
Node Mobility ◽  
Traffic Conditions ◽  
Vehicle Velocity ◽  
Multiple Paths ◽  
Prediction Mechanism ◽  
Single Path ◽  
Reliable Path

This article describes how in the VANET environment, routes are broken owing to node mobility. Moreover, the usage of wireless links for data communication leads to inherent unreliability and are error prone. Single path routing uses a prediction mechanism to compute a reliable path considering vehicle velocity and vehicle direction. Nevertheless, this methodology does not deal with major real-world traffic conditions. Hence, to address the aforementioned problems and to enhance reliability and fault tolerance, multipath routing protocols are employed. However existing multipath routing protocols even though compute multipath, only one path will be engaged in actual communication at any given time. Hence this work proposes Adaptive Congestion Controlled Multipath Routing in a VANET. The proposed work computes multiple paths from source to destination using cubic Bezier curves and more importantly, employs all/more than one path during the communication. The paths thus computed are adaptive in nature dependent upon the direction of mobility of source and destination vehicles.

scholarly journals SMART: A Secure Multipath Anonymous Routing Technique

2011 ◽  
pp. 117-122
Author(s):  
Prateek Jain ◽  
Rupsha Bagchi
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Multipath Routing ◽  
Distributed Data ◽  
Transmission Performance ◽  
Anonymous Routing ◽  
Multiple Paths ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Single Path

Multipath routing for mobile Ad hoc networks is a technique of concurrent management and utilization of multiple paths for transmitting distributed data evenly across the nodes instead of routing all the traffic along a single path, potentially resulting in longer lifetime along with the benefits of better transmission performance, fault tolerance, increased bandwidth and improved security. In this paper, a secure multipath anonymous routing protocol (abbreviated as SMART) has been proposed. SMART uses non cryptographic ways to help the source find the routes to the destination and dynamic onion routing to intimate the source about these routes. It includes a mechanism of key caching and defines a minimum battery protection threshold for each node to help increase the network lifetime to some extent. In effect SMART is an attempt to strike a balance between the anonymity, security and energy consumption in a network.

scholarly journals Hierarchical Method of Inter-Area Fast Rerouting

2017 ◽  
Vol 18 (2) ◽  
pp. 155-167 ◽  
Author(s):  
Oleksandr Lemeshko ◽  
Oleksandra Yeremenko ◽  
Olena Nevzorova
Keyword(s):  
Fault Tolerance ◽  
Communication Networks ◽  
Multipath Routing ◽  
Hierarchical Method ◽  
Routing Strategy ◽  
Single Path

Abstract In this paper, in order to increase the scalability and fault-tolerance of routing solutions the hierarchical method of inter-area fast rerouting in communication networks was presented. The method is based on the decomposed representation of the flow-based routing model with the introduction of the area interaction conditions to ensure connectivity of the inter-area routes. The model includes conditions for border routers protection, adapted for both single path and multipath routing. During the research it was established that the efficiency of the proposed method in terms of the speed of the coordinating procedure convergence was most influenced by the number of border routers and the implemented routing strategy.

Performance Evaluation of Fiber Wireless (FiWi) Access Network using Position Optimization of ONUs

2020 ◽  
Vol 10 ◽  
Author(s):  
Nitin Chouhan ◽  
Uma Rathore Bhatt ◽  
Raksha Upadhyay
Keyword(s):  
Power Consumption ◽  
Optimization Algorithm ◽  
Optical Network ◽  
Access Network ◽  
Whale Optimization Algorithm ◽  
Wireless Access ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Whale Optimization ◽  
Wireless Access Network

: Fiber Wireless Access Network is the blend of passive optical network and wireless access network. This network provides higher capacity, better flexibility, more stability and improved reliability to the users at lower cost. Network component (such as Optical Network Unit (ONU)) placement is one of the major research issues which affects the network design, performance and cost. Considering all these concerns, we implement customized Whale Optimization Algorithm (WOA) for ONU placement. Initially whale optimization algorithm is applied to get optimized position of ONUs, which is followed by reduction of number of ONUs in the network. Reduction of ONUs is done such that with fewer number of ONUs all routers present in the network can communicate. In order to ensure the performance of the network we compute the network parameters such as Packet Delivery Ratio (PDR), Total Time for Delivering the Packets in the Network (TTDPN) and percentage reduction in power consumption for the proposed algorithm. The performance of the proposed work is compared with existing algorithms (deterministic and centrally placed ONUs with predefined hops) and has been analyzed through extensive simulation. The result shows that the proposed algorithm is superior to the other algorithms in terms of minimum required ONUs and reduced power consumption in the network with almost same packet delivery ratio and total time for delivering the packets in the network. Therefore, present work is suitable for developing cost-effective FiWi network with maintained network performance.

scholarly journals Exploring a New Adaptive Routing Based on the Dijkstra Algorithm in Optical Networks-on-Chip

Micromachines ◽  
2021 ◽  
Vol 12 (1) ◽  
pp. 54
Author(s):  
Yan-Li Zheng ◽  
Ting-Ting Song ◽  
Jun-Xiong Chai ◽  
Xiao-Ping Yang ◽  
Meng-Meng Yu ◽  
...  
Keyword(s):  
Power Consumption ◽  
Power Control ◽  
Optical Networks ◽  
Output Power ◽  
Network Performance ◽  
Transmission Loss ◽  
Adaptive Routing ◽  
Dijkstra Algorithm ◽  
Networks On Chip ◽  
On Chip

The photoelectric hybrid network has been proposed to achieve the ultrahigh bandwidth, lower delay, and less power consumption for chip multiprocessor (CMP) systems. However, a large number of optical elements used in optical networks-on-chip (ONoCs) generate high transmission loss which will influence network performance severely and increase power consumption. In this paper, the Dijkstra algorithm is adopted to realize adaptive routing with minimum transmission loss of link and reduce the output power of the link transmitter in mesh-based ONoCs. The numerical simulation results demonstrate that the transmission loss of a link in optimized power control based on the Dijkstra algorithm could be maximally reduced compared with traditional power control based on the dimensional routing algorithm. Additionally, it has a greater advantage in saving the average output power of optical transmitter compared to the adaptive power control in previous studies, while the network size expands. With the aid of simulation software OPNET, the network performance simulations in an optimized network revealed that the end-to-end (ETE) latency and throughput are not vastly reduced in regard to a traditional network. Hence, the optimized power control proposed in this paper can greatly reduce the power consumption of s network without having a big impact on network performance.

scholarly journals Bandwidth-Aware Rescheduling Mechanism in SDN-Based Data Center Networks

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1774
Author(s):  
Ming-Chin Chuang ◽  
Chia-Cheng Yen ◽  
Chia-Jui Hung
Keyword(s):  
Data Center ◽  
Completion Time ◽  
Network Performance ◽  
Data Locality ◽  
Task Completion ◽  
Data Center Networks ◽  
Task Completion Time ◽  
Data Packets ◽  
Network Bandwidth ◽  
Data Process

Recently, with the increase in network bandwidth, various cloud computing applications have become popular. A large number of network data packets will be generated in such a network. However, most existing network architectures cannot effectively handle big data, thereby necessitating an efficient mechanism to reduce task completion time when large amounts of data are processed in data center networks. Unfortunately, achieving the minimum task completion time in the Hadoop system is an NP-complete problem. Although many studies have proposed schemes for improving network performance, they have shortcomings that degrade their performance. For this reason, in this study, we propose a centralized solution, called the bandwidth-aware rescheduling (BARE) mechanism for software-defined network (SDN)-based data center networks. BARE improves network performance by employing a prefetching mechanism and a centralized network monitor to collect global information, sorting out the locality data process, splitting tasks, and executing a rescheduling mechanism with a scheduler to reduce task completion time. Finally, we used simulations to demonstrate our scheme’s effectiveness. Simulation results show that our scheme outperforms other existing schemes in terms of task completion time and the ratio of data locality.

scholarly journals Cooperation and information replication in wireless networks

2016 ◽  
Vol 374 (2062) ◽  
pp. 20150123 ◽  
Author(s):  
Konstantinos Poularakis ◽  
Leandros Tassiulas
Keyword(s):  
Network Performance ◽  
Access Network ◽  
Network Architectures ◽  
Backbone Networks ◽  
Network Bandwidth ◽  
Multicast Service ◽  
Radio Access ◽  
Maximum Benefit ◽  
Wireless Medium ◽  
Cell Tower

A significant portion of today's network traffic is due to recurring downloads of a few popular contents. It has been observed that replicating the latter in caches installed at network edges—close to users—can drastically reduce network bandwidth usage and improve content access delay. Such caching architectures are gaining increasing interest in recent years as a way of dealing with the explosive traffic growth, fuelled further by the downward slope in storage space price. In this work, we provide an overview of caching with a particular emphasis on emerging network architectures that enable caching at the radio access network. In this context, novel challenges arise due to the broadcast nature of the wireless medium, which allows simultaneously serving multiple users tuned into a multicast stream, and the mobility of the users who may be frequently handed off from one cell tower to another. Existing results indicate that caching at the wireless edge has a great potential in removing bottlenecks on the wired backbone networks. Taking into consideration the schedule of multicast service and mobility profiles is crucial to extract maximum benefit in network performance.

scholarly journals Highly Reliable Decision-Making Using Reliability Factor Feedback for Factory Condition Monitoring via WSNs

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Zafar Iqbal ◽  
Heung-No Lee ◽  
Saeid Nooshabadi
Keyword(s):  
Decision Making ◽  
Power Consumption ◽  
Cluster Head ◽  
Base Station ◽  
False Alarms ◽  
Delivery Ratio ◽  
Probability Of Error ◽  
Reliability Factor ◽  
Packet Delivery ◽  
Low Level

Cooperation among sensors in a wireless sensor network, deployed for industrial monitoring in an indoor scenario, is a topic of interest in the smart factory and smart city research. The indoor wireless communication channel is very harsh and the observations of all the sensors cannot be sent reliably to the base station. Failure to transmit correct sensing results to the base station may result in false alarms or missed detection of events. Therefore, we propose a cooperation scheme for the wireless sensors to send the data reliably to the base station. Our aim is to increase the reliability of the received information, reduce the probability of error, lower the overall power consumption, and keep the latency to an acceptable low level. We propose a reliability factor feedback algorithm to adjust the weight of unreliable sensors in the decision-making process. The proposed scheme is analyzed based on its latency, power consumption, and packet delivery ratio. Our results show significant improvement in the reliability of the received data, improved packet delivery, and reduced false alarm ratio for full repetition and cluster head-based cooperation. The power consumption and latency in data transmission are also kept to an acceptable low level.

A Novel Implementation of TCP Vegas by UsingA Fuzzy-Threshold Base Algorithm to Improve Performance of Optical Networks

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Reza Poorzare ◽  
Siamak Abedidarabad
Keyword(s):  
Fuzzy Logic ◽  
Optical Networks ◽  
Network Performance ◽  
Optical Burst Switching ◽  
Window Size ◽  
Congestion Window ◽  
Improve Performance ◽  
Burst Switching ◽  
Packet Delivery ◽  
Tcp Vegas

AbstractThere is a misunderstanding in Optical Burst Switching (OBS) networks about the congestion status in the network that can cause a reduction in the performance of the networks. OBS networks are bufferless in their nature so when a burst drop happens in the network it can be because of the congestion or contention in the network but TCP cannot distinguish it is due to the congestion or contention. TCP wrongly decreases the congestion window size (cwnd) and causes significant reduction of the network performance. In this paper we are trying to employ a new algorithm by using fuzzy logic and some thresholds to divide the network into several areas then we can solve the problem. This new scheme can help us to distinguish a burst drop is because of the congestion or a burst contention in the network. Extensive simulative studies show that the proposed algorithm outperforms TCP Vegas in terms of throughput and packet delivery count.

Sign in / Sign up

Export Citation Format

Share Document