			Home About us Contact

Routing Table (routing + table)

Distribution by Scientific Domains

Engineering	66%

Selected Abstracts

Flexible routing in a distributed K -ary tree: the K -Umbrella

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 2 2009
Athanasios-Dimitrios Sotiriou
As peer-to-peer (P2P) applications become more mature and demanding, there is a need for the underlying technologies to provide more adaptive characteristics, according to the application's requirements. In this paper, we present K -Umbrella, a K -ary distributed hash table (DHT), which allows us to efficiently route through the use of a fixed-size routing table. By controlling a number of parameters, our algorithm is able to trade-off between efficiency, fault-tolerance and decentralisation according to the application's requirements. Through a detailed analysis of our algorithms and an extensive set of simulations, we will show that our protocol is able to offer an improved alternative to current DHT algorithms. Copyright © 2007 John Wiley & Sons, Ltd. [source]

Efficient location of free spaces in TCAM to improve router performance

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 4 2005
Weidong Wu
Abstract A ternary content-addressable memory (TCAM) is a popular hardware device for performing fast IP-address lookup. Because keeping all entries sorted in TCAM, we need move the entries for inserting a new entry. In this paper, we have presented a scheme for minimizing route update overheads in TCAM-based forwarding engines. Our optimizations are based on the hierarchy of prefixes in the routing table. The number of memory movement per update depends on the sequence of the new-inserted prefixes, instead of the initial prefixes in routing table. For the real route update traces, the average number of movements is less than 0.01. Further, when compared to an existing optimization algorithm, in the average case, our algorithm shows a 90% reduction in movement overheads. Copyright © 2005 John Wiley & Sons, Ltd. [source]

A scheme for solving Anycast scalability in IPv6

INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 4 2008
Wang Xiaonan
The existing designs for providing Anycast services are either to confine Anycast groups to a preconfigured topological region or to distribute Anycast groups globally across the whole Internet. The latter causes routing tables to grow proportionally to the number of global Anycast groups in the entire Internet and both of the above designs restrict and hinder the application and development of Anycast services. A new kind of Anycast communication scheme is proposed in this paper. This scheme adopts a novel Anycast address structure which can achieve a dynamic Anycast group while allowing Anycast members to freely leave and join the Anycast group without geographical restriction and it effectively solves the expanding explosion of the Anycast routing table. In addition, this scheme can evenly disperse Anycast request messages from clients across the Anycast servers of one Anycast group, thus achieving load balance. This paper analyzes the communication scheme in depth and discusses its feasibility and validity. The experimental data in IPv6 simulation demonstrate that the TRT (Total Response Time) of one Anycast service (e.g., file downloading) acquired through this communication scheme is shorter by 15% than that through the existing Anycast communication scheme. Copyright © 2007 John Wiley & Sons, Ltd. [source]

Split agent-based routing in interconnected networks

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 4 2004
Constandinos X. Mavromoustakis
Abstract Adaptive behaviour of swarm-based agents (BT Technol. J. 1994; 12:104,113; AAMAS Conference '02, Melbourne, Australia, Month 1,2, 2002; Softcomput. J. 2001; 5(4):313,317.) is being studied in this paper with respect to network throughput for a certain amount of data traffic. Algorithmically complex problems like routing data packets in a network need to be faced with a dynamically adaptive approach such as agent-based scheme. Particularly in interconnected networks where multiple networks are participating in order to figure a large-scale network with different QoS levels and heterogeneity in the service of delay sensitive packets, routing algorithm must adopt in frequent network changes to anticipate such situations. Split agent-based routing technique (SART) is a variant of swarm-based routing (Adapt. Behav. 1997; 5:169,207; Proceedings of 2003 International Symposium on Performance Evaluation of Computer and Telecommunication Systems,SPECTS, Montreal, Canada, July 20,24, 2003; 240,247.) where agents are split after their departure to the next node on a hop-by-hop basis. Packets that are delay sensitive are marked as prioritized which agents recognize-as being a part of a packet- and try to influence the two-way routing tables. Thorough examination is made, for the performance of the proposed algorithm in the network and the QoS offered, taking into account a number of metrics. It is shown that the split agent routing scheme applied to interconnected networks offers a decentralized control in the network and an efficient way to increase overall performance and packet control reducing at the same time the packet loss concept. Copyright © 2004 John Wiley & Sons, Ltd. [source]

Design and implementation of Anycast communication model in IPv6

INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 3 2009
Xiaonan Wang
The existing designs for providing Anycast services are either to confine each Anycast group to a preconfigured topological region or to distribute members of Anycast groups over global regions. The former brings an Anycast scalability problem and the latter causes the routing tables to grow proportionally to the number of all global Anycast groups in the entire Internet. Therefore, both of the above designs restrict and hinder the application and development of Anycast services. A new kind of Anycast communication model is proposed in this paper which solves some existing problems, such as scalability and communication errors between clients and servers. In this paper, the Anycast communication model is analyzed in depth and discussed, and the experimental data of this Anycast communication model demonstrate its feasibility and validity. [source]

Performance evaluation of adaptive routing algorithms in packet-switched intersatellite link networks

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, Issue 2 2002
Mihael Mohor
Abstract This paper addresses the performance evaluation of adaptive routing algorithms in non-geostationary packet-switched satellite communication systems. The dynamic topology of satellite networks and variable traffic load in satellite coverage areas, due to the motion of satellites in their orbit planes, pose stringent requirements to routing algorithms. We have limited the scope of our interest to routing in the intersatellite link (ISL) segment. In order to analyse the applicability of different routing algorithms used in terrestrial networks, and to evaluate the performance of new algorithms designed for satellite networks, we have built a simulation model of a satellite communication system with intersatellite links. In the paper, we present simulation results considering a network-uniform source/destination distribution model and a uniform source,destination traffic flow, thus showing the inherent routing characteristics of a selected Celestri-like LEO satellite constellation. The updates of the routing tables are centrally calculated according to the Dijkstra shortest path algorithm. Copyright © 2002 John Wiley & Sons, Ltd. [source]