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.
One-hop algorithms have been proposed to solve the problem of fast queries in structured Peer-to-Peer (P2P) system. The core concept for one-hop algorithms is to maintain a huge routing table, but most of them so far have opted to deal with routing table maintenance with a fixed consuming for peers, in order to keep minimal maintenance traffic at the cost of operating performance. In this paper we...
Network survivability is very important due to the growth of Internet traffic and the number of services/business depending on telecommunication networks. A Shared Risk Link Group (SRLG) is the set of links in the network that share a common physical resource subject to fault(s). The fault of a given network resource implies a fault in all links in the corresponding SRLG. The concept of SRLG allows...
Assuming that the traffic matrix belongs to a polytope, we present a new routing paradigm where each traffic demand is routed independently of the other demands. The routing of each demand is a combination of two extreme routing depending on the current volume of the demand. This new routing paradigm is easy to implement in networks and quite efficient in terms of network cost.
The paper presents network processors architecture and services, describes the use of network processors in the devices of traffic processing and formation.
We describe basic properties of Markov chains on finite state spaces and their application to Green functions, partial differential equations, and their (approximate) solution using random walks on a graph. Attention is paid to the influence of boundary conditions (Dirichlet/von Neumann). We apply these ideas to the study of traffic propagation and distribution in ad hoc networks.
The ability to provide critical communications, particularly during disasters, is essential for national security and emergency preparedness (NS/EP). The authors present a quantitative study of the resilience of IP-based NS/EP services for the National Communications System (NCS). This analysis builds on a previous study of the survivability of a single carrierpsilas telecommunications network by...
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.