Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shunji Abe

dblp:81/2689 · DBLP profile ↗
← Back
12ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 11 · 1 first-authorSoftware engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Network management and operations · 60% Software-defined and programmable networks · 18% Internet architecture and protocols · 8%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network management and operations
network configuration
0.112009
Design of versatile academic infrastructure for multilayer network services · IEEE J. Sel. Areas Commun. 2009
Cellular and mobile networks
call admission control
0.011994
A traffic control method for service quality assurance in an ATM network · IEEE J. Sel. Areas Commun. 1994
Internet architecture and protocols › traffic management
traffic control
0.011994
A traffic control method for service quality assurance in an ATM network · IEEE J. Sel. Areas Commun. 1994
Network performance modeling
traffic modeling
0.011994
A traffic control method for service quality assurance in an ATM network · IEEE J. Sel. Areas Commun. 1994
Network performance modeling
loss systems
0.011984
Traffic Analysis of Delayed Delivery Services Considering the Correlation Between Circuit Switching and Message Switching · IEEE Trans. Commun. 1984
Network performance modeling
queueing analysis
0.011984
Traffic Analysis of Delayed Delivery Services Considering the Correlation Between Circuit Switching and Message Switching · IEEE Trans. Commun. 1984
Routing and switching
circuit switching
0.011984
Traffic Analysis of Delayed Delivery Services Considering the Correlation Between Circuit Switching and Message Switching · IEEE Trans. Commun. 1984

Methods — techniques the papers use, named apart from their topics

