Improve Bandwidth Utilization Research Articles

Improved Bandwidth Utilization based Check pointing Algorithm in Distributed Database

paper, we present an optimal-bandwidth, min-process coordinated check pointing algorithm suitable for network failure prone applications in distributed systems. In the developed algorithm, during normal computation message transmission, dependency information among clusters is recorded in the corresponding cluster head processes. When a check pointing procedure begins, the initiator from a cluster concurrently sends composite message to all the cluster head processes which after extracting individual messages from it, further multicasts individual messages to the corresponding currently active receiving processes in their corresponding clusters thus resulting in reduced transmission delay and communication cost, better bandwidth utilization and faster speed of execution. Quantitative analysis shows that proposed algorithm works efficiently in terms of better response time and maximum bandwidth utilization for applications running under critical conditions such as low bandwidth availability and thereby resulting in frequent disconnections.

An Enhanced Reservation-Based MAC Protocol for IEEE 802.15.4 Networks

The IEEE 802.15.4 Medium Access Control (MAC) protocol is an enabling standard for wireless sensor networks. In order to support applications requiring dedicated bandwidth or bounded delay, it provides a reservation-based scheme named Guaranteed Time Slot (GTS). However, the GTS scheme presents some drawbacks, such as inefficient bandwidth utilization and support to a maximum of only seven devices. This paper presents eLPRT (enhanced Low Power Real Time), a new reservation-based MAC protocol that introduces several performance enhancing features in comparison to the GTS scheme. This MAC protocol builds on top of LPRT (Low Power Real Time) and includes various mechanisms designed to increase data transmission reliability against channel errors, improve bandwidth utilization and increase the number of supported devices. A motion capture system based on inertial and magnetic sensors has been used to validate the protocol. The effectiveness of the performance enhancements introduced by each of the new features is demonstrated through the provision of both simulation and experimental results.

Log-Based Admission Control Scheme for Dynamic Spectrum Access Networks

SUMMARY Dynamic spectrum access (DSA) has drawn immediate attention recently since it can opportunistically exploit any spectrum holes and thus improve bandwidth utilization. From the perspective of medium access control (MAC) design, the QoS requirement of SU is one of the design issues in DSA network. In this paper, we propose a new admission control scheme referred to as log-based dynamic spectrum access admission control (DSAC) aiming at (1) protection of the primary users and (2) QoS prioritization for the existing secondary users. The DSAC algorithm protects the PU by limiting SUs’ access using PU’s arrival log or statistics. Furthermore, the DSAC reserves a channel for previously admitted SU to reduce frequent service disruption of the SU. Reservation of channels is carried out without assuming any specific arrival process, and thus the DSAC would be practical for general user arrival patterns unlike the existing admission control techniques. Performance evaluation has shown that the proposed DSAC outperforms existing admission control schemes with respect to the PU blocking rate, SU communication stability, and SU aggregate throughput by about 13%, 26%, and 20%, respectively.

A Novel Embedded Statistical Scheduler for Realising High System-QoS

A Novel Embedded Statistical Scheduler for Realising High System-QoS

A Bandwidth Efficient Scheduling Framework for Non Real Time Applications in Wireless Networks

The key concern on the bandwidth allocation and scheduling for non real time traffic are the fulfillment of its minimum throughput requirement and improvement of bandwidth utilization with acceptable delay. This paper proposes a simple and efficient scheduling framework for allocating bandwidth to non real time polling service (nrtPS) users in IEEE 802.16 networks. In this framework, jointly selective repeat ARQ at the MAC layer and adaptive modulation and coding techniques at the physical are considered. Numerical simulations demonstrate that the proposed scheduling approach provides a graceful compromise between bandwidth utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. Thus proves the efficiency of the proposed framework. The simulation is done for unicast scenario.

QoS-driven network coded wireless multicast

Emerging wireless multicast applications simultaneously impose two requirements to the underlying communication networks: to provide sufficient bandwidth and to support a variety of quality-of-service (QoS) sensitivities. For the first requirement, network coding has been proposed recently as an effective way of improving bandwidth utilization. However, almost all previous works about network coding focus on the throughput gain without considering the QoS requirements. Optimal network code construction in wireless multicast under different QoS constraints remains as a significant challenge. In this research, we study the QoS-driven network coding problem. We use large deviation principle to establish the relationship among source rate, link condition, QoS requirement, and network code. Using this relationship, under given QoS requirements, we solve the optimal network code construction problem. The proposed network code supports maximal source rate without violating the QoS requirements. These results constitute the foundations for future designing and implementing network coding based wireless multicast protocols.

