IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2007-06-29 15:05
A Tight Upper Bound on Online Buffer Management for Two-port Shared-Memory Switches
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP2007-26
Abstract (in Japanese) (See Japanese page) 
(in English) The online buffer management problem formulates the problem of queueing
policies of network switches supporting QoS (Quality of Service) guarant
For this problem, several models are considered.
In this paper, we focus on shared memory switches with preemption.
We prove that the competitive ratio of the Longest Queue Drop ($LQD$) po
licy is $\frac{4M-4}{3M-2}$ in the case of $N=2$, where $N$ is the numbe
r of output ports in a switch and $M$ is the size of the buffer. This ma
tches the lower bound given by Hahne, Kesselman and Mansour. Also, in th
e case of arbitrary $N$, we improve the competitive ratio of $LQD$ from
$2-\frac{1}{N}$ to $2 - \frac{1}{M} \min_{K = 1, 2, ..., N}\{ \lfloor \f
rac{M}{K} \rfloor + K - 1\}$.
Keyword (in Japanese) (See Japanese page) 
(in English) Competitive analysis / Shared memory switches / Buffer management / / / / /  
Reference Info. IEICE Tech. Rep., vol. 107, no. 127, COMP2007-26, pp. 63-70, June 2007.
Paper # COMP2007-26 
Date of Issue 2007-06-22 (COMP) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2007-26

Conference Information
Committee COMP  
Conference Date 2007-06-29 - 2007-06-29 
Place (in Japanese) (See Japanese page) 
Place (in English) Hokkaido University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2007-06-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Tight Upper Bound on Online Buffer Management for Two-port Shared-Memory Switches 
Sub Title (in English)  
Keyword(1) Competitive analysis  
Keyword(2) Shared memory switches  
Keyword(3) Buffer management  
1st Author's Name Koji Kobayashi  
1st Author's Affiliation Kyoto University (Kyoto Univ.)
2nd Author's Name Shuichi Miyazaki  
2nd Author's Affiliation Kyoto University (Kyoto Univ.)
3rd Author's Name Yasuo Okabe  
3rd Author's Affiliation Kyoto University (Kyoto Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Date Time 2007-06-29 15:05:00 
Presentation Time 25 
Registration for COMP 
Paper # IEICE-COMP2007-26 
Volume (vol) IEICE-107 
Number (no) no.127 
Page pp.63-70 
#Pages IEICE-8 
Date of Issue IEICE-COMP-2007-06-22 

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan