Resource Allocation Protocol Research Articles

Design of an enhanced access point to optimize TCP performance in Wi-Fi hotspot networks

In the last years, the number of Wi-Fi hotspots at public venues has undergone a substantial growth, promoting the WLAN technologies as the ubiquitous solution to provide high-speed wireless connectivity in public areas. However, the adoption of a random access CSMA-based paradigm for the 802.11 MAC protocol makes difficult to ensure high throughput and a fair allocation of radio resources in 802.11- based WLANs. In this paper we evaluate extensively via simulations the interaction between the flow control mechanisms implemented at the TCP layer and the contention avoidance techniques used at the 802.11 MAC layer. We conducted our study considering initially M wireless stations performing downloads from the Internet. From our results, we observed that the TCP downlink throughput is not limited by the collision events, but by the inability of the MAC protocol to assign a higher chance of accessing the channel to the base station. We propose a simple and easy to implement modification of the base station's behavior with the purpose of increasing the TCP throughput reducing useless MAC protocol overheads. With our scheme, the base station is allowed to transmit periodically bursts of data frames towards the mobile hosts. We design a resource allocation protocol aimed at maximizing the success probability of the uplink transmissions by dynamically adapting the burst length to the collision probability estimated by the base station. By its design, our scheme is also beneficial to achieve a fairer allocation of the channel bandwidth among the downlink and uplink flows, and among TCP and UDP flows. Simulation results confirm both the improvement in the TCP downlink throughput and the reduction of system unfairness.

Auctioning resources in Grids: model and protocols

In this paper, we propose and study an auction model for resource management in Grids. We propose and investigate by simulation three types of auction-based resource-allocation protocols: (i) first-price auction protocol; (ii) Vickrey auction protocol; and (iii) double auction protocol. The goal is to find which of these is best suited to the Grid environment from the users' perspective as well as from the resources' perspective. The results showed that when we consider a mix of risk-averse and risk-neutral users, the first-price auction protocol favors resources while the Vickrey auction protocol favors users. On the other hand, the double auction protocol favors both users and resources. Copyright © 2006 John Wiley & Sons, Ltd.

A Deadlock and Livelock Free Protocol for Decentralized Internet Resource Coallocation

Computing over the Internet is becoming increasingly popular. With the emerging infrastructures such as computational grids and Web services, it is possible to develop applications that support various Internet-wide collaborations through seamlessly harnessing appropriate Internet resources. Yet, as Internet computing is becoming pervasive, it also presents a number of new challenges in designing efficient resource allocation protocol that provides clear directives on the acquisition of shared resources. In particular, the problem of coallocating distributed Internet resources that span multiple administrative domains is complicated by 1) the need for scalability, 2) the availability of alternative co-allocation schemes, 3) the possibility of deadlock and livelock, and finally 4) the lack of means for changing information between the independent Internet applications. Motivated by this, this paper develops a new scalable protocol for fast coallocation of Internet resources. The proposed protocol is free from deadlock and livelock, and seeks to effectively exploit the available alternative resource coallocation schemes through parallelization of requests for required resources. Experimental results demonstrate that the proposed protocol yields a significant performance improvement over the existing deadlock prevention protocol.

Analysis of Workflow Protocol Adaptability in TestLAN Production Systems

Abstract The testing local area network, TestLAN, is an approach to the design of integrated testing systems. Its objective is to link a network of testers such that distributed clients (jobs) requiring testing services can be served efficiently with minimum delays through the use of dynamic priority assignment, time-out, and resource allocation protocols. Previous research has shown this approach to improve performance, but assumed that the protocols are static. Events such as demand fluctuation and design changes, however, can affect the usefulness of the protocol logic, thereby adversely affecting the performance of the system. This paper investigates the thresholds of change and the time at which protocols should be re-evaluated for possible changes. The results of the analysis show that significant improvement can be gained by protocol adaptation, with certain cases realizing improvement in the flow time by as much as 32%, compared to the non-adaptable TestLAN. However, differences among adaptation methods are more difficult to generalize, as they depend on the particular cases. In many cases, adapting protocol logic when thresholds are in the range 0.2 ≤ Δ ≤ 0.4, the percentage change of the parameters of the system in either direction, reduces flow time significantly, yet these thresholds are not general. The importance of this analysis is that the experiments cover a large space of general conditions, and general design recommendations for protocol adaptation are developed.

