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.
We consider the problem of designing a survivable telecommunication network using facilities of a fixed capacity. Given a graph G = (V, E), the traffic demand among the nodes, and the cost of installing facilities on the edges of G, we wish to design the minimum cost network, so that under any single edge failure, the network permits the flow of all traffic using the remaining capacity. The problem...
High demands in data delivery latency and communication reliability encourage the use of fault-tolerance-enhanced all-optical WDM networks. Low latency is satisfied by setting up a direct lightpath between any communication pair to enable one-shot transmission. High reliability is met by establishing multiple disjoint lightpaths from the source to the destination. In this paper, we explore the fault-tolerance...
We propose a random-walk-based file search for unstructured P2P networks. In the proposal, each node keeps two pieces of information, one is on the hop-limited shortest path tree rooted at itself and the other is on the indexes of files owned by neighbor nodes, referred to as the file list. A random-walk search is conducted along the concatenation of hop limited shortest path trees. To find a file,...
In this paper, we address decision making problems, depending on a set of input events, with networks of dynamic agents that have partial visibility of such events. Previous work by the authors proposed so-called logical consensus approach, by which a network of agents, that can exchange binary values representing their local estimates of the events, is able to reach a unique and consistent decision...
The enhanced hypercube(denoted by Qn,k) is a very important network model because of its excellent properties which are superior to the corresponding properties of hypercube. For a given connected graph G of order n, a routing R is a set of n(n - 1) simple paths specified for each ordered pair of vertices in G. The load of a vertex (resp.edge) for a given routing R is the number of paths going through...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. Dynamic grooming deals with requests for wavelength allocation based on a dynamic pattern of arrivals in contrast to the situation of static grooming in which the pattern of arrivals must be previously...
For two vertices x, y isin V (G), a cycle is called a geodesic cycle with x and y if a shortest path joining x and y lies on the cycle. A graph G is called to be geodesic k-pancyclic if any two vertices x, y on G have such geodesic cycle of length l that 2dG(x, y) + k les l les |V (G)|. In this paper, we show that the n-dimensional Moumlbius cube MQn is geodesic 2-pancyclic for n ges 3.
The downsizing of transistor dimensions enabled in the future nanotechnologies will inevitably increase the number of faults in the complex ULSI chips. To maintain the production yield at acceptable level, several levels of protection mechanisms will have to be implemented to tolerate the permanent and transient faults occurring in the physical layers. In this paper, we study fault tolerance at the...
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world networks abound in sociology, biology, neuroscience and physics as well as in human-made networks. This paper analyzes the average delivery time of messages in dense...
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.