An Efficient Data Aggregation Algorithm for Cluster-based Sensor Network

Data aggregation in wireless sensor networks eliminates redundancy to improve bandwidth utilization and energyefficiency of sensor nodes. One node, called the cluster leader, collects data from surrounding nodes and then sends the summarized information to upstream nodes. In this paper, we propose an algorithm to select a cluster leader that will perform data aggregation in a partially connected sensor network. The algorithm reduces the traffic flow inside the network by adaptively selecting the shortest route for packet routing to the cluster leader. We also describe a simulation framework for functional analysis of WSN applications taking our proposed algorithm as an example.

A novel multi-channel MAC protocol with directional antenna for enhancing spatial reuse and bandwidth utilization in WLANs

This paper aims at developing an efficient MAC protocol for wireless LAN by considering multi-channel and directional antennae. Extending IEEE 802.11 to a multi-channel environment not only exploits the bandwidth utilization but also reduces the degree of contentions. Involving directional antennae in designing multi-channel MAC protocol additionally increases the spatial reuse, allowing more parallel communications. This study proposes an efficient Multi-Channel MAC protocol with a Directional Antenna (MCDA) for WLAN. Since each station is only equipped with a single antenna, communicating pairs that progress their communications on data channels cannot maintain the channel usage information which is only obtained from the control channel, raising the channel collision problem. The proposed protocol adopts the channel switch sequence (CSS) mechanism to cope with the channel collision problem and to reduce message exchange overhead for switching channels. According to the state management, MCDA then controls directional antenna transmitting data on a selected channel to exploit the opportunities of spatial reuse, and to maintain fairness among communicating pairs. Simulation results show that the proposed MCDA protocol maintains the fairness and significantly improves bandwidth utilization and throughput.

Hardness and approximation of traffic grooming

Traffic grooming is a central problem in optical networks. It refers to packing low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM networks, the most accepted criterion is to minimize the number of electronic terminations, namely the number of SONET Add–Drop Multiplexers (ADMs). In this article we focus on ring and path topologies. On the one hand, we provide an inapproximability result for Traffic Grooming for fixed values of the grooming factor g , answering affirmatively the conjecture of Chow and Lin [T. Chow, P. Lin, The ring grooming problem, Networks 44 (2004), 194–202]. More precisely, we prove that Ring Traffic Grooming for fixed g ≥ 1 and Path Traffic Grooming for fixed g ≥ 2 are Apx-complete. That is, they do not accept a PTAS unless P = NP . Both results rely on the fact that finding the maximum number of edge-disjoint triangles in a tripartite graph (and more generally cycles of length 2 g + 1 in a ( 2 g + 1 ) -partite graph of girth 2 g + 1 ) is Apx-complete. On the other hand, we provide a polynomial-time approximation algorithm for Ring and Path Traffic Grooming, based on a greedy cover algorithm, with an approximation ratio independent of g . Namely, the approximation guarantee is O ( n 1 / 3 log 2 n ) for any g ≥ 1 , n being the size of the network. This is useful in practical applications, since in backbone networks the grooming factor is usually greater than the network size. Finally, we improve this approximation ratio under some extra assumptions about the request graph.

An improved efficient performance design with multiple channels and bandwidth allocation strategy for mobile ad hoc networks

PurposeIn this paper, the design of multiple channels to achieve the goal of a high‐performance medium access control (MAC) protocol is to be proposed to solve the problem of wasting bandwidth resources due to waiting for the backoff time.Design/methodology/approachIn the MAC design of this paper, a control channel and a data channel are used to improve bandwidth utilization. When the control channel waits for the backoff time, the data channel may transfer data. As a result, bandwidth utilization can be improved. In order to have better bandwidth utilization in multiple channels, the authors also propose a bandwidth allocation strategy for control channels and data channels. According to the strategy, the control and data signals can be smoothly transmitted without blocking or waiting, thereby not wasting bandwidth resources. Finally, the authors propose multiple control sub‐channels and data sub‐channels to further reduce the backoff time penalty and make more communication pairs work in a transmission range to increase the throughput.FindingsThe paper solves the following problems bandwidth waste that results from waiting for the backoff time in the single channel model and bandwidth allocation strategy for the control and data sub‐channels in the multiple channel model to achieve throughput enhancement in mobile ad‐hoc networks.Research limitations/implicationsThe proposed method needs the support of multiple channels.Practical implicationsFrom the result, the bandwidth allocation ratio of the proposed method performs better than other various allocation ratios. In addition, the proposed method with the bandwidth allocation strategy and multiple data and control sub‐channels results in a better throughput than IEEE 802.11 DCF by 22.3 per cent.Originality/valueThe proposed method using multiple control and data sub‐channels can improve the throughput and reduce bandwidth waste over IEEE 802.11 DCF.

