A MINIMUM PRINCIPLE/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS
- Author
- MEDITCH JS
UNIV. WASHINGTON DEP. ELECTR. ENG., SEATTLE WA 98195, USA - Source
- COMPUTERS ELECTR. ENGNG; GBR; DA. 1978; VOL. 5; NO 4; PP. 305-310; BIBL. 5 REF.
- Document type
- Article
- Language
- English
- Keyword (fr)
- COMMUTATION MESSAGE ACHEMINEMENT ALGORITHME SYSTEME ATTENTE TRANSMISSION DONNEE RESEAU TRANSMISSION DONNEE INFORMATIQUE MATHEMATIQUES APPLIQUEES
- Keyword (en)
- MESSAGE SWITCHING ROUTING ALGORITHMS QUEUEING SYSTEM DATA TRANSMISSION DATA TRANSMISSION NETWORK COMPUTER SCIENCES APPLIED MATHEMATICS
- Keyword (es)
- INFORMATICA MATEMATICAS APPLICADAS
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- PASCAL8030153173
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
Install on your browser
"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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:9:\"\u0000*\u0000jtitle\";s:0:\"\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"1978\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MEDITCH\";s:10:\"\u0000*\u0000aufirst\";s:2:\"JS\";s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";a:0:{}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:0:\"\";s:8:\"\u0000*\u0000title\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:8:\"\u0000*\u0000place\";s:0:\"\";s:6:\"\u0000*\u0000pub\";s:0:\"\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:9:\"\u0000*\u0000jtitle\";s:0:\"\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"1978\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MEDITCH\";s:10:\"\u0000*\u0000aufirst\";s:2:\"JS\";s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";a:0:{}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:0:\"\";s:8:\"\u0000*\u0000title\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:8:\"\u0000*\u0000place\";s:0:\"\";s:6:\"\u0000*\u0000pub\";s:0:\"\";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:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:9:\"\u0000*\u0000jtitle\";s:0:\"\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"1978\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MEDITCH\";s:10:\"\u0000*\u0000aufirst\";s:2:\"JS\";s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";a:0:{}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:0:\"\";s:8:\"\u0000*\u0000title\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:8:\"\u0000*\u0000place\";s:0:\"\";s:6:\"\u0000*\u0000pub\";s:0:\"\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:9:\"\u0000*\u0000jtitle\";s:0:\"\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"1978\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MEDITCH\";s:10:\"\u0000*\u0000aufirst\";s:2:\"JS\";s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";a:0:{}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:0:\"\";s:8:\"\u0000*\u0000title\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:8:\"\u0000*\u0000place\";s:0:\"\";s:6:\"\u0000*\u0000pub\";s:0:\"\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:9:\"\u0000*\u0000jtitle\";s:0:\"\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"1978\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:0:\"\";s:8:\"\u0000*\u0000epage\";s:0:\"\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MEDITCH\";s:10:\"\u0000*\u0000aufirst\";s:2:\"JS\";s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";a:0:{}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:0:\"\";s:8:\"\u0000*\u0000title\";s:84:\"A MINIMUM PRINCIPLE\/QUEUEING THEORY APPROACH TO ROUTING IN MESSAGE-SWITCHED NETWORKS\";s:8:\"\u0000*\u0000place\";s:0:\"\";s:6:\"\u0000*\u0000pub\";s:0:\"\";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