network design · 0.1configuration validation · 0.1poisson distribution · 0.0gaussian distribution · 0.0state transition probability · 0.0markov chain analysis · 0.0
YearPublicationVenuePosition
2017 SINET5: A low-latency and high-bandwidth backbone network for SDN/NFV Era
abstract
SINET5 is a new 100-Gbps-based academic backbone network, which started full-scale operations in April 2016. It uses multi-protocol label switching-transport profile (MPLS-TP) systems and reconfigurable optical add-drop multiplexers (ROADMs) to create a nationwide network and has more than 50 backbone IP routers to provide a wide range of services, such as several virtual private network (VPN) services. It provides end-to-end data communications up to 100 Gbps throughput, minimized-latency, and software-defined networking (SDN)-friendly functions to researchers in every Japanese prefecture. SINET5 is also a platform for dynamic inter-cloud connections and network functions visualization (NFV) services. This paper brief review of the network architecture, and describes new featured services, SDN-oriented layer-2 on-demand VPN services, and NFV functions. Field test results for SINET5 performance are also reported.
Takashi Kurimoto, Shigeo Urushidani, Kenjiro Yamanaka, Motonori Nakamura, Shunji Abe, Kensuke Fukuda, Michihiro Koibuchi, Hiroki Takakura, Shigeki Yamada, Yusheng Ji
ICC6
2016 Estimating available bandwidth in mobile networks by correlation coefficient
abstract
In recent years, as mobile devices increase, the demands for measuring the available bandwidth in a wireless network increase more and more to provide high quality network services. The available bandwidth is one of the most important parameters to determine the sending rate in WAN optimization. Pathload [2] is a technique to measure the available bandwidth by detecting the point where the receiving rate becomes lower than the sending rate of test packets. However, Pathload misdetects this point in mobile networks with packet losses caused by fading, interference, and so on. So, we propose a method to measure the available bandwidth by using correlation coefficients between the sending rate and packet loss rate, and then evaluate the accuracy of the proposed method.
Yosuke Takano, Ryoichi Mutoh, Naoki Oguchi, Shunji Abe
APNOMS4
2014 Performance Evaluation of Reconfigurable TCP Communication on Wi-Fi Network Using GE Channel Model
abstract
Recently, many commercial cloud-computing services have rapidly evolved to process and back up large volumes of data. With wireless broadband networks also gaining popularity, users increasingly access cloud services using mobile devices and wearable devices for interactive communication, such as remote desktops and augmented reality (AR) applications. In many cases, interactive applications use the TCP protocol between a server and a mobile device. However, end-to-end TCP sessions are easily influenced by packet losses in wireless networks and long delays on international lines, which may degrade communication quality. To cope with these problems, we propose a dynamic TCP communication method that improves the response for interactive communication by dynamically changing congestion control algorithms in accordance with changes in network quality and application characteristics. In this paper, we implement the proposed method on the NS-3 network simulator and evaluate it by using the GE (Gilbert-Eliott) channel model, assuming that the method is applied to a Wi-Fi network. We find that our method improves response time for interactive communication with a remote desktop to the level where users will not feel uncomfortable.
Naoki Oguchi, Shunji Abe
COMPSAC2
2013 PopCache: Cache more or less based on content popularity for information-centric networking
abstract
Due to a mismatch between downloading and caching content, the network may not gain significant benefit from the sophisticated in-network caching of information-centric networking (ICN) architectures by using a basic caching mechanism. This paper aims to seek an effective caching decision policy to improve the content dissemination in ICN. We propose PopCache-a caching decision policy with respect to the content popularity-that allows an individual ICN router to cache content more or less in accordance with the popularity characteristic of the content. We propose an analytical model to evaluate the performance of different caching decision policies in terms of the server-hit rate and expected round-trip time. The analysis confirmed by simulation results shows that PopCache yields the lowest expected round-trip time compared with three benchmark caching decision policies, i.e., the always, fixed probability and path-capacity-based probability, and PopCache provides the server-hit rate comparable to the lowest ones.
Kalika Suksomboon, Saran Tarnoi, Yusheng Ji, Michihiro Koibuchi, Kensuke Fukuda, Shunji Abe, Motonori Nakamura, Michihiro Aoki, Shigeo Urushidani, Shigeki Yamada
LCN6
2009 Implementation and Evaluation of Layer-1 Bandwidth-on-Demand Capabilities in SINET3
abstract
This paper describes the implementation and evaluation of layer-1 bandwidth-on-demand (BoD) capabilities in the Japanese academic backbone network, called SINET3. The network has a nationwide GMPLS-based layer-1 platform and provides reservation-based and signaling-based BoD services. The overall architecture for providing BoD services including its capabilities, user interface, path calculation, and interface to drive the layer-1 platform are described. Actual examples of BoD services and evaluations of the path setup/release time in the network are also presented.
Shigeo Urushidani, Kensuke Fukuda, Yusheng Ji, Michihiro Koibuchi, Shunji Abe, Motonori Nakamura, Shigeki Yamada, Kaori Shimizu, Rie Hayashi, Ichiro Inoue, Kohei Shiomoto
ICC5
2009 Design of versatile academic infrastructure for multilayer network services
abstract
This paper describes the network design and configurations of the new Japanese academic infrastructure, called SINET3, which provides a rich variety of network services to more than 700 universities and research institutions. Since the start of full-scale operations in June 2007, the network has expanded its services to include multi-layer transfer services (IP, Ethernet, and layer-1), enriched virtual private network services (L3VPN, L2VPN, VPLS, and L1VPN), enhanced QoS services (packet-based and circuit-based), and brand-new layer-1 bandwidth-on-demand (BoD) services. This paper explains how the network provides these various network services on a single network platform by effectively configuring leading-edge networking components, such as high-performance IP routers, layer- 1 switches, and a BoD server. Evaluations of the network design and configurations confirmed that the networking functions were effectively coordinated. The procedures and techniques related to the configuration validation that covered all phases of the network design and construction are also presented.
Shigeo Urushidani, Shunji Abe, Yusheng Ji, Kensuke Fukuda, Michihiro Koibuchi, Motonori Nakamura, Shigeki Yamada, Kaori Shimizu, Rie Hayashi, Ichiro Inoue, Kohei Shiomoto
IEEE J. Sel. Areas Commun.2
2008 Detecting and Tracing Traffic Volume Anomalies in SINET3 Backbone Network
abstract
Traffic volume anomalies refer to apparent abrupt changes in time series of traffic volume, which can be propagate through the network. Detecting and tracing anomalies is a critical and difficult task for network operators. In this paper, we first propose a traffic decomposition method, which decomposes the traffic into three components: trend component, autoregressive (AR) component, and noise component. A traffic volume anomaly is detected when the AR component is out of prediction band for multiple links simultaneously. Then, the anomaly is traced using the projection of the detection result matrices for the observed links which are selected by a shortest-path-first algorithm. Finally we validate our detection and tracing method by using traffic data of the third-generation Science Information Network (SINET3) and show the detected and traced results.
Shunji Abe, Yusheng Ji, Seisho Sato, Makio Ishiguro
ICC2
2007 Layer-1 Bandwidth on Demand Services in SINET3
abstract
This paper describes brand-new layer-1 bandwidth on demand (BoD) services implemented in the new Japanese academic backbone network, called SINET3. SINET3 is an advanced converged network that provides multi-layer transfer, enriched VPN, enhanced QoS, and layer-1 BoD services. The layer-1 BoD services are dynamic layer-1 resource allocation services directly triggered by users and artfully achieved on the multi-service platform by using a layer-1 BoD server. This paper first explains how the network accommodates a wide variety of network services by effectively combining leading-edge technologies. The paper next describes the overall mechanism for the dynamic layer-1 path setup on the multi-service platform and details the functions of the BoD server in many aspects. The designs focus on the tangible achievement of these services over a nationwide network composed of 75 layer-1 switches and 12 IP/MPLS routers.
Shigeo Urushidani, Jun Matsukata, Kensuke Fukuda, Shunji Abe, Yusheng Ji, Michihiro Koibuchi, Shigeki Yamada, Kaori Shimizu, Tomonori Takeda, Ichiro Inoue, Kohei Shiomoto
GLOBECOM4
2007 A Heuristic DDoS Flooding Attack Detection Mechanism Analyses based on the Relationship between Input and Output Traffic Volumes
abstract
Nowadays various kinds of anomalies are prohibiting the widely used Internet from offering normal services. Within them a novel anomaly is caused by bandwidth attacks. To defense these threats many detecting schemes are essentially based on unidirectional checking of traffic changes. When legitimately abrupt changes appear, they might result in false alarms. In this paper we consider the problem from the bidirectional-traffic view and analyze the traffic characteristics by checking the input/output traffic characteristics of the protected network node. We have analyzed the relationship between input and output traffic volume pairs in the simulation traffic and studied them both under normal and abnormal cases. Based on these analyses, we've proposed a heuristic DDoS flooding attack detection method and showed a verifying simulation as well.
Fengxiang Zhang, Shunji Abe
ICCCN2
2006 Burst Assembly Method with Traffic Shaping for the Optical Burst Switching Network
abstract
Optical burst switching (OBS) is a promising switching technology for the next optical transport network. In this paper, we analyze the assembled traffic of the science information network (SINET) by using the fractional Brownian motion (FBM) model. The analytical results show that the general timer-based assembly scheme can not avoid increasing the burstiness (variance in short timescales), which will deteriorate the network performance. Therefore, a novel burst assembly method with traffic shaping function named advanced timer- based is introduced to reduce the burstiness of assembled traffic, in which the traffic rate is smoothed by restricting the burst length to a threshold when bursts are sent out periodically. The simulation results show that the advanced timer-based assembly algorithm is better than existing assembly algorithms in terms of burst loss ratio.
Shunji Abe
GLOBECOM2
1994 A traffic control method for service quality assurance in an ATM network
abstract
The authors describe an ATM traffic control method to avoid both long-term and short-term congestion. Call admission control and policing based on user-specified traffic parameters have mainly been studied as ways to avoid long-term congestion. However, these control methods are not practical since it is difficult for users to specify accurate values of traffic parameters that include the effects of cell collision controllers and multiplexers in the customer premises network. In order to solve the problem, they propose an intelligent call admission control method. This method consists of a function to determine user's traffic parameters by monitoring the cell traffic flow of each service and a function to statistically predict long-term congestion by using Gaussian and Poisson distributions. They show that congestion can be predicted by deriving the peak, average, and variation. They also describe how to derive traffic parameters and determine their values. To avoid short-term congestion, we propose reactive control, which drops cells with lower cell loss priority when congestion occurs, and we show the buffer construction and buffer control algorithm used to achieve this. Computer simulations prove that their control strategy is effective for cell toss sensitive services such as VBR (variable bit rate) video service.>
Shunji Abe, Toshio Soumiya
IEEE J. Sel. Areas Commun.1
1984 Traffic Analysis of Delayed Delivery Services Considering the Correlation Between Circuit Switching and Message Switching
abstract
To improve the ratio of successful calls, a new switching system permitting callers to store messages when the called party is busy or does not answer can be constructed by adding a message storing function to the conventional circuit switching system. The mutual traffic influences exerted by this combination of circuit and message switching systems have not yet been clarified. This paper considers a two-stage loss system traffic model consisting of a circuit switching system that has a message switching system connected to it. The traffic characteristics of this model are analyzed using the nonindependent state transition probability, which depends upon the interacting states of the circuit and message switching system. A method of solving the state equations by determining the state transition probabilities of the message switching system from the state probabilities of the circuit switching system is proposed. Using this method, the mutual traffic influence of the circuit and message switching systems is evaluated.
Shimmi Hattori, Tsuneo Katsuyama, Shunji Abe
IEEE Trans. Commun.3