Analysis of workflow protocol adaptability in TestLAN production systems

The testing local area network, TestLAN, is an approach to the design of integrated testing systems. Its objective is to link a network of testers such that distributed clients (jobs) requiring testing services can be served efficiently with minimum delays through the use of dynamic priority assignment, time-out, and resource allocation protocols. Previous research has shown this approach to improve performance, but assumed that the protocols are static. Events such as demand fluctuation and design changes, however, can affect the usefulness of the protocol logic, thereby adversely affecting the performance of the system. This paper investigates the thresholds of change and the time at which protocols should be re-evaluated for possible changes. The results of the analysis show that significant improvement can be gained by protocol adaptation, with certain cases realizing improvement in the flow time by as much as 32%, compared to the non-adaptable TestLAN. However, differences among adaptation methods are more difficult to generalize, as they depend on the particular cases. In many cases, adapting protocol logic when thresholds are in the range 0.2 ≤ Δ ≤ 0.4, the percentage change of the parameters of the system in either direction, reduces flow time significantly, yet these thresholds are not general. The importance of this analysis is that the experiments cover a large space of general conditions, and general design recommendations for protocol adaptation are developed.

A fair resource allocation protocol for multimedia wireless networks

Wireless networks are expected to support real-time interactive multimedia traffic and must be able, therefore, to provide their users with quality-of-service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts and scarcity of bandwidth makes QoS provisioning a challenging task in wireless networks. It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS that they receive from the network. The additional flexibility afforded by the ability of multimedia applications to tolerate and adapt to transient changes in QoS can be exploited by protocol designers to significantly improve the overall performance of wireless systems. This paper presents a fair resource allocation protocol for multimedia wireless networks that uses a combination of bandwidth reservation and bandwidth borrowing to provide network users with QoS in terms of guaranteed bandwidth, call blocking, and call dropping probabilities. Our view of fairness was inspired by the well-known max-min fairness allocation protocol for wireline networks. Simulation results are presented that compare our protocol to similar schemes.

Distributed algorithms with dynamical random transitions

AbstractWe analyze a model of exhaustion of shared resources where allocation and deallocation requests are modeled by dynamical random variables as follows: Let (E, 𝒜, μ, T) be a dynamical system where( E, 𝒜, μ) is a probability space and T is a transformation defined on E. Let d ≥ 1 and f1, … , fd be functions defined on E with values in [0, \documentclass{article}\pagestyle{empty}\begin{document}${1\over d}$\end{document}]. Let (Xi)i≥1 be a sequence of independent random vectors with values in ℤd. Let x ∈ E and (ej)1≤j≤d be the unit coordinate vectors of ℤd. For every i ≥ 1, the law of the random vector Xi is given by We write for the ℤd‐random walk generated by the family (Xi)i≥1. When T is a rotation on the torus then explicit calculations are possible. This stochastic model is a (small) step towards the analysis of distributed algorithms when allocation and deallocation requests are time dependent. It subsumes the models of colliding stacks and of exhaustion of shared memory considered in the literature [14, 15, 11, 16, 17, 20] The technique is applicable to other stochastically modeled resource allocation protocols such as option pricing in financial markets and dam management problems. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 371–396, 2002

TestLAN approach and protocols for the integration of distributed assembly and test networks

In increasing distributed production facilities there is a greater need to coordinate and integrate activities to achieve cost-effective, collaborative performance. As a step in this direction, this research introduces the design approach of TestLAN, a computer-integrated method of testing giving increased throughput and reducing the time spent in the testing phase of assembly via a client/server production configuration. Three types of task protocols--priority assignment protocol, time-out protocol and resource allocation protocol--are discussed, whose purpose is to improve the performance of TestLAN. The advantages of the TestLAN approach and its protocols are quantified and demonstrated through analysis of a wire harness assembly case.

