Traffic Allocation: An efficient adaptive network-on-chip routing algorithm design

Through the research on the existing wireless sensor network (WSN) and its security technologies, this paper presents a design of the WSN-based secure routing algorithm. This design uses the existing routing algorithm as chief source, adding the security guidance strategy, introducing the location key information, to enhance the security performance of WSN routing. The improved routing algorithm makes the WSN routing achieve better anti-attack in the case of little overhead increase, therefore has high practical value.

K paths ordering algorithm (KPOA) is presented for multi-protocol label switch traffic engineering. For optional paths of each ingress-egress pair, the algorithm used a learning mechanism, combined offline and online routing, and chose the LSP in terms of the residual bandwidth. The main objective of KPOA is to prevent the neglect of non-critical link which is important, and avoid choosing the overlong path, then provide an effective guarantee of QoS. The simulation shows the algorithm has improved greatly compared to both CSPF and MIRA in number of rejected requests, total bandwidth of accepted requests and computation time, is an efficient and quick routing algorithm.

This research paper focuses on the development and analysis of a web-based system which is designed to study road traffic conditions and their routing behaviour in a dynamic environment. Nowadays Traffic congestion has become a major issue in urban areas due to the increasing number of vehicles and frequent changes in road conditions such as congestion, accidents, and peak-hour delays. Efficient route planning during those conditions requires routing approaches that can calculate traffic variations in real time. In this thesis, the road network is modelled as a weighted graph, where intersections are represented as nodes and road segments are represented as edges with weights corresponding to traffic conditions. The proposed web application allows users to interact with the road network by selecting source and destination points. They can also modify traffic conditions, and routing techniques and observe how routes change dynamically. Both static shortest path computation and dynamic routing approaches are implemented to study their behaviour and performance under varying traffic scenarios. The study provides visual representation of road networks and routing paths and also their performance metrics such as computation time and route cost. Thus it helps understand the clear comparison between static and dynamic routing methods and the impact of traffic changes depending on routing decisions. The developed web application serves as an analytical and educational tool for studying road traffic analysis and routing algorithms. The study shows the usefulness of web-based platforms in visualizing traffic behaviour and evaluating routing performance. But the current approach is limited to simulated data. This leaves room for future work that could improve the system by integrating real-world traffic data and explore more advanced routing strategies.

System-Level simulator is proposed to determine the ability of synchronous and asynchronous NoCs to alleviate the process variation effect. Throughput variation and different delay components variation are provided by the newly developed framework. System-Level simulation shows similarities with circuit-level simulation in terms of behavior and performance variation trend when moving from one technology node to another. Clock skew significantly degrades synchronous NoCs performance. Clock skew is more obvious with process variation. Despite the handshaking overhead, asynchronous NoC may be more immune to process variation than synchronous networks. PV-aware routing algorithm reduces the performance degradation to 8.3% and 11.4% for 45nm and 32nm asynchronous NoCs respectively. Using different traffic workloads and PV-unaware routing algorithm, synchronous networks lose on average 17.7% and 27.8% of nominal throughput for 45nm and 32nm technologies, respectively due to process variation. Whereas, asynchronous NoC throughput degradation is about 7.4% and 11.5% for 45nm and 32nm, respectively. In addition to technology scaling, NoC scaling also affects the throughput degradation. 256-core NoC shows the highest throughput degradation of 16% and 22% for asynchronous NoC for 45nm and 32nm technologies respectively.

We propose a simple multicast traffic split routing for packet switched networks (Internet). We propose a mathematical model that maximizes the reward generated by successfully forwarding packets from source to destinations. Using this model, we show that in order to reduce packet loss, while keeping the delay bounded: 1) trees should be as small as possible (typically spanning trees) and 2) trees should be as disjoint as possible. We also show that these two routing rules are independent of the traffic forecast which makes them of practical interest. We then propose a simple traffic split routing algorithm based on these two rules. Numerical results show that traffic split routing outperforms shortest path routing in terms of packet loss while being comparable in terms of queuing delay.

