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 evaluates the performance of the first-last-exact fit spectrum allocation policy for elastic optical networks. The first-last-exact fit spectrum allocation policy is intended to increase the number of aligned available slots and avoid small contiguous available slots, and hence suppresses the blocking probability. This policy separates the allocation of disjoint and non-disjoint connections...
The mesh network-on-chip (MNoC) is the most popular inter-processor communication infrastructures used in modern on-chip systems. Although many routing algorithms have been developed for MNoCs but almost all of them give better performance in cost of more complexity (more virtual channels) and hence extra power consumption. In this paper, we propose a partially adaptive routing algorithm for meshes...
This paper proposes a simple path diversity algorithm (SPDA) for Interdomain routing. The SPDA uses source routing to find an alternate path from a source to a destination, and allows flexible division of traffic over the best and alternate path. The SPDA comprises three steps. First, the BGP protocol is extended to allow the BGP routing table to save the multiple paths for any destination. Second,...
We study the load balancing aspect of routing algorithms in wireless ad hoc networks. We define a statistical measure called local coefficient of variance (lcv) to study the smoothness of the load distribution in the network. The importance of keeping lcv as low as possible in designing load balanced routing algorithms is demonstrated. We analyze how number of nodes, transmission range, network area...
Routing is a key factor in the design of modern communication networks, especially in wireless ad-hoc networks (WANs). In WANs, both selfish and malicious nodes are the misbehaving nodes and are significant routing and security problems. The proposed mechanism presents a trust model to detect selfish and malicious nodes to avoid these nodes becoming routing nodes. In addition, the proposed paper provides...
Peer-to-peer (P2P) based content distribution networks (CDNs), e.g., BitTorrent, are widely used in the today's Internet. Since all peers interested in a specific content provide storage and upload capacity those CDNs facilitate a cheap and easy distribution of large amounts of data. However, they generate a lot of costs for Internet Service Providers (ISPs) as normal users also act as a source for...
In the near future vehicular networks based on wireless technology will be part of our lives. Efficient and robust routing algorithms will play a key role in the success of such technology. In this paper we present TrafRoute, an efficient and robust routing scheme for vehicular networks, suitable for both Vehicle-to-Vehicle and Vehicle-to-Infrastructure communications. TrafRoute introduces a novel...
Opportunistic routing has gained much attention in recent years as a means of leveraging the broadcast nature of wireless medium. Most of the previous studies focused only on improving throughput, assuming that Best Effort traffic which is delay insensitive is delivered through opportunistic routing. However, when the delay sensitive traffic is involved, it is necessary to consider both the opportunistic...
Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should...
Through sensing and utilizing available network resources, cognitive network can obviously increase network performance. In this paper, a distributed on-demand routing protocol with traffic awareness (TACR) is proposed for cognitive wireless network. This routing protocol establishes the path based on the cognition and reasoning of traffic loads in a network and it also meet quality of service (QoS)...
Wireless mesh networks are dynamically self-organized and self-configured, with the nodes in the network automatically establishing and maintaining mesh connectivity among them. Wireless mesh networks consist of three types of nodes: clients, routers and gateways. Wireless Mesh Network planning consists of determining the amount of routers needed to meet the demands for Internet access. It is a complicated...
Minimum-hop strategy of normal routing protocols for ad hoc wireless networks doesn't consider the load of the network, which may lead to network congestion and degrade performance of the network thereafter. In order to solve this problem, this paper proposes a simple and effective modified version of AODV-Load-Aware AODV (LA-AODV), in which, each node decides whether or not to accept routing requests...
Mobile Adhoc Networks (MANETs) is a wireless network which does not require any infrastructure and base station for communication. A routing protocol with less energy consumption is one of the main requirements of MANET because of limited bandwidth and battery power of each node. In this paper we have proposed a new algorithm called ECG_AODV (Energy Constraint Gossip based) routing protocol and analyzes...
A network traffic system can be tuned by three factors: (i) the topology of underlying infrastructure; (ii) the distribution of traffic resources; (iii) the routing strategy. In this paper, we propose a model to study the optimization of network capacity based on complex network theory. We study the optimization method of network traffic in several situations corresponding to the real cases. The model...
In this paper, we propose a method to save energy consumption for the rejoin procedure of ZigBee networks. By skipping the active scan process, a rejoining node and its neighbors are able to save a large amount of energy. In addition, the rejoining node chooses the suitable potential parent by reserving and utilizing original neighbor table. This method is capable of reducing the number of rejoin...
Inter-vehicle communications (IVC) based on mobile ad hoc networks have attracted increasing attention of researchers recently. In this paper, we study the communication performance of IVC networks in multilane dynamic traffic streams. We are concerned with the influence of several traffic factors on multilane communications, such as vehicles' high mobility, traffic directions or relative speed, and...
Network topology does not change dynamically in wireless mesh networks. Most of the end-to-end traffic flows are between mesh nodes and gateways. A tree-base routing algorithm is suitable for such network architecture. When using multichannel and multi-interface, routing algorithm and channel assignment is codependent. They should be combined together to fully exploit the network capacity. We propose...
The multicast operation is a useful operation in parallel applications. With the hardware supported multicast of the InfiniBand architecture (IBA), we propose a multicast scheme for m times n mesh InfiniBand networks based on the XY routing scheme. The basic concept of the proposed multicast scheme is to find the union sets of the output ports of switches that are in the paths between the source node...
Bamboo is one structured P2P overlay, that likes others (e.g. Chord, Kademlia, Pastry), organizes peers into a flat overlay network and offers distributed hash table (DHT) functionality. It is very promising for its efficient routing performance. However, one disadvantage impeding the DHT algorithm popularity is the routing information maintenance overhead; it generates considerable network traffic...
In this paper, we introduce a novel routing algorithm which is based on ant colony system. The objective of this novel algorithm is to solve the problem of energy and congestion control on wireless sensor network routing process. This novel algorithm is able to achieve better load balance and prolong the network lifetime. In this novel algorithm we combine the pheromone released by multi-ant colonies...
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.