M-1-1 Cooperative Protocol Based on OSOC-SS to Improve Bandwidth Utilization in USN

A bandwidth and power efficient high speed ubiquitous sensor network(USN) for realizing a ubiquitous society is a great challenge for researcher community. In this paper we incorporate a cooperative transmission protocol within a special type of multi-code modulation to meet these requirements. Multi-code(Mc) modulation has been developed for high-speed data transmission over wireless channels. We proposed a new class of orthogonal codes for multi-code modulation which is an orthogonal subset of orthogonal codes(OSOC). Our proposed OSOC structure allows us to use only one relay to cooperate M nodes that effectively reduces the bandwidth and power requirement. This protocol is similar to spread-spectrum(SS) technique that can reduce both broad and narrow band jamming.

다중 무선 공유기에서 SSID Hiding 공유 기법을 이용한 대역폭 이용률 극대화

선 공유기란 NAT(Network Address Translation) 기능을 사용하여 여러 무선 사용자가 인터넷회선 하나를 공유할 수 있게 해주는 장치이다. 여러 개의 무선 공유기를 여러 사용자가 공유하여 사용하는 학교 또는 소규모 사무실 환경에서 사용자들은 무선 공유기들을 임의대로 선택하여 사용할 수 있어서 특정 무선 공유기에 사용자들이 몰리는 현상이 발생할 수 있다. 이러한 경우 무선공유기와 사용자들사이에 부하 불균형의 문제가 발생한다. 그로 인하여 생기는 문제점중 하나는 사용자가 몰리는 무선 공유기에 속하는 사용자들의 경우 서비스가 원활하지 않다는 점이다. 또 다른 문제점은 무선 공유기 전체 자원 이용률이 낮다는 점이다. 이 문제들을 해결하는 방법으로 본 논문은 SSID(Service Set IDentifier) Hiding을 이용하여 무선 공유기의 대역폭 이용률을 극대화하는 부하 공유 기법을 제안한다. 제안된 기법에서는 주기적으로 각 무선 공유기들의 사용가능한 대역폭을 확인하여 가장 높은 무선 공유기를 선택한다. 새로운 사용자가 들어오게 되면 그 높은 무선 공유기만 그 사용자에게 보이게 하고 나머지 무선 공유기들은 보이지 않게 한다. 이 동작은 SSID hiding을 이용하여 구현되었다. 제안한 방법을 ASUS WL 500G 무선 공유기를 이용하여 구현하였으며 실험을 수행하였다. 실험을 통해 제안된 방법이 기존 방법에 비해 대역폭 이용률이 향상되었음을 확인하였다. A wireless router is a device which allows several wireless clients to share an internet line using NAT (Network Address Translation). In a school or a small office environment where many clients use multiple wireless routers, a client may select any one of wireless routers so that most clients can be clustered to a small set of the wireless routers. In such a case, there exists load unbalancing problem between clients and wireless routers. One of its result is that clients using the busiest router get poor service. The other is that the resource utilization of the whole wireless routers becomes very low. In order to resolve the problems, we propose a load sharing scheme to maximize network bandwidth utilization based on SSID(Service Set IDentifier) hiding. The proposed scheme keeps checking the available bandwidth of all the possible wireless routers in a time interval and select the most available one. If a new client appears, the most available router is visible to him or her whereas the others are not visible. This is handled by SSID hiding in the proposed scheme. We implemented the proposed scheme with ASUS WL 500G wireless router and performed experiments. Experimental results show the bandwidth utilization improvement compared to the existing method.

Mini-slot TDM WDM optical networks