The fault span of crash failures

A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driven to arbitrary global states, where each node is in a state reached in some (possibly different) execution, and each link has an arbitrary mixture of packets sent in (possibly different) executions. Our theorem considerably generalizes an earlier result, due to Fekete et al., which states that there is no correct crashing Data Link Protocol. For example, we prove that there is no correct crashing protocol for token passing and for many other resource allocation protocols such as k -exclusion, and the drinking and dining philosophers problems. We further characterize the reachable states caused by crash failures using reliable non-FIFO and reliable FIFO links. We show that with reliable non-FIFO links any acyclic subset of nodes and links can be driven to arbitrary states. We show that with reliable FIFO links, only nodes can be driven to arbitrary states. Overall, we show a strict hierarchy in terms of the set of states reachable by crash failures in the three link models.

Distributed resource allocation for DS-CDMA-based multimedia ad hoc wireless LANs

Power control in direct sequence code division multiple access (DS-CDMA) systems and power/rate allocation in multirate DS-CDMA based networks is an open and interesting research area which has attracted much attention. However, with a few exceptions, most researchers have emphasized centralized resource allocation algorithms for cellular systems where the base station keeps track of the requirements of the various users and is thus responsible for the management of network resources. Ad hoc wireless local area networks (WLANs), on the other hand, are generally configured as peer-to-peer networks with no centralized hub or controller. Thus resource allocation has to be conducted in a distributed fashion. We address the issue of distributed resource management for multirate DS-CDMA based multimedia WLANs by (1) presenting a distributed resource allocation protocol, known as distributed resource negotiation protocol (DRNP) that builds on the RTS/CTS bandwidth reservation mechanism provided by IEEE 802.111, and provides quality of service (QoS) guarantees through distributed control of resources in DS-CDMA based multimedia WLANs and (2) investigating the performance of various resource allocation schemes within the context of DRNP, in terms of network wide metrics such as overall throughput and blocking rates.

Solving the tridiagonal linear system and Poisson's equation over a LAN-based computing platform using distributed shared memory

Two numerical problems, namely, the tridiagonal linear system (TLS) and Poisson's equation, have been implemented on the Sun network with different methods for interprocess communication. Remote procedure calls have been used under an environment containing two processing elements in solving the TLS, and the results show that the speed improves by a factor of 1.63. The Poisson equation is solved using a distributed shared memory method and although it is clear that this method is useful for distributed applications, its performance is worse than expected unless task scheduling and resource allocation protocols are better controlled.

Computer-aided protocol analysis of writing processes

With increased interest in process analysis of writing has come an expanded role for computers. Records of written and verbal protocols are made by capturing keystrokes and speech, playing them back on videotape, and then coding, second by second, the duration, frequency, and effort of various writing subprocesses as they unfold. In this paper we introduce a new approach to analyzing think-aloud and resource allocation protocols in writing research and describe how analyses of them can add to current models of writing.

Guaranteed bandwidth transport service in multihop networks

This paper deals with the feasibility of a Guaranteed Bandwidth Transport Service (GBTS), usually employed for the handling of isochronous and/or data services with real time requirements, on Multihop Networks (MHNs). A Resource Allocation Protocol (RAP) for the set-up of GB calls is proposed. This protocol allows the low cost requirements of a LAN/MAN node to be satisfied, together with a high flexibility in bandwidth allocation. In the paper a performance study is carried out to verify the response of the MHNs to GB traffic. In particular, the path blocking probability has been evaluated by means of an analytical model in the cases of balanced and unbalanced loads. Moreover, a comparison with the performance of similar LAN/MAN structures, i.e. simple ring and ring with spatial reuse is carried out. Finally, a methodology to manage the resources in order to make the grade of service independent of the physical location of the network nodes is proposed and its impact on the network performance is evaluated.