New Directions for a Japanese Academic Backbone Network

Urushidani, Shigeo; Abe, Shunji; Yamanaka, Kenjiro; Aida, Kô; Yokoyama, Shigetoshi; Yamada, Hiroshi; Nakamura, Motonori; Fukuda, Kensuke; Koibuchi, Michihiro; Yamada, Shigeki

doi:10.1587/transinf.2014nti0001

Cited by 13 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, the volume of traffic in the Internet backbone and the subnetworks underneath the backbone has increased tremendously. It has been reported that the connection bandwidth between the Internet backbone and internet service providers (ISPs) is over 100 Gbps [5]. Hence, to protect the servers under an ISP, the sensor should be able to analyze traffic at speeds of 100 Gbps or higher.…”

Section: Abnormal Traffic Analysis Methodsmentioning

confidence: 99%

Abnormal Traffic Detection Circuit with Real-time Cardinality Counter

Sannomiya

Sato

Yoshida

et al. 2018

Journal of Information Processing

View full text Add to dashboard Cite

To identify abnormal traffic such as P2P flows, DDoS attacks, and Internet worms, this paper discusses a circuit design to realize real-time abnormal traffic detection in broadband networks. Real-time counting of cardinality is the key feature of the circuit. Although our previous study showed that cardinality counting is effective for detecting various types of abnormal traffic, the slowness of DRAM access prevented us from deploying cardinality counting in backbone networks. To address the problem of DRAM access time, this paper proposes a new algorithm for cardinality counting. By changing the order of the cardinality counting process, the proposed algorithm enables parallel accesses of DRAM circuits, which hides the slow DRAM access time through a pipeline circuit. In addition, we propose a new hashing function that also hides the DRAM access problem. It partially replaces scattered addresses with successive addresses, in order to use a faster DRAM burst access. We also report the accuracy of the cardinality counting of the new algorithm, and describe the estimated processing performance based on a pipeline tact level circuit simulation. Our experimental results show that the use of the self-timed pipeline circuit can help realize cardinality counting at rates up to 100 Gbps.

show abstract

Section: Abnormal Traffic Analysis Methodsmentioning

confidence: 99%

Abnormal Traffic Detection Circuit with Real-time Cardinality Counter

Sannomiya

Sato

Yoshida

et al. 2018

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…Equations ( 13) and ( 14) ensure that one upstream access path and one downstream access path are configured for each DC. Equation (15) means that a VL is set up on logical link (v, w) ∈ E V if there is traffic that passes through (v, w). Equations ( 16)-( 18) are used to determine the value of o r pq v , which is used in the calculation of delay at (9).…”

Section: Constraintsmentioning

confidence: 99%

“…This can trigger the improper placement of VRs, which imposes unnecessary 1 For example, the National Institute of Informatics provides a Japanese academic backbone network called the Science Information Network 5 (SINET5) [14]. SINET5 offers various virtual network services, including layer-2 and layer-3 virtual private network services, virtual private local area network service, layer-2 on-demand service, and SDN services [15]. cost on customers.…”

Section: Introductionmentioning

confidence: 99%

Virtualized Network Graph Design and Embedding Model to Minimize Provisioning Cost

Sato

Kurimoto

Urushidani

et al. 2023

IEEE Trans. Netw. Serv. Manage.

Self Cite

View full text Add to dashboard Cite

The provisioning cost of a virtualized network (VN) depends on several factors, including the numbers of virtual routers (VRs) and virtual links (VLs), mapping of them on a substrate infrastructure, and routing of data traffic. An existing model, known as the virtual network embedding (VNE) model, determines the embedding of given VN graphs into the substrate infrastructure. When the resource allocation model of the VNE problem is adopted to a single-entity scenario, where a single entity fulfills the roles of both a service provider and an infrastructure provider, an issue of increased costs of VNs and access paths arise. This paper proposes a model for virtualized network graph design and embedding (VNDE) for the singleentity scenario. The VNDE model determines the number of VRs and a VN graph for each request in conjunction with embedding. The VNDE model also determines access paths that connect customer premises and VRs. We formulate the VNDE model as an integer linear programming (ILP) problem. We develop heuristic algorithms for the cases where the ILP problem cannot be solved in practical time. We evaluate the performance of the VNDE model on several networks, including an actual Japanese academic backbone network. Numerical results show that the proposed model designs suitable VN graphs and embeds them according to the volume of traffic demands and access path cost. Compared with the benchmark model, which is based on a classic VNE approach, the proposed model reduces the provisioning cost at most 28.7% in our examined scenarios.

show abstract

“…Fusion community in Japan was create and has been operated a virtual laboratory system in a secured closed network by using SINET L2/L3 VPN service [21]. SINET5 [22], which will be launched in April 2016, will use dark fibers and wavelength division multiplexing (WDM) technology (Fig. 7).…”

Section: Upgrade Plan Of Sinetmentioning

confidence: 99%