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.
The general method available for comparison between the Distributed Hash Table (DHT) based structured overlay networks are average latency per successful lookup and percentage of successful lookups. For a DHT based lookup service with lookup retries for failed lookups, both average latency per successful lookup as well as percentage of successful lookups are key to evaluate the performance. Although,...
Dynamic, large social events with concurrent activities, in which participants view, but also provide high-quality content to other visitors, pose one of many challenges to multimedia delivery. Distributing content in such a situation is difficult, and requires strong support from the underlying network, in order to quickly respond to changes in supply and demand. A Flock is a flexible overlay built...
The Core Optical Networks (CORONET) program addresses the development of architectures, protocols, and network control and management to support the future advanced requirements of both commercial and government networks, with a focus on highly dynamic and highly resilient multi-terabit core networks. CORONET encompasses a global network supporting a combination of IP and wavelength services. Satisfying...
The Ad-hoc On-demand Distance Vector (AODV) is the most typical reactive routing protocol in MANET. It has been extensively studied through not only computer simulations but also implementations on real network. In this paper, an implementation of AODV routing protocol with multi-metric was presented. In the implementation, an Uppsala University routing protocol, AODV-UU was modified in order to apply...
We present a lab-trial of multi-domain path computation using a hierarchical PCE when domain topologies are aggregated as dynamic virtual meshes. We detail the extended path computation procedures, control plane extensions and the overall performance.
Structured peer-to-peer overlays offer a basis for a broad range of applications, such as distributed storage, application layer multicast, and mobility support. This paper introduces R/Kademlia, a low bandwidth and low latency variant of the popular overlay protocol Kademlia. R/Kademlia utilizes recursive overlay routing instead of iterative lookups of keys, thus a higher routing performance can...
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.