Turn-model is a classical method for designing partially adaptive routing algorithms without virtual channels, and can also be the basis of fully adaptive routing algorithms. We propose a novel scheme, Selective Extension of Routing Algorithms based on turn model (SERA), which alleviates restrictions on turn and path selections if possible without adding any new buffers or virtual channels. SERA can improve adaptivity of the original routing algorithms, and maintain the deadlock-free property. Thus, SERA is an important extension of the previous turn model theory. To present the effectiveness of SERA in adaptive algorithms, we redesign two existing routing algorithms, Odd-Even and LEAR. Simulation results show that the SERA scheme achieves an average delay reduction of 6% compared to the original routing algorithms.

Routing algorithms for large-scale sensor networks should be capable of finding energy efficient paths to prolong the lifetime of the networks in a decentralized manner. With this respect, Ant System has several proper characteristics for routing algorithm in large-scale wireless sensor networks. First, its distributed mechanism enables routing algorithm to find a solution with only local information and be robust for uncertainties in wireless sensor networks. Second, the framework of the Ant System is proper to solve dynamic problems such as routing problem. Transition probability in Ant System can be used to estimate how good a given routing path is. Capturing these features, this work proposes two Ant Systems based routing algorithms, which are AS-RWSNs (Ant System for Routing in Wireless Sensor Networks) and SAAS-RWSN (Structure-Aware AS-RWSN). The AS-RWSN applies the original Ant System to routing algorithm for wireless sensor network and SAAS-RSN upgrades AS-RWSN with considering properties of network structure such as degree of node. In SAAS-RSN, sensors with high node degree have high data traffic since they have more routing paths. Consequently, SAAS-RSN achieves an energy balance over sensor network through this routing scheme. We demonstrate the effectiveness of the proposed algorithms by comparing three existing routing algorithms.

Virtual Private Networks (VPN) constitute a particular class of shared networks. In such networks, the resources are shared among several customers. The management of these resources requires a high level of automation to obtain the dynamics necessary for the well-functioning of a VPN. In this paper, we consider the problem of a network operator who owns the physical infrastructure and who wishes to deliver VPN service to his customers. These customers may be Internet Service providers, large corporations and enterprises. We propose a new routing approach referred to as Traffic Split Routing (TSR) which splits the traffic as fairly as possible between the network links. We show that TSR outperforms Shortest Path Routing (SPR) in terms of the number of admitted VPN and in terms of Quality of Service.

Nobody in this world wants to be held hostage in a traffic jam for hours and hours. The need to have efficient traffic flow in our roads cannot be overemphasized. It is in this understanding that this paper delves into the study and implementation of a suitable algorithm for traffic routing. The implementation is based on graph theory, where a road network map is first converted to a graph with nodes and edges where the edges represent the roads and the nodes represent the various road intersections. The roads are given various weights depending on their distance and traffic density, and the time a motorist would take to move from one point to another is estimated. A suitable routing algorithm, which in this case is the Dijkstra’s algorithm is applied on the weighted graph.

Underwater sensor networks (UWSNs) have become a hot research topic because of their various aquatic applications. As the underwater sensor nodes are powered by built-in batteries which are difficult to replace, extending the network lifetime is a most urgent need. Due to the low and variable transmission speed of sound, the design of reliable routing algorithms for UWSNs is challenging. In this paper, we propose a Q-learning based delay-aware routing (QDAR) algorithm to extend the lifetime of underwater sensor networks. In QDAR, a data collection phase is designed to adapt to the dynamic environment. With the application of the Q-learning technique, QDAR can determine a global optimal next hop rather than a greedy one. We define an action-utility function in which residual energy and propagation delay are both considered for adequate routing decisions. Thus, the QDAR algorithm can extend the network lifetime by uniformly distributing the residual energy and provide lower end-to-end delay. The simulation results show that our protocol can yield nearly the same network lifetime, and can reduce the end-to-end delay by 20–25% compared with a classic lifetime-extended routing protocol (QELAR).

