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 this paper, we propose an algorithm to search the optimal cycle cover in graphs of small treewidth. Let G=(V, E) be a graph modeled by network with vertex set V and edge set E. Given a specified vertex set SVsubeV(G), a cycle cover is a cycle C of G such that every vertex in SV lies in cycle C. A cycle cover is called optimal if its cost is minimum. Cycle cover problem plays an important role in...
Tomographic techniques allow for the reconstruction of network topologies with no need for cooperation from internal routers. Traditional tomographic techniques infer the internal network layout by clustering nodes into tree structures that, in many cases, reveal only a partial graph structure of the network. This paper proposes a novel approach to network topology discovery by means of packet sandwich...
In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for multi-session multicasting of elastic content. Our framework allows receivers to request multiple sessions from possibly different servers. Each receiver expresses a quality-of-service requirement using a utility function. We...
This paper describes the implementation of a 12-bit 230 MS/s pipelined ADC using a conventional 1.8 V, 0.18 mum digital CMOS process. Two-stage folded cascode OTA topology is used for improved settling performance. Extreme low-skew (less than 3 ps peak-to-peak) chip-level clock distribution is ensured by five-level balanced clock tree, implemented in low swing current-mode logic. The ADC block achieves...
The WiMAX mesh networks based on IEEE 802.16 standard is a key topology for the next generation wireless networking. However, interferences from transmission of the neighboring nodes within the mesh networks are inevitable. Cross-layer design for tree-type routing and level-based centralized scheduling is proposed as the optimization strategy. The cross-layer design here is relying on the routing...
The issues of network performance and reliability in wireless access networks have become indispensable due to the increasing needs for communication services anywhere and anytime. Traditional design of wireless backhaul networks has a simple tree-like structure which is vulnerable to network failures. To protect services against network component/facility breakdown, reliable network design is required...
Application layer multicast is probably the most efficient scheme to sustain the group communication for delay sensitive applications in Internet due to its rapid deployment. However, the problem of building a degree-constrained minimum delay application layer multicast tree is proven to be NP-hard. In this paper, we investigate this optimization problem and propose a distributed protocol to explore...
The mechanism for a peer to randomly choose logical neighbors, without any knowledge about the physical topology, causes a serious topology mismatch between the overlay networks and the physical network. A flooding-based search is robust to node failure, but the response message will be lost if any node on the response path fails, and the flooding search may causes heavy network traffic. In order...
Using multiple radios/channels in wireless mesh networks (WMNs) can significantly boost the throughput of the network and brings broadband wireless access to more users with reduced cost. However, this requires careful assignment of channels to each radio so that interference due to parallel communications can be minimized and the network is not partitioned. We propose a distributed channel assignment...
In this paper a computational implementation of an evolutionary algorithm (EA) is shown to tackle the problem of reconfiguring radial distribution systems under different load conditions. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are considered...
The IEEE 802.15.4 and ZigBee protocol stack offers great potentials for ubiquitous and pervasive computing, namely for wireless sensor networks. However, there are still some open and ambiguous issues that turn its practical use a challenging task. One of those issues is the study of low power consumption of sensor device, which is the biggest issue in sensor network, still has many unresolved issues...
The control of the topology of a network makes it possible for the network nodes to reduce their power of transmission while ensuring that network connectivity is preserved. This paper explains the need for energy consumption control in Wireless Mesh Networks (WMNs) and proposes a Local Minimum Shortest-Path Tree (LM-SPT) algorithm for topology control for the WMNs. The algorithm is distributed with...
This paper proposes a new token-based mutual exclusion algorithm for directed graph topology, with or without cycles. In one of our earlier works, we have introduced a token based algorithm assuming an inverted tree topology. Such a stable, hierarchical topology is quite unrealistic for mobile networks due to frequent link failures and node mobility. The proposed solution overcomes this. Besides maintaining...
Coding advantage refers to the potential for network coding to improve end-to-end throughput or reduce routing cost. How large can the coding advantage be? We investigate this fundamental question in the classic undirected network model. So far, all known networks where such potential exists are based on a special class of topologies known as combinatorial networks. We try to prove a rather small...
In this paper, we propose a self-protected spanning tree (SST) construction algorithm and the corresponding single link switching mechanism (SLSM) for tree-based recovery schemes. Using SLSM, an SST can recover from any single link failure without the help of the other trees. When some link fails, SLSM transforms an SST into another spanning tree by only replacing the failed link in the tree with...
Service placement has typically been studied through the formulation and solution of a 1-median problem that is known to be complex and require global information. As such approaches are clearly not scalable in dynamic and large-scale environments, a more reasonable approach to service placement for large, ad hoc and autonomic environments would be through service migration. Such a migration policy...
We consider a network of mobile agents in an initially unknown acyclic network configuration and the problem of reconfiguring them into a desired network topology and formation geometry while maintaining connectivity in an asynchronous network. We model the system and solution as an embedded graph grammar and use a method of lexicographically ordered Lyapunov functions to show the system converges...
Three-dimensional network-on-chip (3-D NoC) is an emerging research area exploring the network architecture of 3-D ICs that stack several smaller wafers or dice for reducing wire length and wire delay. Various network topologies such as meshes, tori, and trees have been used for NoCs. In particular, much attention has been focused on tree-based topologies, such as fat trees and fat H-tree, because...
The fault tolerance of the communication topology of a distributed system is a very important feature which needs to be analyzed carefully. In this paper we propose a new reliability metric for tree topologies, based on the unrestricted vertex multicut problem on trees, for which we present the first optimal linear time algorithm. We present evaluation results of the reliability metric on tree networks...
Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data are generated by a large number of distributed sources. Queries are made that may require sophisticated processing and filtering of the data. A query is represented by a query graph. In order to reduce the data transmission and to better...
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.