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.
Communication networks provide a larger flexibility with respect to the control design of large-scale interconnected systems by allowing the information exchange between the local controllers of the subsystems. This paper introduces an approach for the design of the communication topology for the distributed control of large-scale interconnected systems in order to optimize the whole system's performance...
The link quality based Collection Tree Protocol (CTP) has been demonstrated an efficient and reliable routing protocol for data collection networks that deploy a clustered tree topology. However, CTP measures the link quality by packet throughput rather than transmission latency, which is not appropriate for networks supporting sensor events with transmission time deadlines. In this paper, we propose...
In practice, since many communication networks are huge in scale or complicated in structure even dynamic, the predesigned network codes based on the network topology is impossible even if the topological structure is known. Therefore, random linear network coding was proposed as an acceptable coding technique. In this paper, we further study the performance of random linear network coding by analyzing...
With ASON network scale enlarging, many ASON networks often meet trouble for fastly setuping a service and restoration even in current ring network. It would be more serious trouble in mesh network. Firstly, the two part main time factor is proposed. Then the current methods are introduced to accelerate the speed for setuping a service. The first method is to keep network topology in every node by...
This paper proposes a novel Energy-Efficient Event- Driven (ESED) routing and data dissemination paradigm to address an open problem of wide interest in wireless sensor networks: the routing and data dissemination design for the applications with an event-driven data delivery model when geographic information is not available. ESED not only addresses the characteristics of such kind of applications,...
In this paper, we study the cost efficient topology design (CETD) problem in a predictable delay tolerant networks (DTN) where the time-evolving network topology is known a priori or can be predicted. We model such time-evolving network as a weighted space-time graph which includes both spacial and temporal information. The aim of CETD is to build a sparse structure from the original space-time graph...
In the past, many clustering algorithms for ad-hoc networks have been proposed. Their main objective is to solve the scalability issue of ad-hoc networks by grouping nodes into clusters. The challenge in MANETs for those clustering algorithms is to cope with the high node mobility which affects the stability of the cluster structures. Wireless mesh networks consist of a static backbone and a number...
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of potential applications in civilian and military sectors. The self-control, self-organization, topology dynamism, and bandwidth limitation of the wireless communication channel make implementation of MANETs a challenging task. Vehicular Ad Hoc Networks (VANETs) are a special kind of MANETs that aims at providing...
In this paper, we consider migration of virtual machines in a data center to minimize network power consumption. Network power is consumed when switches are turned on, and conserved when they are turned off; the optimization problem then is to site virtual machines within the data center to achieve connectivity and desired bandwidth while turning on as few switches as possible. Depending upon specifics...
Numerous studies based on complex measurement platforms have been carried out for over ten years now in order to discover the Internet topology on domain level. It turns out that this topology exhibits certain invariant properties such as a distribution of node degree. This distribution follows a power law. Moreover, the revealed topology is hierarchical. The hierarchy is caused by commercial contracts...
Single-radio mesh routers operating on a single channel suffer from low throughput due to collisions. Equipping mesh routers with multiple radios operating on non-overlapping channels can significantly improve the throughput. However, the assignment of channels to radios in a multi-radio mesh network is a challenging task. In this paper, we propose a channel assignment algorithm, TICA (Topology-controlled...
In the maintenance of communication networks, nodes often need to be rebooted or brought off line for software updates, configuration updates or hardware maintenance. ISPs often run the same protocols and use equipment from the same vendor network-wide, increasing the probability that a maintenance window will be network wide. Some of the updates can be critical where we have to update fast, for example,...
This paper addresses reliability of data dissemination applications when there are severe disruptions to the underlying physical infrastructure. Such massive simultaneous physical failures can happen during the geographical events such as natural disasters (earthquakes, floods, tornados) or sudden power outages - infrastructure failures in these cases are geographically correlated. In particular,...
Designing network topologies requires simultaneous consideration of multiple criteria, such as network cost and reliability. So, the author applied the analytic hierarchy process, a way to make a rational decision considering multiple criteria, to network topology evaluation. However, the time required to construct the candidate topology set greatly increases as the network scale grows. This paper...
How to assess the topology vulnerability of a network has attracted more and more attentions recently. Due to the rapid growing number of real- time internet applications developed since the last decade, the discovery of topology weakness related to its quality of service (QoS) is of more interest. In this paper, we provide a novel QoS-aware measurement for assessing the vulnerability of general network...
Path splicing is a proposed routing architecture for the Internet in which end-hosts (and intermediate routers) are empowered to change the paths their traffic uses by modifying a number of bits in the packet headers. These bits allow intermediate routers to choose alternate paths from the shortest one. To that end, this paper exposes SKWeak (Selective K Weakest links) attacks that exploit the adaptive...
Wireless communication technologies such as microwave radios are used to provide high-speed mobile backhaul connectivity for radio access networks in cases in which wire-based alternatives, e.g. cable or fiber, are not readily available and cannot be deployed in an economic or timely manner. Current mobile backhauls are predominantly deployed in tree or ring topologies, which simplify traffic management...
We will propose an adaptive distributed power management (DISPOW) algorithm that adaptively preserves network connectivity and cooperatively reduces interference for the dynamic environment and the changing network topology thereby improving the network performance. The proposed algorithm distributively builds a unique stable network topology tailored to its surrounding node density and propagation...
We investigate the challenging problem of joint topology design and load balancing in FSO networks. Important factors such as FSO link characteristics, cost constraints, traffic characteristics, traffic demand, and QoS requirements are considered in the problem formulation, along with objective functions of network-wide average traffic load and delay. We develop a fast heuristic algorithm to provide...
This paper introduces a dynamic bandwidth assignment algorithm designed for ring topology (R-DBA) in order to meet the needs of the construction of Metropolitan Area Network (MAN).This algorithm targets ring topology, based on fair iteration, supports various Qos services and has previous assignment mechanism.
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.