Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur H. Luss
Documents disponibles écrits par cet auteur
Affiner la rechercheA distributed algorithm for equitable bandwidth allocation for content distribution in a tree network / H. Luss in Journal of the operational research society (JORS), Vol. 63 N° 4 (Avril 2012)
[article]
in Journal of the operational research society (JORS) > Vol. 63 N° 4 (Avril 2012) . - pp. 460–469
Titre : A distributed algorithm for equitable bandwidth allocation for content distribution in a tree network Type de document : texte imprimé Auteurs : H. Luss, Auteur Année de publication : 2012 Article en page(s) : pp. 460–469 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Telecommunications Equitable resource allocation Video-on-demand Distributed optimization Index. décimale : 001.424 Résumé : We present a distributed algorithm for bandwidth allocation for content distribution in tree networks, where the intensive computations are executed independently at the nodes while some information is exchanged among the nodes. The root node has a server that stores and broadcasts multiple programs requested at the nodes through links with limited capacity. The bandwidth allocated for a specific program can be decreased from one link to the next in a path from the root node to an end-node, but it cannot be increased. The objective is to determine equitable bandwidth allocations among all programs across all links, which leads to a formulation of a lexicographic maximin optimization model. The performance function at each of the nodes for a specific program represents customers’ satisfaction as a function of the incoming bandwidth into the node. The distributed algorithm that determines the equitable bandwidth allocations extends the algorithm described in Luss (2010). DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n4/abs/jors201153a.html [article] A distributed algorithm for equitable bandwidth allocation for content distribution in a tree network [texte imprimé] / H. Luss, Auteur . - 2012 . - pp. 460–469.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 4 (Avril 2012) . - pp. 460–469
Mots-clés : Telecommunications Equitable resource allocation Video-on-demand Distributed optimization Index. décimale : 001.424 Résumé : We present a distributed algorithm for bandwidth allocation for content distribution in tree networks, where the intensive computations are executed independently at the nodes while some information is exchanged among the nodes. The root node has a server that stores and broadcasts multiple programs requested at the nodes through links with limited capacity. The bandwidth allocated for a specific program can be decreased from one link to the next in a path from the root node to an end-node, but it cannot be increased. The objective is to determine equitable bandwidth allocations among all programs across all links, which leads to a formulation of a lexicographic maximin optimization model. The performance function at each of the nodes for a specific program represents customers’ satisfaction as a function of the incoming bandwidth into the node. The distributed algorithm that determines the equitable bandwidth allocations extends the algorithm described in Luss (2010). DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n4/abs/jors201153a.html