Temat: bandwidth allocation

Skocz do pozycji: 1.

Tytuł:: Analysis of bandwidth reservation algorithms in HIPERLAN/2
Autorzy:: Woźniak, J.
Janczak, T.
Machan, P.
Neubauer, W.
Tematy:: HIPERLAN/2
MAC
bandwidth allocation
QoS; Pokaż więcej
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Powiązania:: https://bibliotekanauki.pl/articles/308243.pdf Link otwiera się w nowym oknie
Opis:: This paper focuses on performance of channel access methods in the HIPERLAN/2 standard. It discusses commonly used approaches to bandwidth allocation and presents a modified algorithm for effective bandwidth management based on pre-scheduled resource grants. Simulation results show that the new algorithm ensures much higher throughput compared to the standard method.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: Multicommodity Auction Model for Indivisible Network Resource Allocation
Autorzy:: Kołtyś, K.
Pałka, P.
Toczyłowski, E.
Żołtowska, I.
Tematy:: bandwidth allocation
indivisible commodities
modularity
multicommodity trade
pricing; Pokaż więcej
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Powiązania:: https://bibliotekanauki.pl/articles/307940.pdf Link otwiera się w nowym oknie
Opis:: In this paper we present the multicommodity auction model BCBT-I that allocates indivisible network resources among bidders. The approach can be considered as a generalization of the basic multicommodity model for balancing communication bandwidth trade (BCBT). The BCBT model assumes that offers concerning inter-node links and point-to-point bandwidth demands can be realized partially. However, in the real-world trade there might be a need to include capacity modularity in the market balancing process. Thus we state the model for balancing communication bandwidth trade that takes into account the indivisibility of traded bandwidth modules. This requires to solve a mixed integer problem and increases computational complexity. Furthermore, the pricing issue appears nontrivial, as the dual prices cannot be longer used to set fair, competitive market prices. For clearing the market, we examine the multicommodity pricing mechanizm based on differentiation of buy and sell market prices.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Bandwidth Trading: A Comparison of the Combinatorial and Multicommodity Approach
Autorzy:: Kołtyś, K.
Pałka, P.
Toczyłowski, E.
Żółtowska, I.
Tematy:: bandwidth allocation
combinatorial auction
computational efficiency
ndivisible resources
multicommodity trade; Pokaż więcej
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Powiązania:: https://bibliotekanauki.pl/articles/309152.pdf Link otwiera się w nowym oknie
Opis:: Since the telecommunication market becomes more complex and dynamic, a strong need for a new, efficient and flexible bandwidth trading mechanisms appears. We believe that good mechanisms, that allow effective and fair allocation of bandwidth between market participants will help to develop the real competitive bandwidth market. In this paper we compare two different double-sided bandwidth auction mechanisms, that seem to be well suited approaches for trading indivisible units of bandwidth: combinatorial auction c-SeBiDA and multicommodity mechanism BACBR-I. The c-SeBiDA mechanism considers two types of commodities: inter-node links and paths consisting of particular links. Market participants may bid a single link, or a bundle of links, constituting a specific path. The BACBR-I mechanism is a multicommodity exchange model, that allows bidders to place buy offers not only for individual or bundled links, but rather for end-to-end connections. Therefore, it is the decision model that allocates the most efficient links to connections. We run a large set of experiments to test the allocation and computational efficiency obtained under both approaches.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Auction Models Supporting End-to-End Connection Trading
Autorzy:: Kołtyś, K.
Pieńkosz, K.
Toczyłowski, E.
Tematy:: bandwidth allocation
divisible commodities
end-to-end connections
multi-commodity trade
multipath routing; Pokaż więcej
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Powiązania:: https://bibliotekanauki.pl/articles/309215.pdf Link otwiera się w nowym oknie
Opis:: The paper concerns bandwidth allocation problem on the telecommunication market where there are many sellers and buyers. Sellers offer the bandwidth of telecommunication links. Buyers are interested in the purchase of the bandwidth of several links that makes up an end-to-end connection between two nodes of telecommunication network. We analyze three auction models supporting such a bandwidth exchange: NSP (network second price), BCBT (model for balancing communication bandwidth trading) and BCBT-CG which is a modification of BCBT that applies column generation technique. All of these models concern divisible network resources, treat bandwidth of telecommunication links as an elementary commodity offered for sale, and allow for purchasing bandwidth along multiple paths joining two telecommunication nodes. All of them also aim at maximizing the social welfare. Considered auction models have been compared in the respect of economic and computational efficiency. Experimental studies have been performed on several test instances based on the SNDlib library data sets.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: WIMAX network optimization using frame period with channel allocation techniques
Autorzy:: Khan, Mubeen Ahmed
Kumar, Awanit
Bandhu, Kailash Chandra
Tematy:: IEEE 802.16
WiMAX
Bandwidth allocation algorithm
frame period
Round robin algorithm
Strict priority algorithm; Pokaż więcej
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:: https://bibliotekanauki.pl/articles/59115474.pdf Link otwiera się w nowym oknie
Opis:: Internet connectivity in WiMAX networks, along with various applications, is increasing rapidly, so the connectivity of internet and data transfer speed are always challenges for effective data transmission in wireless networks. Several factors affect the performance of networks. One important factor is to choose a suitable frame period for effective data transmissions. The performance of different frame periods with Round Robin and Strict Priority is evaluated in this work. A frame period in Round Robin performs better than a Strict Priority in terms of through-put, but a Strict Priority performs better in terms of drop rates. This paper also demonstrates that an effective frame period, when combined with a proper bandwidth allocation algorithm, yields better results. This work gives the analysis that Round Robin performs 83.8847% better while Strict Priority performs 86.0020% better than the earliest deadline first algorithms for 10 subscriber stations in terms of throughput. This work is helpful to researchers and industrialists for actual implementations in WiMAX networks.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Utility optimization-based bandwidth allocation for elastic and inelastic services in peer-to-peer networks
Autorzy:: Li, Shiyong
Zhang, Yue
Wang, Yan
Sun, Wei
Tematy:: peer-to-peer network
bandwidth allocation
elastic services
inelastic services
utility function
sieć peer-to-peer
alokacja przepustowości
funkcja użyteczności; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Powiązania:: https://bibliotekanauki.pl/articles/330690.pdf Link otwiera się w nowym oknie
Opis:: This paper considers reasonable bandwidth allocation for multiclass services in peer-to-peer (P2P) networks, measures the satisfaction of each peer as a customer by a utility function when acquiring one service, and develops an optimization model for bandwidth allocation with the objective of utility maximization. Elastic services with concave utilities are first considered and the exact expression of optimal bandwidth allocation for each peer is deduced. In order to obtain an optimum in distributed P2P networks, we develop a gradient-based bandwidth allocation scheme and illustrate the performance with numerical examples. Then we investigate bandwidth allocation for inelastic services with sigmoidal utilities, which is a nonconvex optimization problem. In order to solve it, we analyze provider capacity provisioning for bandwidth allocation of inelastic services and modify the update rule for prices that service customers should pay. Numerical examples are finally given to illustrate that the improved scheme can also efficiently converge to the global optimum.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: A Framework for Evaluation of Communication Bandwidth Market Models
Autorzy:: Stańczak, W.
Pałka, P.
Lubacz, J.
Toczyłowski, E.
Tematy:: auctions
bandwidth trading
resource allocation; Pokaż więcej
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Powiązania:: https://bibliotekanauki.pl/articles/309142.pdf Link otwiera się w nowym oknie
Opis:: The article presents a method of analysis of market-based models for resource allocation in communication networks. It consists of several stages: classification of a market model, generation of input data, data adaptation to a tested model, test calculations and, finally, presentation and interpretation of results. A set of general criteria to assess various models has been proposed. Tests are run using dedicated computer applications, data is stored in open XML-based format originated in the multicommodity market model. Network topologies are derived from the SNDlib library.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "bandwidth allocation" wg kryterium: Temat