DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, J | - |
dc.contributor.author | Jun, CH | - |
dc.date.accessioned | 2015-06-25T01:57:32Z | - |
dc.date.available | 2015-06-25T01:57:32Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 1999-12 | - |
dc.identifier.issn | 0916-8516 | - |
dc.identifier.other | 2015-OAK-0000001087 | en_US |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/10227 | - |
dc.description.abstract | A shared buffer ATM switch loaded with bursty input traffic is modeled by a discrete-time queueing system. Also, the unbalanced and correlated routing traffic patterns are considered. An approximation method to analyze the queueing system under consideration is developed. To overcome the problem regarding the size of state space to be dealt with, the entire switching system is decomposed into several subsystems, and then each subsystem is analyzed in isolation. We first propose an efficient algorithm for superposing all the individual bursty cell arrival processes to the switch. And then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the obtained steady-state probabilities, we can derive some performance measures such as cell loss probability and average delay Numerical examples of the proposed approximation method are given, which are compared with simulation results. | - |
dc.description.statementofresponsibility | open | en_US |
dc.language | English | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION CO | - |
dc.relation.isPartOf | IEICE TRANSACTIONS ON COMMUNICATIONS | - |
dc.rights | BY_NC_ND | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.0/kr | en_US |
dc.title | An approximate analysis of a shared buffer ATM switch using input process aggregation | - |
dc.type | Article | - |
dc.contributor.college | 산업경영공학과 | en_US |
dc.author.google | KIM, J | en_US |
dc.author.google | JUN, CH | en_US |
dc.relation.volume | E82B | en_US |
dc.relation.issue | 12 | en_US |
dc.relation.startpage | 2107 | en_US |
dc.relation.lastpage | 2115 | en_US |
dc.contributor.id | 10070938 | en_US |
dc.relation.journal | IEICE TRANSACTIONS ON COMMUNICATIONS | en_US |
dc.relation.index | SCI급, SCOPUS 등재논문 | en_US |
dc.relation.sci | SCI | en_US |
dc.collections.name | Journal Papers | en_US |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | IEICE TRANSACTIONS ON COMMUNICATIONS, v.E82B, no.12, pp.2107 - 2115 | - |
dc.identifier.wosid | 000084431000026 | - |
dc.date.tcdate | 2018-03-23 | - |
dc.citation.endPage | 2115 | - |
dc.citation.number | 12 | - |
dc.citation.startPage | 2107 | - |
dc.citation.title | IEICE TRANSACTIONS ON COMMUNICATIONS | - |
dc.citation.volume | E82B | - |
dc.contributor.affiliatedAuthor | Jun, CH | - |
dc.identifier.scopusid | 2-s2.0-33746761708 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | ATM switch | - |
dc.subject.keywordAuthor | full sharing scheme | - |
dc.subject.keywordAuthor | input process aggregation | - |
dc.subject.keywordAuthor | maximum entropy method | - |
dc.subject.keywordAuthor | cell loss probability | - |
dc.subject.keywordAuthor | average delay | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.