2,954 research outputs found
Effective Scheduling for Coded Distributed Storage in Wireless Sensor Networks
A distributed storage approach is proposed to access data reliably and to cope with node failures in wireless sensor networks. This approach is based on random linear network coding in combination with a scheduling algorithm based on backpressure. Upper bounds are provided on the maximum rate at which data can be reliably stored. Moreover, it is shown that the backpressure algorithm allows to operate the network in a decentralized fashion for any rate below this maximum
Dynamic algorithms for multicast with intra-session network coding
The problem of multiple multicast sessions with
intra-session network coding in time-varying networks is considered.
The network-layer capacity region of input rates that can be
stably supported is established. Dynamic algorithms for multicast
routing, network coding, power allocation, session scheduling, and
rate allocation across correlated sources, which achieve stability
for rates within the capacity region, are presented. This work
builds on the back-pressure approach introduced by Tassiulas
et al., extending it to network coding and correlated sources. In
the proposed algorithms, decisions on routing, network coding,
and scheduling between different sessions at a node are made
locally at each node based on virtual queues for different sinks.
For correlated sources, the sinks locally determine and control
transmission rates across the sources. The proposed approach
yields a completely distributed algorithm for wired networks.
In the wireless case, power control among different transmitters
is centralized while routing, network coding, and scheduling
between different sessions at a given node are distributed
Efficient Resource Management Mechanism for 802.16 Wireless Networks Based on Weighted Fair Queuing
Wireless Networking continues on its path of being one of the most commonly used means of communication. The evolution of this technology has taken place through the design of various protocols. Some common wireless protocols are the WLAN, 802.16 or WiMAX, and the emerging 802.20, which specializes in high speed vehicular networks, taking the concept from 802.16 to higher levels of performance. As with any large network, congestion becomes an important issue. Congestion gains importance as more hosts join a wireless network. In most cases, congestion is caused by the lack of an efficient mechanism to deal with exponential increases in host devices. This can effectively lead to very huge bottlenecks in the network causing slow sluggish performance, which may eventually reduce the speed of the network. With continuous advancement being the trend in this technology, the proposal of an efficient scheme for wireless resource allocation is an important solution to the problem of congestion. The primary area of focus will be the emerging standard for wireless networks, the 802.16 or “WiMAX”. This project, attempts to propose a mechanism for an effective resource management mechanism between subscriber stations and the corresponding base station
Quality of Service over Specific Link Layers: state of the art report
The Integrated Services concept is proposed as an enhancement to the current Internet architecture, to provide a better Quality of Service (QoS) than that provided by the traditional Best-Effort service. The features of the Integrated Services are explained in this report. To support Integrated Services, certain requirements are posed on the underlying link layer. These requirements are studied by the Integrated Services over Specific Link Layers (ISSLL) IETF working group. The status of this ongoing research is reported in this document. To be more specific, the solutions to provide Integrated Services over ATM, IEEE 802 LAN technologies and low-bitrate links are evaluated in detail. The ISSLL working group has not yet studied the requirements, that are posed on the underlying link layer, when this link layer is wireless. Therefore, this state of the art report is extended with an identification of the requirements that are posed on the underlying wireless link, to provide differentiated Quality of Service
Network Coding in a Multicast Switch
We consider the problem of serving multicast flows in a crossbar switch. We
show that linear network coding across packets of a flow can sustain traffic
patterns that cannot be served if network coding were not allowed. Thus,
network coding leads to a larger rate region in a multicast crossbar switch. We
demonstrate a traffic pattern which requires a switch speedup if coding is not
allowed, whereas, with coding the speedup requirement is eliminated completely.
In addition to throughput benefits, coding simplifies the characterization of
the rate region. We give a graph-theoretic characterization of the rate region
with fanout splitting and intra-flow coding, in terms of the stable set
polytope of the 'enhanced conflict graph' of the traffic pattern. Such a
formulation is not known in the case of fanout splitting without coding. We
show that computing the offline schedule (i.e. using prior knowledge of the
flow arrival rates) can be reduced to certain graph coloring problems. Finally,
we propose online algorithms (i.e. using only the current queue occupancy
information) for multicast scheduling based on our graph-theoretic formulation.
In particular, we show that a maximum weighted stable set algorithm stabilizes
the queues for all rates within the rate region.Comment: 9 pages, submitted to IEEE INFOCOM 200
Optimal Control of Distributed Computing Networks with Mixed-Cast Traffic Flows
Distributed computing networks, tasked with both packet transmission and
processing, require the joint optimization of communication and computation
resources. We develop a dynamic control policy that determines both routes and
processing locations for packets upon their arrival at a distributed computing
network. The proposed policy, referred to as Universal Computing Network
Control (UCNC), guarantees that packets i) are processed by a specified chain
of service functions, ii) follow cycle-free routes between consecutive
functions, and iii) are delivered to their corresponding set of destinations
via proper packet duplications. UCNC is shown to be throughput-optimal for any
mix of unicast and multicast traffic, and is the first throughput-optimal
policy for non-unicast traffic in distributed computing networks with both
communication and computation constraints. Moreover, simulation results suggest
that UCNC yields substantially lower average packet delay compared with
existing control policies for unicast traffic
On-board B-ISDN fast packet switching architectures. Phase 2: Development. Proof-of-concept architecture definition report
For the next-generation packet switched communications satellite system with onboard processing and spot-beam operation, a reliable onboard fast packet switch is essential to route packets from different uplink beams to different downlink beams. The rapid emergence of point-to-point services such as video distribution, and the large demand for video conference, distributed data processing, and network management makes the multicast function essential to a fast packet switch (FPS). The satellite's inherent broadcast features gives the satellite network an advantage over the terrestrial network in providing multicast services. This report evaluates alternate multicast FPS architectures for onboard baseband switching applications and selects a candidate for subsequent breadboard development. Architecture evaluation and selection will be based on the study performed in phase 1, 'Onboard B-ISDN Fast Packet Switching Architectures', and other switch architectures which have become commercially available as large scale integration (LSI) devices
CSP channels for CAN-bus connected embedded control systems
Closed loop control system typically contains multitude of sensors and actuators operated simultaneously. So they are parallel and distributed in its essence. But when mapping this parallelism to software, lot of obstacles concerning multithreading communication and synchronization issues arise. To overcome this problem, the CT kernel/library based on CSP algebra has been developed. This project (TES.5410) is about developing communication extension to the CT library to make it applicable in distributed systems. Since the library is tailored for control systems, properties and requirements of control systems are taken into special consideration. Applicability of existing middleware solutions is examined. A comparison of applicable fieldbus protocols is done in order to determine most suitable ones and CAN fieldbus is chosen to be first fieldbus used. Brief overview of CSP and existing CSP based libraries is given. Middleware architecture is proposed along with few novel ideas
- …