In recent years, data center network is used for transmission, storage and processing of big data, which plays an important role for applications in cloud computing and CDN distribution. Network topology and routing algorithm are its core research content and key technical issues. The traditional network topology is difficult to guarantee the quality of service in scalability and fault tolerance. The server-centric data center network topology can ensure the scale of the data center network by recursively increasing the number of network nodes and links. relative to the Dcell, BCube, and BCCC typical network topology, PTNet network as a typical representative of a new type of the server-centric data center network topology, which has more advantages in scalability, fault tolerance and so on. Multicast and broadcast in data center network have more application scenarios and use value. For example, the video conference online, multimedia remote education and other development are inseparable from the application and promotion of network multicast and broadcast. So it is necessary to research the routing algorithms of multicast and broadcast in the network. Based on the deep research of PTNet network, this paper analyzes and researches the network topology, multicast and broadcast routing algorithm.

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks, proposed by the author (1991, 1993), supplies sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies were proposed. Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. A tree-like routing scheme is not suitable for hardware-supported multicast in wormhole networks because it produces many headers for each message, drastically increasing the probability of a message being blocked. A path-based multicast routing model was proposed by Lin and Ni (1991) for multicomputers with 2D-mesh and hypercube topologies. In this model, messages are not replicated at intermediate nodes. This paper develops the theoretical background for the design of deadlock-free adaptive multicast routing algorithms. This theory is valid for wormhole networks using the path-based routing model. It is also valid when messages with a single destination and multiple destinations are mixed together. The new channel dependencies produced by messages with several destinations are studied. Also, two theorems are proposed, developing conditions to verify that an adaptive multicast routing algorithm is deadlock-free, even when there are cyclic dependencies between channels. As an example, the multicast routing algorithms of Lin and Ni are extended, so that they can take advantage of the alternative paths offered by the network.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

The development of sound routing strategies for dynamic traffic routing is a complex task that requires the use of an automated traffic-routing decision support system (DSS). In this study, heruistic search algorithms were used to build prototype DSSs for on-line traffic routing. Specifically, two DSSs were developed for a real-world highway network: the first was developed by using simulated annealing (SA) and the second was constructed by using genetic algorithms (GAs). The use of such algorithms allows more accurate modeling of traffic dynamics than is possible by traditional analytical techniques. To evaluate and compare the performances of the developed DSSs, a test set consisting of 10 randomly generated problems was used. Results demonstrated that the DSSs are capable of yielding high-quality solutions in a reasonable amount of time. In addition, for on-line traffic routing, SA tends to perform better than GAs.

This paper presents a model for designing partially adaptive logic-based distributed routing algorithms. Unlike the previous methods, the Lattice-based Turn Model associates turn prohibitions with the points of different full-rank integer lattices. Due to the generality of the proposed model, existing approaches can be considered a subset of the solution space identified by this work. Morover, we propose three theorems that are instrumental to the design of lattice-based routing algorithms. In particular, the second theorem gives a necessary and sufficient condition to prove that a lattice-based routing algorithm is deadlock-free as long as the lattice basis meets certain requirements. Based on the proposed model, a novel routing algorithm, called lattice-based routing algorithm (LBRA), is presented. Simulation results exhibit encouraging performance improvements over state-of-the-art approaches when considering real and synthetic benchmarks. For instance, average 71 and 18 percent latency reductions are observed under transpose1 traffic compared to, respectively, Odd-Even and Repetitive Turn Model routing algorithms. Furthermore, LBRA achieves up to 38 and 17 percent performance improvement under real traffic as compared to Odd-Even and Repetitive Turn Model routing algorithms.

Telecom operators' proliferation, caused by the liberation in the provision of communication services in the European domain, has led in the emergence of demand for small, cost effective core network elements capable of performing both access communication, as well as, traffic routing towards various technology backbones. Bulky equipment is no longer attracting operators' interest, for a number of reasons, summarized in downsize ability (monolithic support of millions of users on a single box is not the case anymore for start up operators), scalability and flexibility to seamlessly integrate advanced services. Especially in the case of UMTS, IP communications are realized over a mixture of heterogeneous transportation technologies often resulting to replication of redundant functions, which limits network performance, complicates its maintenance, reduces scalability and increases operational costs. This paper presents a flexible gateway architecture, which can be accommodated on the access interfaces of UMTS networks to enable realization of generic communication interfaces towards core network databases, supporting user access and traffic routing functions, for improved IP communications performance, enhances UMTS network scalability and reduces maintenance costs. Architectural modularity is achieved by integrating the various database technologies within a common network architecture utilising Storage Area Networks technology.