A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair
- Author
- YEE, J. R; LIN, F. Y. S
Univ. Hawaii Manoa, dep. electrical eng., Honolulu HI 96822, United States - Source
Networks (New York, NY). 1992, Vol 22, Num 2, pp 185-208 ; ref : 21 ref
- CODEN
- NTWKAA
- ISSN
- 0028-3045
- Scientific domain
- Control theory, operational research
- Publisher
- John Wiley & Sons, New York, NY
- Publication country
- United States
- Document type
- Article
- Language
- English
- Keyword (fr)
- Acheminement Algorithme Réseau ordinateur Transmission paquet Circuit virtuel
- Keyword (en)
- Routing Algorithm Computer network Packet transmission
- Keyword (es)
- Encaminamiento Algoritmo Red ordenador Transmisión paquete
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B03 Teleprocessing networks. Isdn / 001D04B03D Networks and services in france and abroad / 001D04B03D1 Public networks and services (including isdn)
- Discipline
- Telecommunications and information theory
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 5425898
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.1002/net.3230220205 
https://dx.doi.org/10.1002/net.3230220205
"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.1002\/net.3230220205\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Networks (New York, NY)\";s:9:\"\u0000*\u0000stitle\";s:18:\"Networks (N.Y. NY)\";s:7:\"\u0000*\u0000date\";s:4:\"1992\";s:9:\"\u0000*\u0000volume\";s:2:\"22\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"185\";s:8:\"\u0000*\u0000epage\";s:3:\"208\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0028-3045\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"YEE\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"LIN, F. Y. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"NTWKAA\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:17:\"John Wiley & Sons\";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.1002\/net.3230220205\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Networks (New York, NY)\";s:9:\"\u0000*\u0000stitle\";s:18:\"Networks (N.Y. NY)\";s:7:\"\u0000*\u0000date\";s:4:\"1992\";s:9:\"\u0000*\u0000volume\";s:2:\"22\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"185\";s:8:\"\u0000*\u0000epage\";s:3:\"208\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0028-3045\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"YEE\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"LIN, F. Y. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"NTWKAA\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:17:\"John Wiley & Sons\";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.1002\/net.3230220205\";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.1002\/net.3230220205\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Networks (New York, NY)\";s:9:\"\u0000*\u0000stitle\";s:18:\"Networks (N.Y. NY)\";s:7:\"\u0000*\u0000date\";s:4:\"1992\";s:9:\"\u0000*\u0000volume\";s:2:\"22\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"185\";s:8:\"\u0000*\u0000epage\";s:3:\"208\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0028-3045\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"YEE\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"LIN, F. Y. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"NTWKAA\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:17:\"John Wiley & Sons\";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:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1002\/net.3230220205\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Networks (New York, NY)\";s:9:\"\u0000*\u0000stitle\";s:18:\"Networks (N.Y. NY)\";s:7:\"\u0000*\u0000date\";s:4:\"1992\";s:9:\"\u0000*\u0000volume\";s:2:\"22\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"185\";s:8:\"\u0000*\u0000epage\";s:3:\"208\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0028-3045\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"YEE\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"LIN, F. Y. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"NTWKAA\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:17:\"John Wiley & Sons\";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
