Auction-Based Resource Reservation in 2.5/3G Networks

Dramitinos, Manos; Stamoulis, George D.; Courcoubetis, Costas

doi:10.1023/b:mone.0000042495.27538.af

Cited by 26 publications

(30 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, users demand sessions spanning partly overlapping intervals with different durations, which in general are much larger than the time scale t a of the network frames in which resources are allocated. The approach that we introduced in [1] is to conduct a sequence of auctions, each concerning reservation of bits within one UTRAN frame. Each auction is a sealed-bid Generalized Vickrey Auction (GVA), with bids of the type (p, q), where q is the quantity of units (bits) sought in the present frame and p is the price proposed for each such unit.…”

Section: The Auction Mechanismmentioning

confidence: 99%

“…GPRS) networks. Indeed, in [1], we study the problem of resource reservation in UMTS networks in which users request services other than telephony that last for long time intervals. Each of these sessions has a fixed target QoS level, which for simplicity we assume that corresponds to a certain bitrate.…”

Section: Introductionmentioning

confidence: 99%

“…The duration of network time-slots over which resource units are allocated is much shorter. We define in [1] an auction-based mechanism achieving nearly consistent reservation of the resources of a UMTS network by the users that This research was partly supported by EU-IST-2003-507607 B-BONE and IST-NoE EuroNGI. The authors wish to thank B-BONE and EuroNGI partners for useful discussions on the subject of this paper.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, our resource reservation mechanism serves a soft CAC. The mechanism is based on a series of Generalized Vickrey Auctions and a set of predefined user utility functions that we introduce [1]. Bidding is performed automatically on behalf of the users on the basis of each user's selection of one of these utility functions and his declaration of a total willingness to pay, and is dependent of the user's history of resource allocation.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation

Dramitinos

Stamoulis

Courcoubetis

2006

Performability Has Its Price

Self Cite

View full text Add to dashboard Cite

Abstract. We consider users bidding in a series of multi-unit sealed-bid auctions, aiming at reserving the same amount of units of the resource auctioned, e.g. transmission slots in a wireless network. Each user attains from each successful allocation of resource units an instant marginal utility that depends on his history of resource allocation. The user's bid at each auction equals this marginal utility. We introduce a random walk model for transient analysis of this series of auctions, we study the properties of the resulting user resource allocation patterns and we provide a numerical and experimental evaluation of this model.

show abstract

Section: The Auction Mechanismmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation

Dramitinos

Stamoulis

Courcoubetis

2006

Performability Has Its Price

Self Cite

View full text Add to dashboard Cite

show abstract

“…We address these two issues by designing an auction-based resource allocation framework. Auction theory [13] has recently been introduced to several areas of wireless communications (e.g., time slot allocation [14], power control [15], and cognitive radio networking [16]). To the best of our knowledge, this paper is the first work that applies auction theory in designing resource allocation schemes for cooperative communications.…”

Section: Introductionmentioning

confidence: 99%

Auction-Based Resource Allocation for Cooperative Communications

Huang

Han

Chiang

et al. 2008

IEEE J. Select. Areas Commun.

253

196

View full text Add to dashboard Cite

Abstract-Distributed and efficient resource allocation is critical for fully realizing the benefits of cooperative communications in large scale communication networks. This paper proposes two auction mechanisms, the SNR auction and the power auction, that determine relay selection and relay power allocation in a distributed fashion. A single-relay network is considered first, and the existence and uniqueness of the Nash Equilibrium (i.e., the auction's outcome) are proved. It is shown that the power auction achieves the efficient allocation by maximizing the total rate increase, and the SNR auction is flexible in trading off fairness and efficiency. For both auctions, the distributed best response bid updates globally converge to the unique Nash Equilibrium in a completely asynchronous manner. The analysis is then generalized to networks with multiple relays, and the existence of the Nash Equilibrium is shown under appropriate conditions. Simulation results verify the effectiveness and robustness of the proposed algorithms.

show abstract

Beyond distributions and primary goods: Assessing applications of rawls in information science and technology literature since 1990

Hoffmann

2016

Asso for Info Science & Tech

View full text Add to dashboard Cite

This article reviews the ways in which the work and ideas of political philosopher John Rawls have been appropriated or applied by scholars of information science, technology, and related areas since 1990. The article begins with an overview of Rawls's work, paying particular attention to its foundations and methods. Subsequently, a 2‐phase discussion of the literature is presented. The first phase reviews engagements with Rawls from more than 150 scholarly articles from databases and journals dedicated to information and technology ethics, information/technology studies, philosophy of technology, and technology and human values. The second phase focuses on scholars who have demonstrated a significant commitment to Rawlsian theory in these areas. Overall, the review demonstrates that most significant applications of Rawls are oriented toward unequal distributions of informational goods exacerbated by advanced information and communication technologies (ICTs). Critically, however, scholars in this area have overlooked the relevance of Rawls's foundations for the sorts of complex networked relationships afforded by those same advanced ICTs. Rather than representing a fatal gap, it opens up a new avenue for the renewed consideration of Rawls—his ideas on the basic structure of society and the importance of self‐respect are offered as 2 possible paths forward.

show abstract

Auction-Based Resource Reservation in 2.5/3G Networks

Cited by 26 publications

References 8 publications

A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation

A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation

Auction-Based Resource Allocation for Cooperative Communications

Beyond distributions and primary goods: Assessing applications of rawls in information science and technology literature since 1990

Contact Info

Product

Resources

About