Yasuhiro Miyao

Optimal design and evaluation of survivable WDM transport networks

This paper proposes an optimal design scheme for survivable wavelength-division multiplexing (WDM) transport networks in which fast restoration can be achieved by using predetermined restoration paths that are independent of failure locations and which have one to one correspondence with working paths. Integer programming-based design problems are formulated to optimally determine working and their corresponding restoration paths, the number of fibers in each span, and the number of optical cross connects (OXCs) in each node. In these optimization problems, total facility cost, which includes not only transmission cost but also cross connection, is minimized. This design scheme can handle the dedicated/shared allocation of spare resources and several parameters, such as the maximum available number of wavelengths per fiber /spl Omega/, the matrix size of each OXC, and cross-connection to transmission cost-coefficient ratio /spl gamma/. Total fiber length, the total number of OXCs, etc., are evaluated from obtained design results for these options and parameters. Numerical examples show that the dependency of total fiber length and the total number of OXCs on /spl gamma/ is relatively small, and cross-connection to transmission cost ratios (/spl gamma/ times the total number of OXCs divided by total fiber length) in the dedicated and shared cases are almost the same for each combination of /spl gamma/ and /spl Omega/.

Traffic engineering using multiple multipoint-to-point LSPs

Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. This paper proposes a traffic engineering scheme using multiple multipoint-to-point (m-t-p) label switched paths (LSP) which can reduce the number of LSP and required labels in links. The scheme consists of m-t-p LSP creation and flow assignment. Routes are first selected, and m-t-p LSP are designed to include them. The m-t-p LSP design problem is formulated as a 0-1 integer programming problem. The flow assignment problem is formulated as a mixed integer programming problem in which maximum link load, i.e., maximum congestion, is minimized. Numerical comparisons with the conventional point-to-point LSP approach show that the m-t-p LSP approach can reduce the number of required LSP and labels. Moreover, numerical comparisons with conventional shortest path fast-based flow assignment show that our flow assignment scheme can reduce maximum link load.

A call admission control scheme in ATM networks

In an ATM (asynchronous transfer mode) network, call admission control decides whether or not to accept a new call, so as to ensure the service quality of both individual existing calls and of the new call itself. The measure of service quality used for the call admission control considered here is virtual cell loss probability, PV. PV may be formulated simply from the maximum and the average cell rates alone, and it provides a good estimate of cell loss probability without respect to the burst lengths. PV computational complexity increases rapidly with an increase either in the number of call types, K, or in the number of existing calls of individual call types; and for this reason, the author proposes a method for calculating a PV approximation on the upper side, with the aim of achieving real-time call admission control. Its complexity of computation is a linear order of K. Also proposed is a call admission algorithm which utilizes this approximation method and for which, in some cases, the computational complexity is independent of K.<<ETX>>

Bandwidth allocation in ATM networks that guarantee multiple QOS requirements

Because almost all existing schemes for connection admission control (CAC) in asynchronous transfer mode (ATM) networks ignore variances of quality of service (QOS) being received by individual connection types multiplexed on the same link, as well as differences in QOS required by those connection types, they are in danger of failing to satisfy some individual QOS requirements. A CAC scheme is proposed, based on allocating to each individual connection virtual bandwidths that are predetermined so that QOS for each connection type will be kept within its allowable limit.<<ETX>>

Joint capacity assignment to state-independent working and spare paths for enchanced network survivability

To develop survivable and cost-efficient networks, it is important to consider practical restoration control in network design. We propose a design for joint capacity assignment to state-independent working paths and state-independent spare paths. The assignment is formulated as an integer programming problem. The use of state-independent paths simplifies the restoration process and shortens the restoration time, and our design is especially suitable to pre-planned distributed restoration schemes. We further apply it to a strategy in which all paths are state-dependent, and to one whose spare paths are state-dependent. A numerical comparison of capacity costs, in which our design was applied to specific network examples, shows that costs for a state-independent approach are only slightly higher than those for state-dependent approach.

An Overlay Architecture of Global Inter-Data Center Networking for Fast Content Delivery

Content Delivery Network services, which were originally aimed at achieving fast content delivery, began being used for fast delivery of data stored in cloud services, but they are only effective for frequently accessed data. In this paper, we present an overlay architecture of inter- data center (DC) networking for fast content delivery that is effective for long-tail contents. Based on round-trip time measurements between DCs, content distribution trees (CDTs) are dynamically reconfigured to maximize data transfer throughputs from origin to all other DCs. Furthermore, to enhance throughput by using parallel data transfer on overlay paths (OPs) on a current CDT, a content file are segmented off-line into blocks that are then named at a content server so that each of multiple parallel block-streams can be transferred by an assigned HTTP proxy server at each hop of the OP. Numerical examples obtained by using multiple traceroute servers located in an Asia-Pacific region show that throughput estimates of optimized OPs between some country pair are more than ten times greater than that of direct paths.

Impact of inactivity timer on performance of control plane in LTE core network under burst traffic

This paper proposes a simple EPC queueing model to evaluate the network performance of the control plane in LTE core networks, and to clarify the impact of the parameter for the radio interface, the inactivity timer, on the performance of core networks. The proposed EPC queueing model incorporates the protocol behaviors of state transition in session management, and introduces a parameter, the mixture ratio of batch arrival (MRBA), to represent burst traffic or spike traffic in the input of the queueing model. The network performance is evaluated in terms of loss rate and latency for connection setup. Numerical results show that MRBA substantially affects the performance of a core network. It is also revealed that some values of the inactivity timer locally degrade the performance of a core network depending on the specific conditions of the input traffic.