Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  fairness
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Peer-to-peer (P2P) networks offer a cost-effective and easily deployable framework for sharing content. However, P2P file-sharing applications face a fundamental problem of unfairness. Pricing is regarded as an effective way to provide incentives to peers to cooperate. In this paper we propose a pricing scheme to achieve reasonable resource allocation in P2P file-sharing networks, and give an interpretation for the utility maximization problem and its sub-problems from an economic point of view. We also deduce the exact expression of optimal resource allocation for each peer, and confirm it with both simulation and optimization software. In order to realize the optimum in a decentralized architecture, we present a novel price-based algorithm and discuss its stability based on Lyapunov stability theory. Simulation results confirm that the proposed algorithm can attain an optimum within reasonable convergence times.
EN
The issue of energy-aware traffic engineering has become prominent in telecommunications industry in the last years. This paper presents a two-criteria network optimization problem, in which routing and bandwidth allocation are determined jointly, so as to minimize the amount of energy consumed by a telecommunication infrastructure and to satisfy given demands represented by a traffic matrix. A scalarization of the criteria is proposed and the choice of model parameters is discussed in detail. The model of power dissipation as a function of carried traffic in a typical software router is introduced. Then the problem is expressed in a form suitable for the mixed integer quadratic programming (MIQP) solver. The paper is concluded with a set of small, illustrative computational examples. Computed solutions are implemented in a testbed to validate the accuracy of energy consumption models and the correctness of the proposed traffic engineering algorithm.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.