Details of a Researcher - Yamanaka, Naoaki

Papers - Yamanaka, Naoaki

Division display 141 - 160 of about 294 ／ All the affair displays >>

A buffer management mechanism for achieving approximately fair bandwidth allocation in high-speed networks

Miyamura Takashi, Kurimoto Takashi, Nakagawa Kenji, Dhananjaya Prasad, Aoki Michihiro, Yamanaka Naoaki

IEICE Transactions on Communications E85-B ( 8 ) 1434 - 1441 2002.08

Research paper (scientific journal), Joint Work, ISSN 0916-8516

We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving an approximately fair allocation of bandwidth with a small amount of hardware in a high-speed network. The basic process for the allocation of bandwidth uses selective packet dropping that compares the measured input rate of the flow with an estimated fair share of bandwidth. Although V-WFQ is a hardware-efficient FIFO-based algorithm, it achieves almost ideal fairness in bandwidth allocation. V-WFQ can be implemented in the high-speed core routers of today's IP backbone networks to provide various high-quality services. We have investigated V-WFQ's performance in terms of fairness and link utilization through extensive simulation. The results of simulation show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.

Experimental 5-Tb/s Packet-by-Packet Wavelength Switching System Using 2.5-Gb/s x 8-l WDM Links

K. Yamakoshi, N. Matsuura, K. Nakai, E. Oki, N. Yamanaka, T. Ohyama, Y. Akahori

IEICE TRANSACTIONS on Communication Vol.E85-B ( No.7 ) 1293-1301 2002.07

Research paper (conference, symposium, etc.), Joint Work, Accepted

GMPLS-Based Photonic Multilayer Router (Hikari Router) Architecture: An Overview of Traffic Engineering and Signaling Technology

K. Sato, N. Yamanaka, Y. Takigawa, M. Koga, S. Okamoto, K. Shiomoto, E. Oki, W. Imajuku

IEEE Communication Magazine Vol.40 ( No.3 ) 96-101 2002.03

Research paper (conference, symposium, etc.), Joint Work, Accepted

Dynamic deficit roung-robin scheduling scheme for variable-length packets

YAMANAKA NAOAKI K. Yamakoshi, N. Nakai, E. Oki, N. Yamanaka

ELECTRONIC LETTERS Vol.38 ( No.3 ) 2002.01

Research paper (conference, symposium, etc.), Joint Work, Accepted

Packet-by-packet wavelength-routing interconnect technique for 5 Tbit/s switching system

N. Matsuura, K. Yamakoshi, E. Oki, N. Yamanaka , T. Ohyama, Y. Akahori

ELECTRONIC LETTERS Vol.38 ( No.2 ) 82-83 2002.01

Research paper (conference, symposium, etc.), Joint Work, Accepted

Next generation carriers internet backbone node architecture (MSN type-X)

Aoki M., Yamanaka N., Kurimoto T., Miyamura T., Nishikido J.

2002 Workshop on High-performance Switching and Routing, 2002 HPSR 156 - 160 2002

Research paper (international conference proceedings), Joint Work

Next generation carriers Internet backbone node architecture are proposed that offer sophisticated QoS support including real time voice, video streaming, and VPN. The backbone core node, MSN (multi-service network) Type-X, has 320 Gb/s throughput and IP V4/V6 dual stack forwarding capability and OC-192C full wire-rate forwarding performance. In addition, sophisticated DiffServ having 4096 virtual queue realizing full hardware is also proposed. In addition, Type-X has ATM emulation technique. Finally, the paper describes a high-reliability technique such as a newly structured non-stop software and firmware upgrade technique. This newly proposed technique and system offers the next generation, real time, high-QoS capability. © 2002 IEICE.

Access to Document (DOI)

An 80 Gb/s Optical I/O Interface ATM Switch MCM

R. Kawano, N. Yamanaka, E. Oki, K. Okazaki, A. Ohki

Electronics and Communications in Japan, Part 1 Vol.85 ( No.2 ) 61-68 2002

Research paper (conference, symposium, etc.), Joint Work

A heuristic multi-layer optimum topology design scheme based on traffic measurement for IP + photonic networks

Oki Eiji, Shiomoto Kohei, Okamoto Satoru, Imajuku Wataru, Yamanaka Naoaki

Optical Fiber Communication Conference 2022 104 - 105 2002

