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...
In this paper, we present an optimization-based approach to control the outbound interdomain traffic for stub ASes. Our approach allows the network operator to define multiple traffic objectives. We present a genetic algorithm to specify a provider for destination prefix sets with the objective of minimizing configure changes , minimum cost and load balancing. In solving the assignment problem with...
Wireless sensor networks experience a number of problems not found in wired networks, such as limited power resources, location identification and message routing in a wireless medium. Analysis of small world networks have shown that it is possible to transmit information from one node to another node some random distance away within a small number of hops (i.e. small world networks have a small diameter)...
This paper presents the design of a decentralized storage scheme to support multi-dimensional range queries over sensor networks. We build a distributed k-d tree based index structure over sensor network, so as to efficiently map high dimensional event data to a two-dimensional space of sensors while preserving the proximity of events. We propose a dynamic programming based methodology to control...
A massively parallel computer involves a large number of routers that are independent of each other. Adaptive routing methods offer high levels of flexibility in packet routing, but their performance is limited due to their locality nature. The Cross-Line method handles quasi-global information of congestion to improve performance. This paper introduces two new ideas of adaptation level and evaluation...
Multipath Routing plays an important role in communication networks. Multiple disjoint paths can increase the effective bandwidth between pairs of vertices, avoid congestion in a network and reduce the probability of dropped packets. In this paper, we built mathematical models for arc-disjoint paths problem and vertex-disjoint paths problem respectively, and then proposed polynomial algorithms for...
We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the deadline is one of its edges. Targets arrive continuously over time on the edge opposite the deadline, and move towards the deadline at a fixed speed. The goal for the vehicle is to maximize the fraction of targets that are captured...
Recent advances in systems of networked sensors have set the stage for smart environments which will have wide-ranging applications from intelligent wildlife monitoring to social applications such as health and elderly care service provisioning. Perhaps the most natural problem in sensor systems is the ??efficient?? propagation of a sensed local event. In order to address this problem, the notion...
Intradomain routing in IP networks follows least-cost paths according to administrative link costs. Routing optimization modifies these values to minimize an objective function for a network with given link capacities and traffic matrix. An example for an objective function is the maximum utilization of all links under failure-free conditions or also after rerouting in case of network failures. Many...
We describe the main architecture and the design principles of the service/resource discovery system (SRDS), a component of the XtreemOS operating system. XtreemOS is a Linux extension that enables management and exploitation as single platform of computational resources provided by federated virtual organizations. The SRDS provides scalable and fault-tolerant directory services supporting many of...
The availability requirements placed on core communication networks have been rapidly increasing. As the value of the traffic served by these core networks has increased so has the impact of failure. Demand-wise shared protection (DSP) was developed to provide failure survivability in the network that was more efficient than concurrently routing two paths of traffic (1+1 APS), yet was more straightforward...
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...
The distributed gradient protocol is a common building block to perform several tasks in a wireless sensor network.The gradient calculates the minimum hop-distances between each sensor and a specified set of anchor sensors. This calculation is performed using a distributed greedy forwarding of messages in the network. Several virtual localization protocols use gradients to compute the virtual coordinates...
During the research of supplementary system for visual impairment people, it has been discovered that it is better to use ZigBee wireless technology considering the reliability, portability and flexibility. Through the independent regionally-covered Zigbee networks and the Zigbee terminal with voice prompts, clients will be able to get to the destination correctly and independently according to the...
This paper considers the problem of routing packets across a multi-hop wireless network while ensuring throughput optimality. One of the main challenges in the design of throughput optimal routing policies is identifying appropriate and universal Lyapunov functions with negative expected drift. The few well-known throughput optimal routing policies in the literature are constructed using simple quadratic...
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-to-peer network. The proposed algorithm is an advanced version of the compass routing algorithm, and it is able to guarantee the delivery of 100% of the packets, while minimizing the total number of packets that travel the network...
Delay tolerant networks are a type of wireless mobile networks that do not guarantee the existence of a path between a source and a destination at any time. In such a network, one of the critical issues is to reliably deliver data with a low latency. Naive forwarding approaches, such as flooding and its derivatives, make the routing cost (here defined as the number of copies duplicated for a message)...
We analyze routing mechanisms of a self-organizing semantic overlay for content-based search in multimedia data. This overlay operates over any existing P2P network based on the metric space approach. In particular, we replace the previous design of routing mechanisms in metric semantic overlay (MSO) with a new adaptive query-routing algorithm. An advantage of it lies in an automatic tuning of confusability...
The increasing number of Web Services provided by several service providers demands for effective, scalable and accurate mechanisms to search and select the most appropriate service, fulfilling some user requirements. Distributed, semantics-enabled infrastructures for service discovery could satisfy these requirements, even if the promise of dynamic selection and automated integration of Web services...
Web services are gaining momentum as a major vehicle to deliver business functionalities on the Web. More and more business organizations have begun to use Web services to facilitate user interactions and the collaboration among themselves. This essentially forms a large service space, which still keeps growing. Meanwhile, there may be functionality overlaps among different service providers. The...
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.