In recent years, optical transport networks have evolved from interconnected SONET/WDM ring networks to mesh-based optical WDM networks. Time-slot wavelength switching is to aggregate the lower rate traffic at the time-slot level into a wavelength in order to improve bandwidth utilization. With the advancement of fiber-optics technologies, continual increase of fiber bandwidth and number of wavelengths in each fiber, it is possible to divide a wavelength in a fiber into time-slots, and further divide a time-slot into mini-slots so that the fiber bandwidth can be more efficiently utilized. This article proposes a router architecture with an electronic system controller to support optical data transfer at the mini-slot(s) of a time-slot in a wavelength for each hop of a route. The proposed router architecture performs optical circuit switching and does not use any wavelength converter. Each node in the mini-slot TDM WDM optical network consists of the proposed router architecture. Three different network topologies are used to demonstrate the effectiveness and behavior of this type of network in terms of blocking probability and throughput.

A Reliable Link-Layer Protocol for Robust and Scalable Intervehicle Communications

Current link-layer protocols for safety-related intervehicle communication (IVC) networks suffer from significant scalability and security challenges. Carrier sense multiple-access approaches produce excessive transmission collisions at high vehicle densities and are vulnerable to a variety of denial of service (DoS) attacks. Explicit time slot allocation approaches tend to be limited by the need for a fixed infrastructure, a high number of control messages, or poor bandwidth utilization, particularly in low-density traffic. This paper presents a novel adaptation of the explicit time slot allocation protocols for IVC networks. The protocol adaptive space-division multiplexing (ASDM) requires no control messages, provides protection against a range of DoS attacks, significantly improves bandwidth utilization, and automatically adjusts the time slot allocation in response to changes in vehicle densities. This paper demonstrates the need for and the effectiveness of this new protocol. The exposures of the current proposals to attacks on availability and integrity, as well as the improvements effected by ASDM, are analytically evaluated. Furthermore, through simulation studies, ASDM's ability to provide message delivery guarantees is contrasted with the inability of the current IVC proposals to do the same

Improving duplicate elimination in storage systems

Minimizing the amount of data that must be stored and managed is a key goal for any storage architecture that purports to be scalable. One way to achieve this goal is to avoid maintaining duplicate copies of the same data. Eliminating redundant data at the source by not writing data which has already been stored not only reduces storage overheads, but can also improve bandwidth utilization. For these reasons, in the face of today's exponentially growing data volumes, redundant data elimination techniques have assumed critical significance in the design of modern storage systems.Intelligent object partitioning techniques identify data that is new when objects are updated, and transfer only these chunks to a storage server. In this article, we propose a new object partitioning technique, called fingerdiff , that improves upon existing schemes in several important respects. Most notably, fingerdiff dynamically chooses a partitioning strategy for a data object based on its similarities with previously stored objects in order to improve storage and bandwidth utilization. We present a detailed evaluation of fingerdiff , and other existing object partitioning schemes, using a set of real-world workloads. We show that for these workloads, the duplicate elimination strategies employed by fingerdiff improve storage utilization on average by 25%, and bandwidth utilization on average by 40% over comparable techniques.

Efficient bandwidth allocation algorithm for ethernet passive optical networks

Bandwidth allocation is one of the critical issues in Ethernet passive optical networks (EPONs). To achieve good network performance and thus provide guaranteed network service to end users, an EPON system must employ an efficient bandwidth allocation algorithm to dynamically allocate the limited bandwidth of the upstream transmission channel among multiple optical network units (ONUs). In the paper, an efficient bandwidth allocation algorithm for an EPON system is proposed. The proposed algorithm uses the multipoint control protocol (MPCP) defined by the IEEE 802.3ah Task Force to arbitrate the transmission of multiple ONUs, and incorporates a dynamic bandwidth allocation (DBA) scheme that makes use of the excessive bandwidth of lightly loaded ONUs to meet the bandwidth demand of heavily loaded ONUs. To improve bandwidth utilisation under high traffic load, an effective scheduling control mechanism is also incorporated to address the idle period problem. Through simulation experiments, it is shown that the proposed algorithm can significantly improve the network performance in terms of packet delay, queue length, and throughput under high traffic load as compared with a well-known DBA algorithm in the literature.

Optimum Arrangement of Reliable Label-Switched Paths in MPLS Over Optical Networks

