Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2020-10-23 15:40 |
Osaka |
Osaka Univ. (Primary: On-site, Secondary: Online) |
Optimal online packet scheduling for 2-bounded delay buffer management with lookahead Koji M. Kobayashi (UT) COMP2020-15 |
The bounded delay buffer management problem proposed by Kesselman et~al. (STOC 2001 and SIAM Journal on Computing 33(3),... [more] |
COMP2020-15 pp.26-32 |
CQ |
2015-07-06 11:35 |
Nara |
Nara Institute of Science and Technology |
Message Rarity-Based Buffer Management Scheme for Store-Carry-Forward Routing Tomotaka Kimura (TUS), Tetsuya Takine (Osaka Univ.) CQ2015-22 |
In sparsely populated mobile ad-hoc networks, store-carry-forward routing is one of the most important techinques. In or... [more] |
CQ2015-22 pp.13-18 |
COMP |
2014-04-24 15:15 |
Miyagi |
Tohoku University |
Improved Bounds for Online $k$-Frame Throughput Maximization in Network Switches Koji Kobayashi (NII), Jun Kawahara (NAIST), Shuichi Miyazaki (Kyoto Univ.) COMP2014-6 |
We consider a variant of the online buffer management problem in network switches, called the $k$-frame throughput maxim... [more] |
COMP2014-6 pp.37-44 |
DE |
2008-12-01 |
Tokyo |
Gakushuin |
[Poster Presentation]
A Lock-free GCLOCK Page Replacement Algorithm Makoto Yui, Jun Miyazaki (NAIST), Shunsuke Uemura (Nara Sangyo Univ.), Hirokazu Kato (NAIST) DE2008-53 |
We propose a lock-free variant of the GCLOCK page replacement algorithm.
Concurrent access to the buffer management mod... [more] |
DE2008-53 pp.5-6 |
COMP |
2008-09-11 16:40 |
Aichi |
Nagoya Inst. of Tech. |
Improved Competitive Ratios of Online Buffer Management Algorithms for Multi-Queue Switches in QoS Networks Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP2008-33 |
The online buffer management problem formulates the problem of queuing
policies of network switches supporting QoS (Qua... [more] |
COMP2008-33 pp.71-78 |
CS, IN, NS (Joint) |
2008-09-12 09:30 |
Miyagi |
Tohoku University |
Buffer Management Schemes in Sparsely Populated Mobile Ad Hoc Networks Tomotaka Kimura (Osaka Univ), Tetsuya Takine (Osaka Univ/NICT) IN2008-53 |
In sparsely populated mobile ad hoc networks, the conventional routing schmes do not work properly.The store-carry-forwa... [more] |
IN2008-53 pp.57-62 |
NS, IN (Joint) |
2008-03-06 11:10 |
Okinawa |
Bankoku Shinryokan |
An Effective Buffer Management System in a Long-Delayed Network Jun Kubo, Fumitaka Nakamura, Yasushi Wakahara (Tokyo Univ.) NS2007-158 |
CFDP is suitable file transfer protocol for a long-delayed network like the Interplanetary Internet. CFDP does not provi... [more] |
NS2007-158 pp.155-160 |
COMP |
2005-06-24 13:15 |
Toyama |
|
Improving competitive ratios of online buffer management for shared-memory switches Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) |
The buffer management problem is a kind of online problems, which
formulates the problem of queueing policies of networ... [more] |
COMP2005-21 pp.17-22 |
PN, CS, OCS (Joint) |
2005-05-23 13:55 |
Okinawa |
Hotel Moonbeach (Okinawa) |
On providing priority-control and fairness in buffer management for optical packet switches Hiroaki Harai (NICT) |
Previously, we proposed high-throughput buffer management mechanism based on a parallel and pipeline processing architec... [more] |
PN2005-9 pp.11-16 |
NS, IN |
2005-03-03 10:50 |
Okinawa |
Okinawa Zanpa-misaki Royal |
Design, trial production and experimental evaluation of flow based QoS control mechanism Hiroki Shimabara, Hideki Tode, Toshihiro Masaki, Koso Murakami (Osaka Univ.) |
With the rapid increase of the traffic demand in the Internet, it is necessary to provide a priority control mechanism i... [more] |
NS2004-222 IN2004-222 pp.131-134 |