An intelligent approach to quality of service for MPEG-4 video transmission in IEEE 802.15.1

Nowadays, wireless connectivity is becoming ubiquitous spreading to companies and in domestic areas. IEEE 802.15.1 commonly known as Bluetooth is high-quality, high-security, high-speed and low-cost radio signal technology. This wireless technology allows a maximum access range of 100 meters yet needs power as low as 1mW. Regrettably, IEEE 802.15.1 has a very limited bandwidth. This limitation can become a real problem If the user wishes to transmit a large amount of data in a very short time. The version 1.2 which is used in this project could only carry a maximum download rate of 724Kbps and an upload rate of 54Kbps In its asynchronous mode. But video needs a very large bandwidth to be transmitted with a sufficient level of quality. Video transmission over IEEE 802.15.1 networks would therefore be difficult to achieve, due to the limited bandwidth. Hence, a solution to transmit digital video with a sufficient quality of picture to arrive at the receiving end is required. A hybrid scheme has been developed in this thesis, comprises of a fuzzy logic set of rules and an artificial neural network algorithms. MPEG-4 video compression has been used in this work to optimise the transmission. This research further utilises an ‘added-buffer’ to prevent excessive data loss of MPEG-4 video over IEEE 802.15.1transmission and subsequently increase picture quality. The neural-fuzzy scheme regulates the output rate of the added-buffer to ensure that MPEG-4 video stream conforms to the traffic conditions of the IEEE 802.15.1 channel during the transmission period, that is to send more data when the bandwidth is not fully used and keep the data in the buffers if the bandwidth is overused. Computer simulation results confirm that intelligence techniques and added-buffer do improve quality of picture, reduce data loss and communication delay, as compared with conventional MPEG video transmission over IEEE 802.15.1

Centralized Rate Allocation and Control in 802.11-based Wireless Mesh Networks

Wireless Mesh Networks (WMNs) built with commodity 802.11 radios are a cost-effective means of providing last mile broadband Internet access. Their multihop architecture allows for rapid deployment and organic growth of these networks. 802.11 radios are an important building block in WMNs. These low cost radios are readily available, and can be used globally in license-exempt frequency bands. However, the 802.11 Distributed Coordination Function (DCF) medium access mechanism does not scale well in large multihop networks. This produces suboptimal behavior in many transport protocols, including TCP, the dominant transport protocol in the Internet. In particular, cross-layer interaction between DCF and TCP results in flow level unfairness, including starvation, with backlogged traffic sources. Solutions found in the literature propose distributed source rate control algorithms to alleviate this problem. However, this requires MAC-layer or transport-layer changes on all mesh routers. This is often infeasible in practical deployments. In wireline networks, router-assisted rate control techniques have been proposed for use alongside end-to-end mechanisms. We evaluate the feasibility of establishing similar centralized control via gateway mesh routers in WMNs. We find that commonly used router-assisted flow control schemes designed for wired networks fail in WMNs. This is because they assume that: (1) links can be scheduled independently, and (2) router queue buildups are sufficient for detecting congestion. These abstractions do not hold in a wireless network, rendering wired scheduling algorithms such as Fair Queueing (and its variants) and Active Queue Management (AQM) techniques ineffective as a gateway-enforceable solution in a WMN. We show that only non-work-conserving rate-based scheduling can effectively enforce rate allocation via a single centralized traffic-aggregation point. In this context we propose, design, and evaluate a framework of centralized, measurement-based, feedback-driven mechanisms that can enforce a rate allocation policy objective for adaptive traffic streams in a WMN. In this dissertation we focus on fair rate allocation requirements. Our approach does not require any changes to individual mesh routers. Further, it uses existing data traffic as capacity probes, thus incurring a zero control traffic overhead. We propose two mechanisms based on this approach: aggregate rate control (ARC) and per-flow rate control (PFRC). ARC limits the aggregate capacity of a network to the sum of fair rates for a given set of flows. We show that the resulting rate allocation achieved by DCF is approximately max-min fair. PFRC allows us to exercise finer-grained control over the rate allocation process. We show how it can be used to achieve weighted flow rate fairness. We evaluate the performance of these mechanisms using simulations as well as implementation on a multihop wireless testbed. Our comparative analysis show that our mechanisms improve fairness indices by a factor of 2 to 3 when compared with networks without any rate limiting, and are approximately equivalent to results achieved with distributed source rate limiting mechanisms that require software modifications on all mesh routers

Quality of service modeling and analysis for carrier ethernet

Today, Ethernet is moving into the mainstream evolving into a carrier grade technology. Termed as Carrier Ethernet it is expected to overcome most of the\ud shortcomings of native Ethernet. It is envisioned to carry services end-to-end serving corporate data networking and broadband access demands as well as backhauling wireless traffic. As the penetration of Ethernet increases, the offered Quality of Service (QoS) will become increasingly important and a distinguishing factor between different service providers. The challenge is to meet the QoS requirements of end applications such as response times, throughput, delay and jitter by managing the network resources at hand. Since Ethernet was not designed to operate in large public networks it does not possess functionalities to address this issue. In this thesis we propose and analyze mechanisms which improve the QoS performance of Ethernet enabling it to meet the demands of the current and next generation services and applications.\u

Distributed workload and response time management for web applications

Abstract-Managing workload for large scale web applications is a fundamental task for satisfactory quality of service, low management and operation cost. In this paper, we present SCOPS, a system of distributed workload management to achieve service differentiation and overload protection in such large scale deployment. Our system splits the workload management logic into distributed components on each back-end server and frontend proxy. The control solution is designed to protect the backend server from overloading and to achieve both efficient usage of system resource and service differentiation by employing a unique optimization target. The control components are automatically organized based on the flow of workloads, such that management overhead is minimized. SCOPS is extremely flexible because it requires no source code changes to host OS, application servers, or web applications. Additionally, the distributed design makes it scalable and robust for cloud scale server deployment. Experiments with our implementation confirm SCOPS's performance with dynamic heavy workload, incurring neglectable runtime overhead. More importantly, SCOPS also ensures fault-tolerance and fast convergence to system failures