In MPLS (Multi-Protocol Label Switching) over optical networks, both the optical level and the MPLS level fault recovery can be considered. Generally, a more flexible path arrangement can be realized by the MPLS level recovery, while fast recovery can be achieved by the optical level recovery. When the optical level recovery is adopted, only normal traffic is carried through the working lightpaths and only recovered traffic is carried through the backup lightpaths. In contrast, the working LSPs (Label-Switched Paths) and the backup LSPs corresponding to other working LSPs can be accommodated into an identical lightpath when the MPLS level recovery is adopted. By such sophisticated accommodation of LSPs into the lightpaths, lightpath bandwidth can be utilized efficiently under the condition that the bandwidth utilization is restricted to attain the given objective of transfer quality for the MPLS packets in the normal state and unrestricted in a short time a failure occurs somewhere in the network. This paper proposes a simple mathematical programming model to obtain the optimum arrangement of the working and backup LSPs assuming the MPLS level recovery and a practical LSPs provisioning mode. By comparing the minimized network cost obtained from the optimum arrangement of the working and backup LSPs with the network cost resulting from the optical level recovery, this paper quantitatively evaluates the effectiveness of such bandwidth utilization improvement obtained from the MPLS level recovery and reveals that the MPLS level recovery can actually reduce the network cost due to its flexible arrangement of LSPs on the lightpaths.

Energy-efficient secure pattern based data aggregation for wireless sensor networks

Data aggregation in wireless sensor networks eliminates redundancy to improve bandwidth utilization and energy-efficiency of sensor nodes. This paper presents a secure energy-efficient data aggregation protocol called ESPDA (Energy-Efficient Secure Pattern based Data Aggregation). Unlike conventional data aggregation techniques, ESPDA prevents the redundant data transmission from sensor nodes to cluster-heads. If sensor nodes sense the same data, ESPDA first puts all but one of them into sleep mode and generate pattern codes to represent the characteristics of data sensed by sensor nodes. Cluster-heads implement data aggregation based on pattern codes and only distinct data in encrypted form is transmitted from sensor nodes to the base station via cluster-heads. Due to the use of pattern codes, cluster-heads do not need to know the sensor data to perform data aggregation, which allows sensor nodes to establish secure end-to-end communication links with base station. Therefore, there is no need for encryption/decryption key distribution between the cluster-heads and sensor nodes. Moreover, the use of NOVSF Block-Hopping technique improves the security by randomly changing the mapping of data blocks to NOVSF time slots. Performance evaluation shows that ESPDA outperforms conventional data aggregation methods up to 50% in bandwidth efficiency.

An Enhanced Handoff Control Scheme for Multimedia Traffic in Cellular Networks

This letter presents an enhanced handoff control scheme allowing dynamic bandwidth sharing between different types of traffic for improving bandwidth utilization in multimedia mobile cellular networks. Performance results for the proposed scheme are obtained analytically and by simulation. The results demonstrate superior efficiency achieved by the proposed scheme.

Analysis of a dynamically wavelength-routed optical burst switched network architecture

The concept of optical burst switching (OBS) aims to allow access to optical bandwidth in dense wavelength division multiplexed (DWDM) networks at fractions of the optical line rate to improve bandwidth utilization efficiency. This paper studies an alternative network architecture combining OBS with dynamic wavelength allocation under fast circuit switching to provide a scalable optical architecture with a guaranteed QoS in the presence of dynamic and bursty traffic loads. In the proposed architecture, all processing and buffering are concentrated at the network edge and bursts are routed over an optical transport core using dynamic wavelength assignment. It is assumed that there are no buffers or wavelength conversion in core nodes and that fast tuneable laser sources are used in the edge routers. This eliminates the forwarding bottleneck of electronic routers in DWDM networks for terabit-per-second throughput and guarantees forwarding with predefined delay at the edge and latency due only to propagation time in the core. The edge burst aggregation mechanisms are evaluated for a range of traffic statistics to identify their impact on the allowable burst lengths, required buffer size and achievable edge delays. Bandwidth utilization and wavelength reuse are introduced as new parameters characterizing the network performance in the case of dynamic wavelength allocation. Based on an analytical model, upper bounds for these parameters are derived to quantify the advantages of wavelength channel reuse, including the influence of the signaling round-trip time required for lightpath reservation. The results allow to quantify the operational gain achievable with fast wavelength switching compared to quasistatic wavelength-routed optical networks and can be applied to the design of future optical network architectures.