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 understanding the connection between the existing Internet congestion control algorithms and the optimal control theory. The available resource allocation controllers are mainly devised to derive the state of the system to a desired equilibrium point and, therefore, they are oblivious to the transient behavior of the closed-loop system. This work aims to investigate what...
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...
In network on chip (NoC), the traditional routing schemes are routing the network through a single path or multiple paths from one source node to a destination node, which will minimize the congestion in the routing architecture. Though these routing algorithms are moderately efficient, but time dependent. To reduce overall data packet transmission time in the network, we consider a network with multiple...
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...
Traffic engineering (TE) has become a challenging task for network management and resources optimization due to traffic uncertainty and to the difficulty to predict traffic variations. To address this uncertainty in a robust and efficient way, two almost antagonist approaches have emerged during the last years: robust routing and dynamic load-balancing. The former copes with traffic uncertainty in...
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...
Grid is an environment that makes it possible to share resources that are managed by diverse, independent and administrative geographically distributed organizations. The main objective of grid is to enable users to solve problems using the available geographically distributed resources. Grid resource discovery is a challenging issue because characteristics of resources are heterogeneous, dynamic,...
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...
P2P systems can be used to form a low latency decentralized data delivery system. Structured P2P systems provide both low latency and excellent load balance with uniform query and data distributions, however, in the real application environment, requests distributions are often skewed and follow a Zipf law, some objects will become hotspots, individual nodes are easily overloaded, resulting in poor...
Computing capacity bounds of ad hoc networks, as well as optimizing radio resource allocation in order to approach those bounds is a hard task that have recently attracted the interest of the research community. In this paper we address the problem of jointly optimizing the routing of flows, the transmission scheduling over wireless links along the path, and the emitted power for bandwidth guaranteed...
InfiniBand networks are aimed to fulfill increasing communication demand of parallel applications in high performance clusters. However, the dynamic behavior of communication load may cause bottlenecked link(s) which lead to message congestion. Congestion spreading increases latency and reduces network throughput causing important performance degradation. In this paper, we propose a congestion control...
Accurate searching in current structured P2P network is popular, but range query is very difficult and complex. In this paper, based on the Pastry, we propose a resources allocating mechanism for searching the objects among certain ranges in P2P network, and give the searching algorithm in detail. This mechanism does not need change the original P2P infrastructure, the algorithm is simple and easy...
Distributed systems such as peer-to-peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such systems, uneven load allocation has to be effectively tackled in order to minimize overloaded peers and optimize their performance. In this work, we detect and analyze the two basic methodologies used to achieve load-balancing:...
We introduce the problem of joint routing, scheduling and power control for multiple information flows in half-duplex, interference limited ad-hoc networks. The joint problem of optimizing for throughput is NP-Hard, and so we present an approximation of the problem and a general framework for solving it in O(N3) time. We attack the problem in two ways, first by presenting a reformulation and decomposition...
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...
Hardware task placements in dynamically reconfigurable logic need to satisfy different goals such as high placement efficiency, low fragmentation of the reconfigurable logic, and minimization of routing resources. There have been several placement algorithms proposed for each goal. Nevertheless, the algorithm can only satisfy one goal, which results in poor results in the other goal satisfactions...
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...
This paper proposes an IP finely-distributed load- balanced routing scheme based on two-phase routing over shortest paths, where the traffic matrix is given. It is called the fine two-phase routing (F-TPR) scheme. In F-TPR, traffic is distributed from a source node to intermediate nodes more finely, compared to the original TPR. F-TPR determines the distribution ratios to intermediate nodes for each...
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.