Virtual Private Networks (VPNs) are overlay networks established on top of a public network backbone with the goal of providing a service comparable to Private Networks (PNs). The recently proposed VPN hose-model provides customers with flexible and convenient ways to specify their bandwidth requirements. To meet the specified bandwidth requirements, the Network Service Provider (NSP) must reserve sufficient bandwidth on the data transmission paths between each pair of endpoints in a VPN. In addition, the reliability of a VPN depends on the reliability of the data transmission paths. Italiano et al. proposed an algorithm that finds a set of backup paths for a given VPN (VPN tree) under the single-link failure model [1]. When a link failure is detected on a VPN tree, a backup path corresponding to the failed link can be activated to restore the disconnected VPN tree into a new one, thereby ensuring the reliability of the VPN. However, Italiano's algorithm cannot guarantee that the specified bandwidth requirement of the given VPN under the single-link failure model will be met. To address this issue, we propose a new backup path set selection algorithm called BANGUAD in this paper. In addition, the problem of establishing multiple bandwidth-guaranteed hose-model VPNs under the single-link failure model has not been investigated previously. However in this problem, bandwidth-sharing algorithms have the potential to improve the performance of a provisioning algorithm significantly. Therefore, we also propose a bandwidth sharing algorithm and three provisioning algorithms for establishing multiple bandwidth-guaranteed hose-model VPNs under the single-link failure model. Simulations that compare the performance of the proposed algorithms are reported.

Cell assembly is one of explanations of information processing in the brain, in which an information is represented by a firing space pattern of a group of plural neurons. On the other hand, effectiveness of neural network has been confirmed in pattern recognition, system control, signal processing, and so on, since the back propagation learning was proposed. In this study, we propose a new network structure with affordable neurons in the hidden layer of the feedforward neural network. Computer simulated results show that the proposed network exhibits a good performance for the back propagation learning. Furthermore, we confirm the proposed network has a good generalization ability.

Numerous studies have shown that scaling exponents of internet traffic change over time or scaling ranges. In order to analyze long-range dependent traffic with changing scaling exponents over time scales, we propose a multi-scale traffic model that incorporates the notion of a piecewise self-similar process, a process with spectral changes on its scaling behavior. We can obtain a performance curve smoothened over the range of queue length corresponding to time scales with different scaling exponents by adopting multiple self-similar processes piecewise into different spectra of time scale. The analytical method for the multiscale fractional Brownian motion is discussed as a model for this approach. A comparison of the analytical and simulation results, using traffic data obtained from backbone networks, shows that our model provides a good approximation for Gaussian traffic.

The boundary of a distributed denial of service (DDoS) attack, one of the most threatening attacks in a wired network, now extends to wireless mobile networks, following the appearance of a DDoS attack tool targeted at mobile phones. However, the existing defense mechanisms against such attacks in a wired network are not effective in a wireless mobile network, because of differences in their characteristics such as the mobile possibility of attack agents. In this paper, we propose a proactive defense mechanism against IP spoofing traffic for mobile networks. IP spoofing is one of the features of a DDoS attack against which it is most difficult to defend. Among the various mobile networks, we focus on the Network Mobility standard that is being established by the NEMO Working Group in the IETF. Our defense consists of following five processes: speedy detection, filtering of attack packets, identification of attack agents, isolation of attack agents, and notification to neighboring routers. We simulated and analyzed the effects on normal traffic of moving attack agents, and the results of applying our defense to a mobile network. Our simulation results show that our mechanism provides a robust defense.

One of the challenging issues in affective computing is to give a machine the ability to recognize the affective states with intensity of a person. Few studies are directed toward this goal by categorizing affective behavior of the person into a set of discrete categories. But still two problems exist: gesture is not yet a concern as a channel of affective communication in interactive technology, and existing systems only model discrete categories but not affective dimensions, e.g., intensity. Modeling the intensity of emotion has been well addressed in synthetic autonomous agent and virtual environment literature, but there is an evident lack of attention in other important research areas such as affective computing, machine vision, and robotic. In this work, we propose an affective gesture recognition system that can recognize the emotion of a child and the intensity of the emotion states in a scenario of game playing. We used levels of cognitive and non-cognitive appraisal factors to estimate intensity of emotion. System has an intelligent agent (called Mix) that takes these factors into consideration and adapt the game state to create a more positive interactive environment for the child.

This paper proposes an adaptive transmission scheme for MIMO systems to provide different bit error rates and transmission rates for multimedia traffic. The adaptive transmission scheme allocates antennas, rate and power jointly according to the feedback information to satisfy the diverse QoS requirements of the multimedia traffic. Furthermore, an efficient search algorithm with low complexity is proposed for practical implementation. Simulation results show that the proposed scheme improves the spectral efficiency while guaranteeing the QoS requirements of multimedia traffic. Moreover, the proposed search algorithm achieves close optimal performance with great complexity reduction.

