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 original Chord model,the semantic property of the content in the model is not taken into account. Besides,a node's logical ID is independent of its physical location,bringing tremendous delay to network routing.Aiming at the system instability of structured P2P model which is caused by the heterogeneity of nodes in model,this paper proposes a Structure P2P network based on the Chord (TI-CHORD)...
Network survivability is an important topic for the Internet. To improve the performance of the Internet during failure, IP Fast Reroute (IPFRR) mechanisms are proposed to establish backup routes for failure-affected packets. NotVia, a most prominent one, provides 100% protection coverage for single-node failures. However, it brings in nontrivial computing and memory pressure to routers with special...
For simplified network operations, demands are often routed on shortest paths, e.g., with physical length as metric. We propose a new controlled shortest path routing concept for multiperiod planned networks, formulated as optimization model. This routing concept minimizes the network costs (capital expenditures) under the constraint of using shortest path routing within the lit fiber network. Within...
Several studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. Hence, the power consumption in networks is strongly related to the number of active network elements, such as interfaces, line cards, base chassis. The goal thus is to find a routing that minimizes the (weighted) number of active network elements used when routing. In this paper, we...
In multi-hop wireless networks, the way the network topology is defined has a strong impact on routing. This paper deals with topology control in cellular networks with relays. Several topology control algorithms taken from ad-hoc networks are adapted to cellular networks. Most of the algorithms considered here are based on proximity graphs. Performance analysis is carried out in a realistic scenario...
Recently, wireless mesh networks have been proposed as a mechanism to provide alternative broadband wireless internet access. The usage of multiple radios transmitting at diverse frequency bands allows a significant increase in the capacity of such networks. However, popular Hybrid Channel Assignment strategies, which use a fixed interface for receiving and a switchable interface for transmitting...
In this paper, we introduce the stable path topology control problem for link-state routing in mobile multi-hop networks. We formulate the topology control problem of selective link-state broadcast as a graph pruning problem with restricted local neighborhood information. We develop a multi-agent optimization framework where the decision policies of each agent are restricted to local policies on incident...
Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get better routing efficiency, a new routing algorithm named RHAC based on hierarchy agglomerative clustering was presented in this paper. It dynamically clusters nodes into different clusters based on the communication history...
In wireless sensor networks, it is important to minimize energy consumption of the sensor nodes. Energy consumption of sensor nodes can be reduced explicitly by making sensors sleep when they are idle. In this paper, we consider a single wake-up periodic schedule in that the sensor wakes up in one slot out of k slots. This results in every sensor node having a duty cycle of 1/k on an average. However,...
Due to the mass-market of file sharing, majority of existing P2P systems are based on unstructured overlay networks, where P2P search still remains challenging issues. In this paper, we propose a small-world based semantic search architecture in P2P Networks, called CommuSearch, which has three distinguished features: 1) grouping peers into hierarchical class by exploiting heterogeneity; 2) constructing...
This paper discusses the QoS topology control problem with consideration of power control and rate adaptation in wireless mesh networks. Our task is to construct a routing forest (a set of trees rooted from the gateway nodes), configure the transmission power of each node, such that the constructed network topology can meet the delivery threshold for all nodes and the system throughput is maximized...
A frequent subject in forums, academia and industry is the evolution of the Internet in terms of routing. Basically, the scalability in the Default Free Zone related to (1) the growing rate of the routing tables and (2) the convergence of the routing system, are pointed by routing experts as the main concerns of the current mechanism. Several approaches have emerged, but they normally require a mapping...
In this paper, a practical routing protocol that maximizes the guaranteed node traffic loads in reliable networks is designed and analyzed. The derived node traffic loads can be routed for every traffic pattern, and regardless of the possible single node or link failures. First, it is described how load balanced shortest path routing (LB-SPR) can be optimized to maximize the value of the guaranteed...
Carrier networks need to provide their customers with high availability of communication services. Unfortunately, failures are managed by recovery mechanisms getting involved only after the failure occurrence to limit the impact on traffic flows. However, there are often forewarning signs that a network device will stop working properly. We propose to take into account this risk exposure in order...
Compressed sensing (CS) is a novel theory based on the fact that certain signals can be recovered from a relatively small number of non-adaptive linear projections, when the original signals and the compression matrix own certain properties. In virtue of these advantages, compressed sensing, as a promising technique to deal with large amount of data, is attracting ever-increasing interests in the...
This paper is focused on a discussion of parameters and heuristics that are expected to assist multihop routing in becoming more sensitive to node mobility. We provide a discussion concerning existing and a few proposed parameters. Moreover, the work also discusses two new heuristics based on the notion of link duration. The heuristics are compared based on a meaningful set of scenarios that hold...
The fat-tree topology has become a popular choice for InfiniBand fabrics due to its inherent deadlock freedom, fault-tolerance and full bisection bandwidth. InfiniBand is used by more than 40% of the systems on the latest Top 500 list, and many of these systems are based on a fat-tree topology. However, the current InfiniBand fat-tree routing algorithm suffers from flaws that reduce its scalability...
There is a growing consensus that identifier/locator separation is a promising solution to the scalability issue of the current routing infrastructure. After locators are separated from identifiers, end hosts roam from place to place without changing their identifiers. On the other hand, their locators change when they roam from one place to another, which leads to changes of identifier-to-locator...
Current Internet service-provider networks are typically over-provisioned, with the actual traffic through a network element often being much less than the capacity of the network element. However, current network element power consumption is largely independent of actual traffic. This presents an opportunity to reduce network power usage. Such an opportunity may be exploited locally, by redesigning...
In wireless multihop networks, route selection plays an important role in network performance in terms of throughput capacity, as well as, energy efficiency. In general, the route selection strategy should distribute the traffic throughout the network, in order to avoid congestion. This strategy also has the side-effect of distributing the energy consumption among all nodes, so that the energy starvation...
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.