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.
Recent developments in the field of transmission line monitoring system have led to a renewed interest in wireless sensor networks, which is characterized by the strong real time, high reliability, adaptability, load balancing and so on. However, the bottleneck problem of network transmission which is likely to occur around the sink node must be taken into account. This paper proposes a new cross-layer...
The increasing growth of the global Internet making the shortcomings of its unstructured topology and distributed routing algorithm are exposed more rapidly. To design a controllable, scalable and manageable backbone network with a simple, efficient architecture is very imperative. Among many topologies, Tree topology which has a natural hierarchical structure and explicit end-to-end transmission...
In order to reduce the maintenance cost of resource index table of the mobile nodes in the MP2P network, use the edge resource of network enough, and parallel process the mobile task of network, we propose the resource interactive technology based on genetic algorithm to make sure that the mobile node could adapt the change of routing actively during the resource interaction. The simulation experiments...
Overlay networks are becoming prevalent in today's networking environment. We consider scenarios where substrate resources are primarily consumed by many overlay networks placed on top of the substrate. We focus on the fair and efficient allocation of substrate link bandwidth among competing overlays. We adapt various existing fairness definitions to this scenario and define a metric to evaluate the...
The problem of defining a support for multidimensional range queries on P2P overlays is currently an active field of research. Several approaches based on the extension of the basic functionalities offered by Distributed Hash Tables have been recently proposed. The main drawback of these approaches is that the locality required for the resolution of a range query cannot be guaranteed by uniform hashing...
The main contribution of this paper is the design and test of a simple, reliable, and energy efficient routing scheme for sensor networks that successfully meets the goal of network longevity, and that demonstrates satisfactory robustness and network lifetime. The proposed routing algorithm allows a child sensor node dynamically searches for a new reliable parent node with more residual energy and...
A critical problem in a distributed system is the load of each of its individual components, which, if too large, threatens the availability of the whole system. A solution for system availability is decentralizing its components by using peer-to-peer networks. For such networks, we define in this work a scalable, transparent strategy for locally balancing the load of the individual peers, based on...
In the recent years, multipath routing techniques are recognized as an effective approach to improve QoS in Wireless Sensor Networks (WSNs). However, in most of the previously proposed protocols either the effects of inter-path interference are ignored, or establishing low-interference paths is very costly. In this paper, we propose a Low-Interference Energy-efficient Multipath ROuting protocol (LIEMRO)...
Dedicated service gateways provide Network services which direct traffic flows. Currently many researchers focus on gateway selection on the Shortest Route, Closest Gateway and not much on the congestion and network traffic in this route. In this paper, we have proposed a novel approach called Optimal Closest Gateway Mechanism with load balancing technique for traffic engineering. Instead of only...
Wireless Mesh Network (WMN) is a self-configuring, self-organizing and self-healing communications network in a mesh topology. Every node collaborates on establishing routing path to communicate with each other or use the Internet services. Even though WMN increases reliability and provides high bandwidth, selfish or malicious nodes may disrupt the network-wide collaboration and abuse the available...
Approximately 74% of queries in peer-to-peer file sharing systems return no results, wasting both network bandwidth and computational resources. Considering the popularity of this application, this is a significant problem. We propose to improve the accuracy of query routing by improving how file collections are described and defining how peers organize into groups. Our basic approach is to improve...
In this paper, we present the design and the implementation of OSPF-TE routing information collector for MPLS and GMPLS networks. OSPF is commonly used as an IGP in MPLS and GMPLS networks to determine the topology over which LSPs can be established. TE extensions have been recently enabled in OSPF to support SPF tree calculation upon different purposes, thus possibly achieving optimal path computation...
Super-peer networks inherit the advantages of P2P networks, such as pooling together the shared data (images in our system) across peers, self-organizing, and fault-tolerance. In addition, they take advantage of the heterogeneity of capabilities across peers in load-balancing and network adaptation. A super-peer node operates as an equal peer, and as a server/parent to a set of peers. Content-based...
Programmable packet processors have replaced traditional fixed-function custom logic in the data path of routers. Programmability of these systems allows the introduction of new packet processing functions, which is essential for today's Internet as well as for next-generation network architectures. Software development for many existing implementations of these network processors requires a deep...
Cluster technology has witnessed a tremendous inception in computing world. The technique integrates the standard computing resources to generate more processing power and other hardware strengths. The collection of interconnected stand-alone computers ensures high availability, increased throughput, scalability and improved performance. We have developed a dynamic cluster based approach for high...
Wireless mesh networks (WMNs) are developing as a potential solution for growing wireless applications. As the area is new, there are many basic issues still to be solved. This article investigates applicability of the ad-hoc routing protocols and the suitability of existing routing metrics for WMNs. AODV is enhanced by proposing a new hybrid routing metric. The results show that selected path is...
We consider the energy-efficient network resource allocation that minimizes a cost function of average user powers for multi-hop wireless networks. A class of fair cost functions is derived to balance the tradeoff between efficiency and fairness in energy-efficient designs. Based on such cost functions, optimal routing, scheduling and power control schemes are developed. Relying on stochastic optimization...
The following topics are dealt with: data center; Internet networking; location sensing; RFID; clouds; grids; data streaming; querying; IP networks; system security; data management; network security; sensor networks; fault tolerance; routing; social networks; resource allocation; network coding; P2P; and wireless networks.
Although significant efforts have been devoted in the literature to measurements of the Internet topology, little attention has been given to the qualification of routing deviations and multipath dynamics at the Autonomous System (AS) routing level. We observed Internet AS-level routes toward thousands of destinations for several weeks between 2009 and 2010 to have a better understanding of these...
In structured peer-to-peer (p2p) systems, distributed hash tables (DHTs) often partition the ID space into disjoint intervals with each interval assigned to the corresponding node. While nodes join and leave dynamically, one of the hard challenges posed by DHTs is load balancing across the ID space. Tries are known to be a viable data structure such that a balanced trie implies balanced intervals...
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.