We develop a new optical switching fabric with multi-granularity grooming based on our lambda-group model, as well as algorithms that can handle dynamic environments. The proposed fabric based on a new multi-granular grooming scheme presents the distinctive approach of assigning different contiguous groups of granularities to different paths for effective treatment. Results and figures from experiments show that the particular partitioning approach not only is helpful to port reduction significantly, but also improves the SNR of signal and blocking performance for dynamic connection requests.

In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ behavioral specification. Since CafeOBJ is an executable algebraic specification language, not only execution of programs but also semi-automatic verification of programs properties can be done. We first describe an imperative programming language with integer and Boolean types, called IPL. Next we discuss about how to extend IPL, that is, IPL with user-defined types. We give a notion of equivalent programs, which is defined by using the notion of the behavioral equivalence of behavioral specifications. We show a sufficient condition for the equivalence relation of programs, which reduces the task to prove programs to be equivalent.

Combined input-crosspoint buffered (CICB) switches relax arbitration timing and provide high-performance switching for packet switches with high-speed ports. It has been shown that these switches, with one-cell crosspoint buffer and round-robin arbitration at input and output ports, provide 100% throughput under uniform traffic. However, under admissible traffic patterns with nonuniform distributions, only weight-based selection schemes are reported to provide high throughput. This paper proposes a round-robin based arbitration scheme for a CICB packet switch that provides 100% throughput for several admissible traffic patterns, including those with uniform and nonuniform distributions, using one-cell crosspoint buffers and no speedup. The presented scheme uses adaptable-size frames, where the frame size is determined by the traffic load.

The authors have proposed a 1 m2 single-layer slotted waveguide array consisting of conducting baffles and quartz glass strips positioned in front of the slot aperture, which is referred to as a vacuum window, for microwave plasma excitation. The effect of the complicated outer vacuum window hinders the realization of uniform distribution. In this paper, a unit-cell of the alternating-phase fed single-layer slotted waveguide array with the vacuum window is analyzed by generalized scattering matrix method (GSM)-method of moments (MoM) hybridization analysis, and the array is designed to realize uniform aperture electromagnetic field distribution, where the plasma and the chamber is neglected. The GSM-MoM analysis gives reliable numerical results while the MoM has numerical errors due to singularities of Green's function for a long cavity. Uniform aperture EM field distribution outside of the vacuum window is observed in near field measurements using a 1/5 scale model antenna, and the validity of the analysis and design is verified.

Affine projection algorithms perform well for acoustic echo cancellation and adaptive equalization. Although these algorithms typically provide fast convergence, they are unduly complex when updating the weights of the associated adaptive filter. In this paper, we propose a new subband affine projection (SAP) algorithm and a facile method for its implementation. The SAP algorithm is derived by combining the affine projection algorithm and the subband adaptive structure with the maximal decimation. In the proposed SAP algorithm, the derived weight-updating formula for the subband adaptive filter has a simple form as compared with the normalized least mean square (NLMS) algorithm. The algorithm gives improved convergence and reduced computational complexity. The efficiency of the proposed algorithm for a colored input signal is evaluated experimentally.

Recent studies of high quality, high resolution traffic measurements have revealed that network traffic appears to be statistically self similar. Contrary to the common belief, aggregating self-similar traffic streams can actually intensify rather than diminish burstiness. Thus, traffic prediction plays an important role in network management. In this paper, Least Mean Kurtosis (LMK), which uses the negated kurtosis of the error signal as the cost function, is proposed to predict the self similar traffic. Simulation results show that the prediction performance is improved greatly over the Least Mean Square (LMS) algorithm.

Analyzing short-interval-traffic behaviors is important for network performance management to realize high quality multimedia applications. However, it is difficult to measure short-interval-traffic volumes because there are complications in collecting short-interval-traffic data from routers. An example is a heavy load on routers or inaccurate measurement by the short-polling interval; it even demands expensive measurement tools. To resolve these disadvantages, an estimating method of short-interval-traffic distribution (EMSIT) has been proposed. This method estimates short-interval-traffic distributions using MIB (Management Information Base) data, which collects traffic volumes in cycles of several minutes. In this paper, we propose a new estimation method (EMSIT-LD) based on EMSIT, which applies to the case of long-term-traffic dynamics. We evaluate it using computer simulations and actual traffic data.

Supporting Quality of Service (QoS) over the Internet is a very important issue and many mechanism have been already devised or are under way towards achieving this goal. One of the most important approaches is the class-based architecture, which provides a scalable mechanism for QoS support in a TCP/IP network. Class-based service differentiation can be realized without resource reservation, admission control and traffic policing. However, the resulting services are only relative. While it is, in principle, not feasible to provision for absolute guarantees without admission control and/or traffic policing, such a service can be reasonably well emulated using adaptive rate allocation at the link scheduler of routers. In this paper, we propose mechanism for link scheduler of router that achieve emulated absolute and other relative guarantees using dynamic weighted fair queueing (DWFQ) combining with class packet dropping. The weights of DWFQ are frequently adjusted to current load conditions and based on prediction of realistic class traffic. These mechanisms can realize many approaches to QoS guarantees and class-based differentiation.

