Routing into two parallel links : Game-theoretic distributed algorithms
- Author
- ALTMAN, Eitan1 ; BASAR, Tamer2 ; JIMENEZ, Tania3 ; SHIMKIN, Nahum4
[1] INRIA, B. P. 93, 06902 Sophia Antipolis, France
[2] Coordinated Science Laboratory, University of Illinois, 1308 West Main Street, Urbana, Illinois 61801-2307, United States
[3] C.E.S.I.M.O, Universidad de los Andes, Merida, Venezuela
[4] Electrical Engineering Department, Technion, Haifa 32000, Israel - Issue title
- Special Issue on Routing in Computer and Communication Networks
- Author (monograph)
- OLARIU, Stephan (Editor)1 ; WU, Jie (Editor)2
[1] Department of Computer Science, Old Dominion University, Norfolk, Virginia 23529-0162, United States
[2] Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, Florida 33431-0991, United States - Source
Journal of parallel and distributed computing (Print). 2001, Vol 61, Num 9, pp 1367-1381 ; ref : 21 ref
- ISSN
- 0743-7315
- Scientific domain
- Computer science; Mathematics
- Publisher
- Elsevier, San Diego, CA
- Publication country
- United States
- Document type
- Article
- Language
- English
- Keyword (fr)
- Acheminement Algorithme glouton Algorithme parallèle Algorithme réparti Equilibre Nash Fonction coût Fonction utilité Jeu non coopératif Jeu somme non nulle Routage Réglage Théorie jeu Utilisateur
- Keyword (en)
- Routing Greedy algorithm Parallel algorithm Distributed algorithm Nash equilibrium Cost function Utility function Non cooperative game Non zero sum game Routing Adjustment Game theory User
- Keyword (es)
- Encaminamiento Algoritmo glotón Algoritmo paralelo Algoritmo repartido Equilibrio Nash Función coste Función utilidad Juego no cooperativo Juego suma no nula Reglaje Teoría juego Usuario
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A07 Game theory
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B03 Teleprocessing networks. Isdn
- Discipline
- Operational research. Management Telecommunications and information theory
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1124364
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1006/jpdc.2001.1754 
https://dx.doi.org/10.1006/jpdc.2001.1754
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jpdc.2001.1754\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"61\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1367\";s:8:\"\u0000*\u0000epage\";s:4:\"1381\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALTMAN\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Eitan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"BASAR, Tamer\";i:1;s:14:\"JIMENEZ, Tania\";i:2;s:14:\"SHIMKIN, Nahum\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:63:\"Special Issue on Routing in Computer and Communication Networks\";s:8:\"\u0000*\u0000title\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jpdc.2001.1754\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"61\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1367\";s:8:\"\u0000*\u0000epage\";s:4:\"1381\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALTMAN\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Eitan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"BASAR, Tamer\";i:1;s:14:\"JIMENEZ, Tania\";i:2;s:14:\"SHIMKIN, Nahum\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:63:\"Special Issue on Routing in Computer and Communication Networks\";s:8:\"\u0000*\u0000title\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jpdc.2001.1754\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jpdc.2001.1754\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"61\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1367\";s:8:\"\u0000*\u0000epage\";s:4:\"1381\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALTMAN\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Eitan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"BASAR, Tamer\";i:1;s:14:\"JIMENEZ, Tania\";i:2;s:14:\"SHIMKIN, Nahum\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:63:\"Special Issue on Routing in Computer and Communication Networks\";s:8:\"\u0000*\u0000title\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jpdc.2001.1754\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"61\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1367\";s:8:\"\u0000*\u0000epage\";s:4:\"1381\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALTMAN\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Eitan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"BASAR, Tamer\";i:1;s:14:\"JIMENEZ, Tania\";i:2;s:14:\"SHIMKIN, Nahum\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:63:\"Special Issue on Routing in Computer and Communication Networks\";s:8:\"\u0000*\u0000title\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jpdc.2001.1754\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"61\";s:8:\"\u0000*\u0000issue\";s:1:\"9\";s:8:\"\u0000*\u0000spage\";s:4:\"1367\";s:8:\"\u0000*\u0000epage\";s:4:\"1381\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"ALTMAN\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Eitan\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"BASAR, Tamer\";i:1;s:14:\"JIMENEZ, Tania\";i:2;s:14:\"SHIMKIN, Nahum\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:63:\"Special Issue on Routing in Computer and Communication Networks\";s:8:\"\u0000*\u0000title\";s:71:\"Routing into two parallel links : Game-theoretic distributed algorithms\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
