Hiroki Furuya
KDDI
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hiroki Furuya.
optical fiber communication conference | 2007
Masanori Miyazawa; Kenichi Ogaki; Shuntaro Kashihara; Nagao Ogino; Hiroki Furuya; Hajime Nakamura; Tomohiro Otani
A multi-layer NMS was successfully developed to manage the optical network and the MPLS network. The integrated network-planning tool could appropriately provide the optimized routes for a new LSP and all the existing LSPs.
global communications conference | 2006
Hideyuki Koto; Hiroki Furuya; Hajime Nakamura
This paper proposes a combined adaptive congestion control method for massive and intensive telecommunication traffic expected in communication-broadcasting integrated services. The proposed method adaptively controls data transmissions from viewers by combining transmission restriction and delayed transmission depending on the congestion states, so that the severe congestion can be avoided effectively. Furthermore, it utilizes the broadcasting channel which is not only reliable, but also scalable for controlling the responses from vast numbers of viewers. The performance of the proposed method is evaluated through experiments on a test bed where approximately one million viewers are emulated. The obtained results quantitatively demonstrate the performance of the adaptive control method and its effectiveness under massive and intensive traffic conditions.
international telecommunications network strategy and planning symposium | 2006
Hiroki Furuya; Nagao Ogino; Satoshi Konishi; Hajime Nakamura; Takahito Tanabe; Toshihiro Nitta; Makoto Sato
This paper proposes a route computation method for a GMPLS based survivable network. It is classified as a precomputed and centralized approach. It tries to globally optimize both working and recovery routes for each demand while taking account of GMPLS recovery schemes and network resource constraints. To enhance its scalability as well as computational performance, two unique devices are introduced to the method: utilization of a tabu-search algorithm for the weighted constraint satisfaction problem (WCSP) and the limitation of candidate routes. Experimental results demonstrate the possibility that it could handle practical-scale networks with satisfactory performance in both optimality of solution and computational time
Archive | 2001
Hiroyuki Yokoyama; Hajime Nakamura; Toshio Kato; Hiroki Furuya
Archive | 2001
Atsushi Tagami; Teruyuki Hasegawa; Toru Hasegawa; Kouji Nakao; Hiroki Furuya; Hajime Nakamura
IEICE Transactions on Communications | 2003
Hiroki Furuya; Hajime Nakamura; Shinichi Nomoto; Tetsuya Takine
IEICE Transactions on Communications | 2002
Shinichi Nomoto; Hiroki Furuya; Masaki Fukushima; Hajime Nakamura
Archive | 2001
Atsushi Tagami; Teruyuki Hasegawa; Toru Hasegawa; Kouji Nakao; Hiroki Furuya; Hajime Nakamura
IEICE Transactions on Communications | 2009
Hideyuki Koto; Hiroki Furuya; Hajime Nakamura
IEICE Transactions on Communications | 2010
Takeshi Kitahara; Hiroki Furuya; Hajime Nakamura