Immune system protects living body from various attacks by foreign invades. Based on the immune response principles, we propose an improved lateral interaction artificial immune system model in this paper. Considering that the different epitopes on the surface of antigen can be recognized by a set of different paratopes expressed on the surface of immune cells, we build a neighborhood set that consists of immune cells with different affinities to a certain input antigen. We update all the weights of the immune cells located in neighborhood set according to their affinities. Simulations on noisy pattern recognition illustrate that the proposed artificial immune system model has stronger noise tolerance ability and is more effective at recognizing noisy patterns than that of our previous models.

This paper proposes a robust fuzzy integral controller for output regulating a class of affine nonlinear systems subject to a bias reference to the origin. First, a common biased fuzzy model is introduced for a class of continuous/discrete-time affine nonlinear systems, such as dc-dc converters, robotic systems. Then, combining an integrator and parallel distributed compensators, the fuzzy integral regulator achieves an asymptotic regulation. Moreover, when considering disturbances or unstructured certainties, a virtual reference model is presented and provides a robust gain design via LMI techniques. In this case, H∞ performances is guaranteed. Note that the information regarding the operational point and bias terms are not required during the controller implementation. Thus, the controller can be applied to a multi-task regulation. Finally, three numerical simulations show the expected results.

We propose a new receiving method for an information-providing system that uses LED-based traffic lights as the transmitter. We analyzed the improvements obtained when 2-dimentional image sensor replaced the conventional single-element photodiode. First, we discuss the maximum receiver's field of view (FOV) when using the 2-dimentional image sensor at a particular focal length. We analyzed the best vertical inclination for both lanes and quantified the improvements in terms of the enhancement of received signal-noise ratio (SNR) when different numbers of pixels were applied. Our results indicate that using more pixels increases the received SNR and the service area becomes wider compared to the conventional single-element system. Consequently, receivable information within the service area also increased. We also found that the optimum number of pixels to accomplish a reliable communication system is 5050 because performance degradation occured with a larger number of pixels.

In wireless ATM mobile communication environments, an abrupt increase in the number of mobile users in a specific base station (BS) will overload the BS and turn it into a so-called hot-spot cell, which causes an unbalanced traffic load condition if the traffic load in the neighboring BSs is light. In order that efficiently allevates to utilize a limited bandwidth, it is necessary to use a good mobile handoff strategy to alleviate unbalanced traffic load condition. This paper proposes a complete traffic shedding algorithm (CTSA) for soft handoff efficiently to alleviate the overloaded traffic in a hot-spot cell by adjusting handoff parameters, which virtually reduces the service coverage of the heavy loaded BS without adjusting the transmission power. Mobile terminals (MT) located in the outer area of the hot-spot cell will be handed off early to the neighboring BSs with light traffic load; and MTs in the neighboring BSs will not be handed off to the hot-spot cell, so that the traffic load of the hot-spot cell can be decreased. After analyzing the proposed algorithm and comparing the other methods, variable threshold soft handoff (VTSH) and enhanced soft handoff (ESH), by simulation, the performance of CTSA is better than the others. CTSA obviously increases system throughput and decreases soft handoff call dropping ratio, new call blocking ratio, and total call refusing ratio.

In optical burst switching (OBS) networks, the contention of optical bursts is the most serious problem due to the lack of buffers within the networks. Various deflection routing schemes and a routing scheme based on pre-calculated multiple paths have been proposed to resolve the contention. The latter routing scheme can successfully maintain a relatively limited transfer delay of optical bursts. This paper proposes a new decentralized routing scheme based on multiple paths to effectively resolve the contention of optical bursts. In this scheme, each source node splits the traffic load into pre-calculated multiple paths adaptively according to the measured loss rate of the optical bursts transferred through each path. This scheme does not require frequent notification of the measured loss rate because each source node selects one of the multiple paths probabilistically. In the OBS networks, the average transfer delay in the multi-path routing always exceeds that in a single-path routing because alternative paths with a larger transfer delay are also utilized in the multi-path routing. Thus, this paper proposes an adaptive load splitting method in which load splitting ratios for the multiple paths are autonomously adjusted to minimize the average transfer delay based on the condition that the required loss rate of optical bursts is satisfied. The performance of the proposed scheme was evaluated by computer simulation and based on the evaluation results; the ability of the proposed scheme to adjust the load splitting ratios for the multiple paths autonomously and avoid the contention of optical bursts adaptively is clarified even if the traffic load applied to the OBS network changes.

An efficient void filling (VF) algorithm is proposed for wavelength division multiplexing (WDM) optical packet switches (OPSes) handling variable-packet-length self-similar traffic. The computation complexity of the proposed algorithm is extremely low. We further compare the switching performance of the proposed algorithm with that of the conventional one. We demonstrate that the proposed algorithm offers significantly lower computation complexity with adequate performance.