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.
In the large-scale deployment of wireless sensor networks, when cluster-heads of the routing algorithm based on clustering transmit their data to sink via multi-top communication, the cluster-heads closer to sink are burdened with heavy relay traffic and tend to die early, causing energy holes that affect the normal operation of the network. It shortens the lifetime of network. To solve the problem...
Many structured Peer-to-Peer-Systems (P2P) have been developed over the past years. However, most of them rely on hash-functions and thus put major restrictions on applications being implemented on top of them. In this paper we present a very detailed description of Papnet, a hash-free P2P overlay-network that supports range-queries and realizes an infinite alphanumeric address space that can be used...
A new traffic-balanced adaptive routing algorithm is proposed for 2-dimensional torus with only four virtual channels, the deadlock avoidance technique is presented based on two levels odd-even turn model scheme. Unlike the previous virtual network routing schemes, virtual channel resource are not equally distributed to the packets, the new method allows all packets have the equal chances to share...
DHT-based peer-to-peer systems have been proposed in the past few years. Scalability, fault tolerance and searching speed of the DHT based P2P systems have been greatly improved in contrast to the unstructured P2P systems. These DHT-base systems have the problem of load imbalance. We present a load balancing method taking into account Zipf-like requests distribution and the impact of physical networks...
Structured peer-to-peer (P2P) networks are increasingly important in the design of distributed systems. However, due to their strict data placement rules, they are often prone to three main load imbalances: range, data, and execution skew. Today, many load balancing algorithms focus on range skew and assume the network data rate to be the bottleneck. In applications that focus on distributed request...
This paper is a quantities analysis on packet switched network with a view to generalize load balancing and determination of appropriate routing algorithm in multipath environment. Several routing algorithms have been introduced for routing of packets from source to destination. Some of them promised that they will route accurately but it seems with increased workload. Some of them promised that they...
This paper presents a support for the development of distributed virtual environments (DVEs) on P2P architectures. A hierarchical overlay is defined by pairing each peer with a weight which is proportional to its networking bandwidth. Peers characterized by higher weights are assigned a greater workload, in terms of connections with other peers and of number of passive objects they manage, and can...
Despite ??airborne network (AN) topology design?? and careful planning of AN trajectories, unexpected disruptions (from hardware failures to changes in mission requirements and hostile attacks) may cause nodes not to connect to one another directly or indirectly either because they are out of one another's range or because nodes do not meet one another according to their preplanned trajectories. Since...
In the tactical Internet, inter-domain links consist mostly of unreliable and low bandwidth wireless links. To enable seamless routing across different Autonomous Systems (ASes), we propose an inter-domain Traffic Engineering (TE) scheme to reroute traffic when congestion occurs. There are two components for the TE scheme. First, a Traffic Splitting (TS) scheme is used for load balancing among parallel...
Multi-nexthop routing mechanisms is the key point in network congestion, and the essential question is how to forward packets among multi-nexthop to reach equiponderant forwarding. This paper proposes an equiponderant forwarding strategy in multi-nexthop routing, which forwards the packets according to the actual capability of each node, and resolves the equiponderant forwarding problem of multi-nexthop...
DCUR follows the same procedure as define in Bellman-Ford but uses two vectors, namely least cost and least delay vector. The main drawback of DCUR is its assumption of link costs. It means that the minimum cost path is more often chosen and therefore the load distribution is not fair for the minimum cost paths. In this paper we propose a way to modify the cost and delay metrics dynamically in the...
Inter-domain peering links represent nowadays the real bottleneck of the Internet. On peering links carriers may coordinate to efficiently balance the load, but the current practice is often based on an uncoordinated selfish routing supported by the peer relationship. We present a novel game theoretical routing framework to efficiently coordinate the routing on peering links while modelling the non-cooperative...
In the network of tori with faults, many fault-tolerant routing schemes have been proposed based on the fault models. Although these schemes enable the packets to bypass the fault regions without causing any deadlock in the network, they have the common shortcoming. Since all blocked packets would be misrouted on the fault ring, the fault ring would undertake heavier traffic load, which makes it be...
In the wireless sensor network (WSN) literature, the use of a mobile sink is commonly viewed as one of the most successful means of load balancing as well as an effective defense against the so-called hot-spot phenomenon. The aim of this paper is to investigate the real-world applicability of the known theoretical benefits associated with the use of mobile sink(s). In particular, we examine the pros...
This paper proposes a new load balancing mechanism, called PPLR (prediction packet loss rate), which is based on time series prediction. Load balancing is needed in many fields; however, current approaches have problems such as lacking of preparing for sudden spikes. In this paper, we describe how PPLR dynamically predicts loss levels over all available network paths and adjust the allocation proportion...
Summary form only given. A quorum system is formed by organizing nodes into subsets called quorums, where every two quorums intersect and no quorum includes another quorum. The quorum system reduces the access cost per operation, to balance the load, and to improve the system scalability. All of these properties make quorum systems particularly attractive for large-scale sensor applications involving...
Many load balancing strategies have been proposed for distributed hash tables, like Pastry. These strategies assume that hash functions spread even skewed key distributions almost evenly over the ID space. They neglect the problem that many applications produce data with common keys (multi-sets) that entail hash collisions and therewith load imbalance concerning query and storage load. A second drawback...
Load balance in P2P storage system will affect availability greatly. Two aspects should be considered in keeping balance: balance in peer space and balance in data replica among peers. This paper focuses on achieving balance in peer space. Peers are categorized by periodicity of availability, and long term peers are organized into virtual balanced binary tree which is improved from P-Grid. Character...
LDT and LDT-P Algorithms are proposed, which fit for linear and parallel service composition respectively .Composition Agent is responsible for searching components and generating a least delay tree. Then candidate paths are found by visiting the tree nodes with the depth-first traversal scheme. At last a path is selected for composed service considering the capability of the nodes and the bandwidth...
Sometimes the backbone network of Internet experiences congestion because traffic is not distributed rationally. This fact may lead network resources utilized inefficiently. The main idea for load balancing is to alter the route for some traffic. But current approaches with this idea often get such a long route that decrease the quality of service. This paper presents a new flow routing adjustment...
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.