ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Stability Analysis of Input-buffered Packet Switches with Maximal Size Matching
Cited 0 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
한만수, 김봉태
발행일
200505
출처
IEEE Communications Letters, v.9 no.5, pp.462-464
ISSN
1089-7798
출판사
IEEE
DOI
https://dx.doi.org/10.1109/LCOMM.2005.1431172
초록
We analyze the stability of input-buffered packet switches with virtual output queue (VOQ), maximal size matching (MSM) algorithm and speedup. We first introduce a queueing system for the stability analysis. Using supplementary variables to represent the packet switching mode and remaining packet service time, we describe the behavior of the queueing system. Then, we propose a Lyapunov function to prove speedup of 2 is sufficient to achieve 100 % throughput in input-buffered packet switches with MSM algorithm. © 2005 IEEE.
KSP 제안 키워드
Lyapunov Function, Packet service time, Packet switching, Stability analysis, Switching mode, queueing system