| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IN, NS (Joint) |
2023-03-02 13:50 |
Okinawa | Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Proposal and evaluation of improving unfairness between QUIC flows in wireless LAN Yoshiki Osuga, Ken'ichi Kawanishi (Gunma Univ)  NS2022-186 |
Multiple QUIC flows in wireless LAN cause remarkable throughput unfairness between uplink and downlink flows. For this p... [more] | NS2022-186 pp.113-118 |
| CS, CAS | 2020-02-27 14:30 |
Kumamoto | An Estimation of Network Traffic Validation based on Sparse Coding Takayuki Nakachi, Yitu Wang (NTT) CAS2019-107 CS2019-107 |
With accurate network traffic prediction, future communication networks can realize self-management and enjoy intelligen... [more] | CAS2019-107 CS2019-107 pp.55-60 |
|
| CQ | 2018-07-20 13:25 |
Miyagi | Tohoku Univ. | A Study of Queue Length Control in TCP/AQM Networks Considering Buffer Capacity Ryosuke Hotchi, Ryogo Kubo (Keio Univ.) CQ2018-39 |
In the modern world where many devices all around the world communicate with each other, the total amount of the communi... [more] | CQ2018-39 pp.45-50 |
| NS | 2018-01-18 13:50 |
Okinawa | Ishigakishi-Shoko-Kaikan | A Study on AQM for Micro-burst in Data Center Wataru Morita, Daisuke Sugahara, Kouji Hirata, Miki Yamamoto (Kansai Univ.) NS2017-145 |
Short-term burst traffic in data center network, called microburst, is one of the most important technical problems for ... [more] | NS2017-145 pp.7-12 |
| CQ | 2015-09-02 13:20 |
Kyoto | Kyoto Institute of Technology | Experimental analysis on performance anomaly at download data transfer in IEEE802.11n wireless LAN Yoshiki Hashimoto, Masataka Nomoto, Celimuge Wu, Satoshi Ohzahata, Toshihiko Kato (UEC) CQ2015-65 |
It is reported that, even in IEEE 802.11n WLAN, the performance anomaly occurs which reduces the throughput of all stati... [more] | CQ2015-65 pp.149-154 |
| NS | 2014-01-24 11:15 |
Okinawa | Univ. of the Ryukyus | Queue Management Scheme Based on Priority Level of SIP Methods in SIP server Tadasuke Nozoe, Kousuke Watanabe, Masahiko Noguchi, Kazuaki Misawa, Mikio Isawa (NTT) NS2013-175 |
Servers in a SIP network such as IMS receive a great number of SIP messages when it comes to emergency situations. Serve... [more] | NS2013-175 pp.71-76 |
| NS, IN (Joint) |
2012-03-08 10:30 |
Miyazaki | Miyazaki Seagia | Performance Analysis of Call Centers with Interactive Voice Response and Redial Customers: An Approach by Retrial Queues Kosuke Hashizume, Phung Duc Tuan, Shoji Kasahara, Yutaka Takahashi (Kyoto Univ.) NS2011-198 |
Recently, call centers are important from a customer service point of view because they have a significant impact on cus... [more] | NS2011-198 pp.107-112 |
| CQ, CS (Joint) |
2011-04-21 13:05 |
Kagoshima | Yakushima Environmental Culture Village Center | Estimation of the Average Service Time and the Maximum Number of Sessions based on the Periodical Observation of VOD Traffic Hirotada Honda, Daisuke Ikegami, Toshiaki Tsuchiya (NTT) CQ2011-5 |
The efficient network design of video flow is one of the most important issues for the network career, since it requires... [more] | CQ2011-5 pp.23-28 |
| RCS, AN, MoNA, SR (Joint) |
2010-03-05 17:20 |
Kanagawa | YRP | Optimal Admission Control in Cognitive Radio Networks with Sensing Errors Chung-Wei Wang (Nat Chiao-Tung Univ/Tohoku Univ.), Li-Chun Wang (Nat Chiao-Tung Univ.), Fumiyuki Adachi (Tohoku Univ.) RCS2009-341 |
This paper investigates the admission control problem for the secondary users in cognitive radio (CR) networks. Specific... [more] | RCS2009-341 pp.491-496 |
| NS | 2010-01-29 15:05 |
Fukuoka | Fukuoka Institute of System LSI Design Industry (Fukuoka) | A Packet Discarding Scheme without Probabilistic Packet Drop Atsuro Fujii, Hiroshi Inai (Okayam Prefectural Univ.) NS2009-161 |
In order to avoide congestion in the network, a packet discarding scheme called RED(Random EarlyDetection) has been prop... [more] | NS2009-161 pp.113-118 |
| IN | 2009-02-05 14:50 |
Kagawa | Kagawa University | Performance Comparison of Packet Discarding Schemes in a Router Atsuro Fujii, Hiroshi Inai (Okayama Prefectural Univ) IN2008-124 |
In order to avoid congestionin a router, there exist a lot of methods is to regulate the router queue length by discardi... [more] | IN2008-124 pp.13-18 |
| 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 11:00 |
Miyagi | Tohoku University | Performance Analysis of Peer-to-Peer Real-Time Communication Networks Using Time-Dependent Peer-Population Process
-- An Approach by an Infinite Server Queue with a Nonstationary Poisson Process -- Kazuhiko Kuraya, Hiroyuki Masuyama, Shoji Kasahara, Yutaka Takahashi (Kyoto Univ.) NS2008-57 |
Skype is a Peer-to-Peer (P2P) based Internet telephony service. In the Skype network, super nodes are chosen from among ... [more] | NS2008-57 pp.87-92 |
| CS, CQ (Joint) |
2008-04-24 15:20 |
Aomori | Hirosaki University | Hit Count Based Active Queue Management Algorithm for Achieving Approximately Fair Bandwidth Allocation Naing Ye Thu, Kenji Nakagawa (Nagaoka Univ. of Tech.) CS2008-2 |
In this paper, a new active queue management scheme is presented to ahieve approximately fair allocation of bandwidth wi... [more] | CS2008-2 pp.7-12 |
| NS, IN (Joint) |
2008-03-06 08:40 |
Okinawa | Bankoku Shinryokan | Handover management scheme based on estimation of AP queue length in VoWLANs Eigo Horiuchi, Shigeru Kashihara (NAIST), Kazuya Tsukamoto (KIT), Youki Kadobayashi, Suguru Yamaguchi (NAIST) IN2007-171 |
In ubiquitous WLANs, Mobile Nodes (MNs) are likely to execute handovers between WLANs with different IP subnets during V... [more] | IN2007-171 pp.73-78 |
| NS, ICM, CQ (Joint) |
2007-11-15 17:40 |
Fukuoka | Institute of System LSI Design Industry, Fukuoka | A queueing network approach to design of email service system Keiichi Kawaji, Takashi Okuda, Tetsuo Ideguchi, Xuejun Tian (Aichi Prefectural Univ.) NS2007-97 |
Spam email is the massive amounts of unwanted email messages sent randomly for advertising purposes and soliciting acros... [more] | NS2007-97 pp.17-21 |
| NS, IN (Joint) |
2007-03-09 08:00 |
Okinawa | Okinawa Convention Center | SwRED: A Robust Active Queue Management Scheme based on Load Level Prediction Wei LIU, Shigeaki Tagashira, Satoshi Fujita (Hiroshima Univ,) IN2006-225 |
Abstract : Active queue management (AQM) is a novel technique to realize a smooth congestion control in communication ne... [more] | IN2006-225 pp.267-272 |
| IN, PN (Joint) |
2006-10-12 11:20 |
Tokyo | Network Sort Engine Based on Concurrent Heap
-- Toward Implementing Massive and Ultra High Speed Per-flow Queuing -- Muneyoshi Suzuki, Katsuya Minami (NTT) IN2006-77 |
Network Sort Engine (NSE) that rapidly identifies the highest priority from numerous priorities is indispensable to enab... [more] | IN2006-77 pp.1-6 |
|
| CS | 2006-01-17 13:00 |
Oita | Yufugo-kan (Oita) | Performance Analysis of SVC in the Next Generation Communication Networks with Finite Capacity Wuyi Yue (Konan Univ.), Shunfu Jin, Zhanqiang Huo (Yanshan Univ.) |
In this paper, we present a performance analysis for SVC (Switched Virtual Channel) system in the next generation commun... [more] | CS2005-85 pp.77-82 |
| IN | 2005-12-15 13:25 |
Hiroshima | Hiroshima City Univ. | Evaluation of Robustness of Soft State for Data Management in Distributed Environment Toru Yamaguchi, Harumasa Tada, Makoto Imase (Osaka Univ.) |
Soft state is widely used as the technique for the maintenance of state and is known to have robustness against the fail... [more] | IN2005-111 pp.7-12 |
[Return to Top Page]