Dijkstra and Bellman- Ford routing algorithms were applied to the CUDI (Consorcio Universitario para el Desarrollo de Internet 2 - University's Consortium for the Development of Internet 2) advanced network backbo...
详细信息
Dijkstra and Bellman- Ford routing algorithms were applied to the CUDI (Consorcio Universitario para el Desarrollo de Internet 2 - University's Consortium for the Development of Internet 2) advanced network backbone infrastructure. Some calculations and considerations are discussed in a very didactic way to understand how to apply both algorithms to a real advanced network backbone infrastructure such as the CUDI network, but these algorithms could also be applied to other advanced networks. A step by step simulation and emulation were developed in order to get an approach to actual function for CUDI, where OSPF V2 protocol is used, which uses the Dijkstra algorithm for routing.
After a discussion on hybrid optical-electronic networks, the so-called translucent networks, this article presents routing algorithms for an efficient use of resources in dynamic traffic demands.
After a discussion on hybrid optical-electronic networks, the so-called translucent networks, this article presents routing algorithms for an efficient use of resources in dynamic traffic demands.
Dynamic traffic is becoming important in WDM networks. In the transition towards full dynamic traffic, WDM networks optimized for a specific set of static connections will most likely also be used to support on-demand...
详细信息
Dynamic traffic is becoming important in WDM networks. In the transition towards full dynamic traffic, WDM networks optimized for a specific set of static connections will most likely also be used to support on-demand lightpath provisioning. Our paper investigates the issue of routing of dynamic connections in WDM networks which are also loaded with high-priority protected static connections. By discrete-event simulation we compare various routing strategies in terms of blocking probability and we propose a new heuristic algorithm based on an occupancy cost function which takes several possible causes of blocking into account. The behavior of this algorithm is tested in well-known case-study mesh networks, with and without wavelength conversion. Moreover, Poissonian and non-Poissonian dynamic traffics are considered.
In this paper, we propose and analyze three routing algorithms for anycast packets: i) source-destination based routing with weighted random selection (SD/WRS), ii) destination based routing with weighted random selec...
详细信息
ISBN:
(纸本)0818686510
In this paper, we propose and analyze three routing algorithms for anycast packets: i) source-destination based routing with weighted random selection (SD/WRS), ii) destination based routing with weighted random selection (D/WRS), and iii) the shortest shortest path first (SSPF) algorithms. The SSPF algorithm is a simple extension to the traditional SPF algorithm for routing unicast packets. The SD/WRS and D/WRS algorithms explicitly take into account characteristics of anycast message traffic and its recipient group. As a result, our simulation study shows that both the SD/WRS and D/WRS algorithms perform much better than SSPF in terms of average end-to-end packet delay. In particular, SD/WRS performs very close to a dynamic optimal algorithm in most cases. Our algorithms are simple, efficient, and compatible with the most of existing routing technologies. We also formally prove the loop free and correctness properties for our algorithms.
In this paper, we study the routing selection in partial deployment of SAVA nodes in the trustworthy Internet. We propose and compare three routing algorithms, i.e., Shortest-Path Algorithm (SPA), SAVA based Shortest-...
详细信息
ISBN:
(纸本)9781427629807
In this paper, we study the routing selection in partial deployment of SAVA nodes in the trustworthy Internet. We propose and compare three routing algorithms, i.e., Shortest-Path Algorithm (SPA), SAVA based Shortest-Path Algorithm (SSPA), and SAVA based Shortest-Path Algorithm with Load Balancing (SSPALB). Beside analytical results, we run simulations which met our expectations.
Wireless Sensor Networks have become an active research topic in the last years. The routing problem is a very important part in this kind of networks that need to be considered in order to maximize the network life t...
详细信息
ISBN:
(纸本)9783642167720
Wireless Sensor Networks have become an active research topic in the last years. The routing problem is a very important part in this kind of networks that need to be considered in order to maximize the network life time. As the size of the network increases, routing becomes more complex due the amount of sensor nodes in the network. Sensor nodes in Wireless Sensor Networks are very constrained in memory capabilities, processing power and batteries. Ant Colony Optimization based routing algorithms have been proposed to solve the routing problem trying to deal with these constrains. We present a comparison of two Ant Colony-based routing algorithms, taking into account current amounts of energy consumption under different scenarios and reporting the usual metrics for routing in wireless sensor networks.
This paper presents a planned routing algorithm (PRA) and a hierarchical routing algorithm (HRA) for ATM networks. The PRA can establish the multicast tree with the presence of bandwidth and delay constraints. The HRA...
详细信息
This paper presents a planned routing algorithm (PRA) and a hierarchical routing algorithm (HRA) for ATM networks. The PRA can establish the multicast tree with the presence of bandwidth and delay constraints. The HRA can be compliant with the PNNI specification from the ATM Forum. It uses an adaptive and iterative path search approach and takes advantage of the PNNI hierarchical network structure to reduce path computation complexity and maximize network throughput. The performances of the PRA and HRA are evaluated by simulations. The simulation results show that the PRA can provide the best performance while the complexity is acceptable and the HRA can reduce processing time and improve network utilization, and both are suited for QoS requirements of ATM networks' routing. (C) 2001 Elsevier Science B.V. All rights reserved.
Ad-Hoc Cognitive Networks are composed of mobile cognitive nodes that are expected to fulfill end-to-end user application objectives. Each cognitive node can change its radio parameters (spectrum) in order to improve ...
详细信息
ISBN:
(纸本)9781509021529
Ad-Hoc Cognitive Networks are composed of mobile cognitive nodes that are expected to fulfill end-to-end user application objectives. Each cognitive node can change its radio parameters (spectrum) in order to improve its efficiency and to avoid interference with licensed or unlicensed users. This paper proposes schemes for increasing user experience of such networks, considering channels bandwidth and routing decisions, where the transmission of each cognitive node is limited to only one of its channels. The main contribution of our schemes is a simple algorithm that increases the performance of such networks in various conditions.
A Computer Aided Design (CAD) tool consisting of two new interconnect network routing algorithms is developed. It was developed to assist in manufacturing test development for any Programmable Logic Device (PLD) such ...
详细信息
ISBN:
(纸本)0780370945
A Computer Aided Design (CAD) tool consisting of two new interconnect network routing algorithms is developed. It was developed to assist in manufacturing test development for any Programmable Logic Device (PLD) such as Complex Programmable Logic Devices (CPLDs) and/or Field Programmable Gate Array (FPGA) devices which utilize any interconnect network structure whose definition/connectivity and control can be described in a presented manner. The CAD tool utilizing the new routing algorithms supports manual and semiautomatic explicit, non-explicit, and net routing and was extensively tested on the interconnect networks of the Cypress Delta39K (TM) series CPLD for the purpose of manufacturing testing of the programmable interconnect networks within the device as well as all programmable logic functions of the device. The two routing algorithms were developed and experimentally proved to work correctly with the best one chosen based on both theoretical and experimental complexity analysis and the particular routing scenario to be solved. The resultant routing CAD tool will produce the configuration bits necessary to program or configure PLD devices for the extensive tests that must be applied to ensure that the manufactured PLDs are defect-free. The router CAD tool can also be extensively used in the verification of the design process of PLDs as verified via experimental testing..(1).
We investigated energy efficiency and fault tolerance for wireless sensor networks (WSNs), addressing the need to minimize the communication distances so that the energy used for communication is minimized since energ...
详细信息
ISBN:
(纸本)9781479941520
We investigated energy efficiency and fault tolerance for wireless sensor networks (WSNs), addressing the need to minimize the communication distances so that the energy used for communication is minimized since energy consumption is proportional to the 2nd to the 6th power of the distance. We also investigated the energy hole phenomenon, in which non-uniform energy usage among nodes causes some of the nodes to run out of power sooner. This in turn increases the communication distances and results in premature shutdown of the entire network. Since some sensor nodes in a WSN may be unreliable, fault tolerance is required for optimizing the communication topology. We have developed a routing algorithm, the "energy hole aware energy efficient communication routing algorithm (EHAEC)," that solves the energy hole problem to the maximum extent possible while minimizing the amount of energy used for communication by generating an energy efficient spanning tree. A variation of this algorithm, EHAEC for one-fault tolerance (EHAEC-IFT) identifies redundant communication routes by using the EHAEC tree and tolerates the failure of one node. In evaluation simulations, EHAEC outperformed direct data transmission by more than 3.4 to 4.8 times in terms of energy efficiency, thereby extending the WSN lifetime. EHAEC-1FT outperformed EHAEC in terms of energy efficiency when fault tolerance was the first priority and fault tolerance redundancy was created when or before a failure occurred.
暂无评论