Research paper (international conference proceedings), Joint Work

On performance prediction of address lookup algorithms of IP routers through simulation and analysis techniques

Kawabe Ryo, Ata Shingo, Murata Masayuki, Uga Masanori, Shiomoto Kohei, Yamanaka Naoaki

2146 - 2151 2002

Many address lookup methods on the IP routers have been recently proposed to improve the packet forwarding capability; nevertheless, their performance prediction is very limited because of lack of considering actual traffic characteristics in their evaluations. It is necessary to consider actual traffic to predict more realistic performances on routers, specially in case of layers 3 and 4 switches whose performances are more influenced by flow characteristic. In this paper, we propose new methods for predicting the router's performance based on the statistical analysis of the Internet traffic. We also present an example of its application to the existing table lookup algorithm, and show that simulation results based on our method can provide accurate performance prediction.

Traffic engineering and signaling technologies in photonic-GMPLS-router networks

Yamanaka N., Okamoto S., Shiomoto K., Oki E., Imajuku W.

142 - 146 2002

This paper describes multilayer traffic engineering and signaling technologies in a photonic-GMPLS-router network. Multilayer traffic engineering, which yields the dynamic cooperation of IP and photonic layers, is described to provide IP services cost-effectively. To realize multilayer traffic engineering, we propose the OSPF extension, which advertises both the number of total wavelengths and the number of unreserved wavelengths, and the RSVP-TE extension, which realizes the least number of wavelength conversions. In addition, this paper presents a heuristic-based multilayer topology design scheme that uses IP traffic measurements in a generalized multiprotocol label switch (GMPLS). Our design scheme yields the optical label switch path (OLSP) network topology, i.e. OLSP placement, that minimizes network cost, in response to fluctuations in IP traffic demand. In other words, the OLSP network topology is dynamically reconfigured to match IP traffic demand. Networks are reconfigured by the proposed scheme so as to utilize the network resources cost-effectively. © 2002 IEICE.

Access to Document (DOI)

Active queue control scheme for achieving approximately fair bandwidth allocation

Miyamura Takashi, Kurimoto Takashi, Nakagawa Kenji, Dhananjaya Prasad, Aoki Michihiro, Yamanaka Naoaki

1269 - 1273 2002

We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the flow with an estimated fair bandwidth share. Though V-WFQ is a hardware-efficient FIFO-based algorithm, it can achieve almost ideal fairness in bandwidth allocation. Simulation results show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.

MSN Type-X

Yamanaka Naoaki, Kurimoto Takashi, Miyamura Takashi, Aoki Michihiko

2095 - 2099 2002

Next generation Internet backbone node architectures are proposed that offer sophisticated QoS support including real time voice, videostreaming, and VPN. The backbone core node, named MSN (Multi-service network) Type-X, has 320 Gb/s throughput and IP V.4/V.6 dual stack forwarding capability. Note that, through the employment of state-of-the art VLSI technology, both V.4 and V.6, OC-192C full wire-rate forwarding performance is achieved for the first time. In addition, sophisticated DiffServ with programmable thousands of virtual queues is also proposed to realize a complete set of hardware. In addition, Type-X uses an ATM emulation technique that can into allow the new packet centric backbone to support conventional services. Finally, the paper describes high-reliability techniques such as newly structured service non-stop software and a firmware upgrade technique. These newly proposed techniques and systems will realize the next generation, real time, high-QoS capability, and VPN IP backbone network to be realized.

5-Tb/S electro-optical ATM switching system hardware components using small optical WDM packet-switched interconnection modules

Matsuura Nobuaki, Yamakoshi Kimihiro, Oki Eiji, Yamanaka Naoaki, Ohyama Takaharu, Akahori Yuji

300 - 304 2002

A 5-Tb/s asynchronous transfer mode (ATM) switching system called OPTIMA-2 (optically interconnected multi-stage ATM switch architecture ) that uses optical packet-by-packet switched wavelength division multiplexing (WDM) links for the intraswitch interconnections was experimentally described. The design, fabrication, and evaluation of the optical WDM interconnection modules for OPTIMA-2 were discussed. The feasibility of a multi Tb/s switching system was successfully demonstrated.

Multi-layer traffic engineering in photonic-GMPLS-router networks

Yamanaka Naoaki, Katayama Masaru, Shiomoto Kohei, Oki Eiji, Matsuura Nobuaki

