Masayuki Murata

Performance of alternate routing methods in all-optical switching networks

We study routing methods in all-optical switching networks. In all-optical switching networks, the connection with more hops encounters more call blocking, and it is especially true in optical networks with no wavelength conversions. We therefore consider an alternate routing method with limited trunk reservation in which connections with more hops are prepared more alternate routes. Through developing an approximate analytic approach, we show that our method keeps good performance when compared with the existing alternate routing methods, and also that the fairness among connections can be improved. Further performance improvement is investigated by introducing a wavelength assignment policy and a dynamic routing method. An effectiveness of the proposed method is investigated through simulation.

Rate-based congestion control for ATM networks

Congestion control plays an important role in the effective and stable operation of ATM networks. This paper first gives a historical overview of rate-based congestion control algorithms developed in the ATM Forum, showing how the current ATM Forum standard regarding the traffic management control methods is exploited, by these algorithm. Then, analytical approach is used to quantitatively evaluate their performance and show the effectiveness of the rate-based approach. In presenting the numerical examples, we emphasize that appropriate control parameter settings are essential for proper traffic management in an ATM network environment.

Challenging issues in visual sensor networks

Wireless sensor networks are an important research area that has attracted considerable attention. Most of this attention, however, has been concentrated on WSNs that collect scalar data such as temperature and vibration. Scalar data can be insufficient for many applications such as automated surveillance and traffic monitoring. In contrast, camera sensors collect visual data, which are rich in information and hence offer tremendous potential when used in WSNs. However, they raise new challenges such as the transmission of visual data with high computational and bandwidth requirements in mainly low-power visual sensor networks. In this article we highlight the challenges and opportunities of VSNs. We discuss major research issues of VSNs, specifically camera coverage optimization, network architecture, and low-power visual data processing and communication, and identify enabling approaches in this area.

Analysis of interdeparture processes for bursty traffic in ATM networks

Admission control in asynchronous transfer mode (ATM) networks is considered. An ATM switch is modeled as a discrete-time single-server queue at which the following three different kinds of arrival processes are allowed to join together: arrivals of cells with a general interarrival time distribution; Bernoulli arrivals of cells in batches; and interrupted Poisson processes. An exact analysis is given to derive the waiting-time distributions and interdeparture-time distributions for arriving cells subject to admission control in ATM networks. The model is extended to approximately obtain the end-to-end delay distributions for the designated traffic stream. Such an analysis is important for voice or coded video because they require a playout mechanism at the destination. Since the analysis is approximate, the simulation results needed to assess its accuracy are provided. Numerical examples show how the traffic characteristics of the designated traffic stream are affected by the total traffic load at the switching node, the number of other bursty traffic sources, and the degree of burstiness of the traffic source itself. >

Effect of speedup in nonblocking packet switch

The nonblocking packet switch under consideration has N inputs and N outputs and operates L times as fast as the input and output trunks. The effect of speedup (L) on packet loss probability and average transmission delay in the case of an arbitrary number L, such that 1<or=L<or=N, in two types of nonblocking packet switches is analyzed. One has buffers only at outputs. The maximum throughput is obtained on the assumption of an infinite number of buffers in the latter type, that is, 0.8845 and 0.9755 when L=2 and L=3, respectively. Some simulation results are also provided in the case in which a finite number of buffers are given at each input.<<ETX>>

Versatile optical code-based MPLS for circuit, burst, and packet switchings

We will present versatile optical code (OC)-based photonic MPLS, so-called OC-MPLS which ranges from circuit switching, burst switching, to packet switching. OC-label is an identifier attached to the data, of which information is mapped onto an optical code, a sequence of optical pulses. The OC-label recognition is performed by the optical correlation between an incoming OC-label and the OC-label entries. Unique to the OC-label processing is that it is analog operation entirely in optical domain, and no optical logic operation is involved, therefore, the processing speed is only limited by the propagation delay in the optical correlator, which is a passive optical device. This is a key to the ultrahigh-speed processing capability. Circuit switching of OC-label switched path (OC-LSP) is characterized by the finer data granularity than the wavelength path of GMPS, resulting in a better bandwidth efficiency. In a one-way reservation protocol of photonic burst switching, the OC-labeled control packet improves the throughput by nearly cutting the offset time between the control packet and the following data burst. OC-labeled header of the packet can enables the ultrafast routing in photonic packet switching. To exploit the ultrafast routing capability, a new packet switch architecture is investigated, in which the longest-prefix match algorithm as well as WDM buffering into the fiber delay lines are introduced.

Biologically inspired self-adaptive multi-path routing in overlay networks

Using randomness to find optimal solutions in selecting network paths.

QoS Mapping between User’s Preference and Bandwidth Control for Video Transport

In this paper, we present a method of QoS mapping between user’s preference on video quality and a required bandwidth to transport the video across the network. We first investigate the mapping method from QoS parameters to the required bandwidth on the network. For this purpose, we assume that the underlying network supports some bandwidth allocation mechanism, such as DBR service class in ATM, RSVP, IPv6 and so on. Then, for given QoS parameters in terms of spatial, SNR, and timely resolutions, the required bandwidth to support the MPEG-2 video transmission is determined by analyzing the traced MPEG-2 streams. We next consider the mapping method between QoS parameters and the user’s perceived video quality, which is quantified by MOS (Mean Opinion Score) evaluation. Based on the above results, we discuss a systematic method to estimate the required bandwidth to guarantee user’s preference on video quality.

CATT: potential based routing with content caching for ICN

Information Centric Networking (ICN) has shown possibilities to solve several problems of the Internet. At the same time, some problems need to be tackled in order to advance this promising architecture. In this paper we address two of the problems, namely routing and content caching. For the routing, we introduce the Potential Based Routing (PBR) to achieve several design goals such as availability, adaptability, diversity, and robustness. In addition, we examine the performance of a random caching policy which can be a promising candidate for ICN. The integrated system of both PBR and a caching policy is named the Cache Aware Target idenTification (CATT). Simulation results demonstrate that PBR with replications located on less than 1% of total nodes can achieve a near optimal routing performance (close to the shortest path routing) even though a request message is randomly forwarded.

Performance analysis of wavelength assignment policies in all-optical networks with limited-range wavelength conversion

Previous analytic approaches for all-optical networks have only allowed a random wavelength assignment policy in spite of the fact that network performance can be improved by other wavelength assignment policies such as first-fit wavelength assignment. We develop an approximate analytic method to allow flexible wavelength assignment policies by virtue of a layered-graph approach. Our analysis is also applicable to the networks that wavelength conversion is limitedly provided. By comparing with simulation results, we show that our analytic approach has good accuracies when the number of wavelengths is not large. We also show that our analysis is applicable to general network topologies.