A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch
- Author
- HUANLIN LIU1 ; YONG CHEN2 ; YONGHE SHI1
[1] Chongqing Univ. of Posts & Teleom College of Telecom and Information Engineering Chongwen Road, Nanan Disdrit Chongqing 400065, China
[2] Chongqing University College of Optoelectrnonic Engineering Main Teaching Building, No. 1314 ShaZheng Street, ShaPingBa District Chongqing, 400044, China - Source
Journal of optical communications. 2008, Vol 29, Num 1, pp 52-55, 4 p ; ref : 13 ref
- CODEN
- JOCODG
- ISSN
- 0173-4911
- Scientific domain
- Electronics; Optics; Telecommunications
- Publisher
- Schiele & Schön, Berlin
- Publication country
- Germany
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme Commutation optique Commutation paquet Débit information File attente Gestion trafic Longueur file Noeud structure Ordonnancement Perte transmission Qualité service Régulation trafic Simulation Système attente Temps retard Transmission donnée Transmission information Télécommunication optique Télétrafic
- Keyword (en)
- Algorithm Optical switching Packet switching Information rate Queue Traffic management Queue length Nodes Scheduling Transmission loss Service quality Traffic control Simulation Queueing system Delay time Data transmission Information transmission Optical telecommunication Teletraffic
- Keyword (es)
- Algoritmo Conmutación óptica Conmutación por paquete Índice información Fila espera Gestión tráfico Longitud hilera Nudo estructura Reglamento Pérdida transmisión Calidad servicio Regulación tráfico Simulación Sistema fila espera Tiempo retardo Transmisión datos Transmisión información Telecomunicación óptica Teletráfico
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B02 Systems, networks and services of telecommunications / 001D04B02B Teletraffic
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B02 Systems, networks and services of telecommunications / 001D04B02E Operation, maintenance, reliability
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B02 Systems, networks and services of telecommunications / 001D04B02F Switching and signalling
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B08 Optical telecommunications
- Discipline
- Telecommunications and information theory
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 20399642
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.1515/JOC.2008.29.1.52 
https://dx.doi.org/10.1515/JOC.2008.29.1.52
"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:24:\"10.1515\/JOC.2008.29.1.52\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Journal of optical communications\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. opt. commun\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"29\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"52\";s:8:\"\u0000*\u0000epage\";s:2:\"55\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0173-4911\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"HUANLIN LIU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:9:\"YONG CHEN\";i:1;s:10:\"YONGHE SHI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JOCODG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:16:\"Schiele & Sch\u00f6n\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"4\";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:24:\"10.1515\/JOC.2008.29.1.52\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Journal of optical communications\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. opt. commun\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"29\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"52\";s:8:\"\u0000*\u0000epage\";s:2:\"55\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0173-4911\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"HUANLIN LIU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:9:\"YONG CHEN\";i:1;s:10:\"YONGHE SHI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JOCODG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:16:\"Schiele & Sch\u00f6n\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"4\";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:24:\"10.1515\/JOC.2008.29.1.52\";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:24:\"10.1515\/JOC.2008.29.1.52\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Journal of optical communications\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. opt. commun\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"29\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"52\";s:8:\"\u0000*\u0000epage\";s:2:\"55\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0173-4911\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"HUANLIN LIU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:9:\"YONG CHEN\";i:1;s:10:\"YONGHE SHI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JOCODG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:16:\"Schiele & Sch\u00f6n\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"4\";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:24:\"10.1515\/JOC.2008.29.1.52\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Journal of optical communications\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. opt. commun\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"29\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"52\";s:8:\"\u0000*\u0000epage\";s:2:\"55\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0173-4911\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"HUANLIN LIU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:9:\"YONG CHEN\";i:1;s:10:\"YONGHE SHI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JOCODG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:16:\"Schiele & Sch\u00f6n\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"4\";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:24:\"10.1515\/JOC.2008.29.1.52\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Journal of optical communications\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. opt. commun\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"29\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"52\";s:8:\"\u0000*\u0000epage\";s:2:\"55\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0173-4911\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"HUANLIN LIU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:9:\"YONG CHEN\";i:1;s:10:\"YONGHE SHI\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JOCODG\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:112:\"A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:16:\"Schiele & Sch\u00f6n\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"4\";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
