DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, S | ko |
dc.contributor.author | Hwang, I | ko |
dc.contributor.author | Park, Hong-Shik | ko |
dc.date.accessioned | 2013-03-08T03:15:20Z | - |
dc.date.available | 2013-03-08T03:15:20Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 2 BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3981, pp.1140 - 1148 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/91964 | - |
dc.description.abstract | We propose a new size-based burst classification algorithm which assembles arriving packets with different burst size according to classes. in OBS ingress switches. In JET-based OBS scheme, because the high priority class bursts are likely to occupy channels in advance, the low priority class bursts should find void intervals between high-class bursts to avoid burst blocking. The research results show that there was close relation between blocking rate of low-class bursts and size of its bursts. By limiting the maximum length of lowclass bursts, loss, throughput and assembly delay performances are improved when proposed scheme is compared to conventional scheme. | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | A new size-based burst assembly scheme for OBS switches | - |
dc.type | Article | - |
dc.identifier.wosid | 000237646100121 | - |
dc.identifier.scopusid | 2-s2.0-33745916122 | - |
dc.type.rims | ART | - |
dc.citation.volume | 3981 | - |
dc.citation.beginningpage | 1140 | - |
dc.citation.endingpage | 1148 | - |
dc.citation.publicationname | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 2 BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.contributor.localauthor | Park, Hong-Shik | - |
dc.contributor.nonIdAuthor | Lee, S | - |
dc.contributor.nonIdAuthor | Hwang, I | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.