2731 - 2735 2002

This paper describes multi-layer traffic engineering and signaling technologies in photonic-GMPLS-router networks. Multi-layer traffic engineering, which yields the dynamic cooperation of IP and photonic layers for providing IP services cost-effectively, is described. To realize multi-layer traffic engineering, we propose an OSPF extension that advertises both the number of total wavelengths and the number of unused wavelengths, and an RSVP-TE extension that minimizes the number of wavelength conversions needed. In addition, this paper presents a heuristic-based multi-layer topology design scheme that uses IP traffic measurements in a generalized multi-protocol label switch (GMPLS). Our design scheme yields the optical label switch path (OLSP) network topology, i.e. OLSP placement, that minimizes network cost, in response to fluctuations in IP traffic demand. In other words, the OLSP network topology is dynamically reconfigured to match IP traffic demand. Networks are reconfigured by the proposed scheme so as to utilize the network resources in the most cost-effective manner.

Performance prediction method for IP lookup algorithms

Kawabe R., Ata S., Murata M., Uga M., Shiomoto K., Yamanaka N.

111 - 115 2002

Many address lookup methods for use on IP routers to improve their packet-forwarding capability have been proposed. However, their performance prediction ability is poor because actual traffic characteristics are not considered in their evaluation processes. The actual traffic must be considered in order to predict router performance more accurately, especially for layer 3 and 4 address lookups, whose performances are more affected by the flow characteristics. We describe a method for predicting IP lookup algorithm performance that is based on statistical analysis of the Internet traffic. We present an example of its application to an existing IP lookup algorithm and show, based on simulation results, that our method can provide accurate performance prediction for IP lookup algorithms. © 2002 IEICE.

Access to Document (DOI)

Dynamic deficit round-robin scheduler for 5-Tb/s switch using wavelength routing

Yamakoshi K., Oki E., Yamanaka N.

204 - 208 2002

A dynamic deficit round-robin (DDRR) scheduling scheme for a 5-Tb/s switch is proposed. DDRR is a DRR-based packet scheduler and it can satisfy the max-min fair share. However, DRR cannot satisfy both high throughput and delay requirements. DDRR resolves the problem by changing the granularity for deficit counters according to the packet lengths at queue heads. Simulation results showing the efficiency of DDRR are presented and an implementation of DDRR for the switch is also described. © 2002 IEICE.

Access to Document (DOI)

A disjoint path selection scheme with SRLG in GMPLS networks

Oki E., Matsuura N., Shiomoto K., Yamanaka N.

88 - 92 2002

This paper proposes a disjoint path selection scheme for generalized multiprotocol label switching (GMPLS) networks with shared risk link group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm. In addition, since WSRLG searches for the weight of the SRLG factor by using a binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes so that the cost of a path set can be minimized, it can find the most cost-effective disjoint paths. © 2002 IEICE.

Access to Document (DOI)

A 100-Gb/s Throughput ATM Switch MCM with a 320-Channel Parallel Optical I/O Interface

YAMANAKA NAOAKI R. Kawano, N. Yamanaka, E. Oki, S. Yasukawa, K. Okazaki, A. Ohki, M. Usui, N. Sato, K. Katsura, Y. Ando, T. Kagawa, M. Hikita

IEEE TRANSACTIONS ON ADVANCED PACKAGEING Vol.24 ( No.1 ) 91-98 2001.02

Research paper (conference, symposium, etc.), Joint Work

次世代コアネットワークのメディアゲートウェイおよびコアノード技術

K. Kogure, N. Yamanaka, A Hayakawa

NTT技術ジャーナル ( No.64-68 ) 2001.01

Research paper (bulletin of university, research institution), Joint Work

Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch

Kurimoto T., Oki E., Nakai K., Yamanaka N.

985 - 989 2001

A new scheduling algorithm that concatenates data blocks to increase switching throughput is proposed. The algorithm controls the degree of concatenation and reduces the number of switching instances to improve switch utilization. The switch architecture uses a virtual output queue switching architecture where the core switch fabric is an optical matrix switch. The optical matrix switch requires the guard-time overhead needed for optical switch control. By reducing the number of switching instances, guard-time overhead can be reduced and switch utilization can be improved. Computer simulations show that efficiency is dramatically increased and that fairness in terms of data throughput among output ports is achieved.

　 Previous page - Next page 　