The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper is concerned with fully distributed reputation-based mechanisms that improve security in MANETS. We introduce a number of optimisations to the current reputation schemes used in MANETs such as selective deviation tests and adaptive expiration timer that aim to deal with congestion and quick reputation convergence. We propose to use two different centrality measures for evaluation of the...
In this paper we address the problem of designing adaptive epidemic-style forwarding mechanisms for message delivery in Delay Tolerant Networks. Our approach is based on a new analytical framework for multi-agent optimization through distributed subgradient methods. We investigate how this framework can be adapted to the considered networking problem and perform a preliminary evaluation, which shows...
The new dynamic spectrum environment in cognitive radio networks necessities novel routing protocols which should be spectrum-aware, self-configured, high-adaptive and robust to match the dynamic nature of Cognitive Radio Networks (CRN) and exploit the available spectrum efficiently. In this paper, we present ASAR, which is a biologically inspired routing solution for CRN. In our routing algorithm,...
QoS routing problem in wireless mesh networks is a NP-complete problem, and it is hard to get the global solution with the traditional algorithm. In this paper, we adopt a novel dynamic ant genetic hybrid algorithm to solve QoS unicast routing problem for wireless mesh network, whose innovation are using the best melting point evaluation strategy to control the calling of the two algorithms dynamically...
Space communications enter a new era where a multihop architecture is being exploited and an increasing number of alternative communication paths may be available. Current space applications, such as CFDP for file transfer, rely on static routing and can not efficiently perform in these challenging environments. The most promising solution is the emerging delay tolerant networking (DTN) architecture...
Fast convergence in IGP is very important for widespread deployment of real time applications. Many efforts, such as fast hello and fast flooding, have been proposed to reduce the convergence time in IGP. However, these solutions need to consume a large amount of CPU and memory resources in routers. Furthermore, they require collaboration of two neighbor routers. In this paper, we analyze the limitations...
Bandwidth-delay-constrained multicast routing problem is an NP-complete problem. In this paper, we propose a QoS multicast routing algorithm based on artificial fish swarm optimization. Meeting with the bandwidth-delay-constrained, the proposed algorithm can search the least-cost multicast routing tree quickly. Simulation results show that this algorithm has high reliability and good performance of...
Delay-sensitive Internet traffic, such as live streaming video, voice over IP, and multimedia teleconferencing, requires low end-to-end delay in order to maintain its interactive and streaming nature. In recent years, the popularity of delay-sensitive applications has been rapidly growing. This paper provides a protocol that minimizes the end-to-end delay experienced by inelastic traffic. We take...
Providing QoS support is crucial to guarantee effective transportation of multimedia service for ad hoc network. In this paper, a QoS multicast routing algorithm with bandwidth and delay constraints was proposed. It utilizes genetic algorithm to search optimized multicast tree which satisfies the QoS requirement. The simulation results show that the algorithm has fast convergence and high routing...
In this paper, we proposed a novel probability convergence based particle swarm optimization algorithm for the multiple constrained QoS multicast routing. This algorithm is inspired from the probability convergence attributes. The main contents of this paper includes: (1) A novel particle sorting rule of swarm are designed. (2) A novel probability convergence mechanism is developed in the position...
Based on a simplified BGP routing model, the paper analyses the upper bound of BGP convergence delay for four basic network topologies. Then we give a method for calculating the upper bound of BGP convergence delay for any topology. With simulation under ssfnet, we observe the deviation between our proposed delay upper bound and convergence delay in simulation, and reach to the conclusion that our...
Route flap caused by link flap in OSPF always lead to network instability and unreliability. Most of the prevailing solutions are network-wide and require all routers to participate in the route flap suppressing process, which not only lack flexibility and scalability but also occupy additional computation resources across the network. In this paper, a localized approach is proposed to suppress the...
We present a routing solution which eliminates the inherent path exploration problem of BGP and thereby enhances survivability in multi-domain networks. The path exploration problem is caused by the dependency among paths learned from neighboring domains. We propose to solve this issue by using two domain level disjoint paths. Our work is based on the aggregated representation of transit domains....
We propose a routing strategy for all optical packet network. This algorithm is based on the decomposition of the topology onto two cycles. This strategy provides a bound on the End to End delay.
In this paper, we investigate failure recovery requirements for GMPLS-based control planes. To this end, we firstly identify major protocol disruptions due to connectivity outages in the control plane. This allows the derivation of a new parameter, which quantifies such disruptions thus providing a figure of merit for performance evaluation. As the main contribution, we propose and validate different...
Ant colony optimization is being used to solve problems in many scientific fields. In this paper we apply an ant routing algorithm to multi-radio and multi-channel wireless mesh networks. The proposed algorithm introduces ants encountering scheme to imitate the natural process of information sharing between the individuals of an intelligent swarm. Simulation of the routing shows that this new routing...
Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness, decentralized and self-organizing nature, which are well suited for routing in modern communication networks. This paper describes an adaptive swarm-based routing algorithm that increases convergence speed, reduces routing instabilities and oscillations by using a novel...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
Internet Relay Chat (IRC) is a critical application in military networks for maintaining situational awareness and conducting battle management at all echelons. But these networks are often subject to frequent disconnections, limited bandwidth, and long delays, especially when using satellite services and field radios. Such conditions are inhospitable to TCP, and thus the standard IRC protocol, which...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.