This review paper addresses an emerging aspect of the relationship between optics and microwave electronics: the application of short pulses of laser light to the sensing and measurement of continuous-wave microwave fields. In particular, very short duration optical pulses can take on the role of ultrafast sampling gates within the framework of the electro-optic sampling technique in order to realize unprecedented temporal resolution, measurement bandwidth, and probing flexibility. As a result, in numerous instances electro-optic sampling has been demonstrated, primarily within the research laboratory, to be an effective tool in the field of diagnostic testing and the determination of the electrical characteristics of microwave components. Recently, with the emergence of new applications such as microwave electric-field mapping in wireless and radar environments, and as the ultrafast time domain has gained in importance for the area of optical telecommunications, added attention has been directed to electro-optic sampling. Herein, an abbreviated historical perspective of the history of electro-optic field mapping is presented, along with the fundamental concepts that are utilized in the technique. The effectiveness of an optical-fiber-mounted electro-optic probe in a scanning electric-field-mapping system is highlighted in several diagnostic measurements on microwave and millimeter-wave antenna arrays, and a combined electric-field and thermal-imaging capability is also introduced.

Many fuzzy traffic controllers adjust the extension time of the green phase with the fuzzy input variables, arrival and queue. However, in our experiments, we found that the two input variables are not sufficient for an intersection where traffic flow rates change and thus, in this paper, traffic volume is used as an additional variable. Traffic volume is defined as the number of vehicles entering an intersection every second. In designing a fuzzy traffic controller, an ad-hoc approach is usually used to find membership functions and fuzzy control rules showing good performance. That is, initial ones are generated by human operators and modified many times based on the results of simulation. To partially overcome the limitations of the ad-hoc approach, we use genetic algorithms to automatically determine the membership functions for terms of each fuzzy variable when fuzzy control rules are given by hand. The experimental results indicate that a fuzzy logic controller with volume variable outperforms conventional ones with no volume variable in terms of the average delay and the average velocity. Also, the controller shows better performance when membership functions generated by a genetic algorithms instead of ones generated by hand are used.

We have designed and fabricated air-bridged modulators with bandwidths exceeding 10 GHz, the highest yet realised to date for InGaAsP/InGaAsP multiple-quantum-well (MQW) asymmetric Fabry-Perot modulators (AFPMs). Microwave modulation, measurements of intermodulation between the photodetected downlink and modulated uplink signals, and bi-directional broadband data over fibre transmission experiments have been performed to verify the potential of the AFPM as a single electrical/optical transceiver. We also report the first direct integration of this AFPM with a microstrip patch antenna and present results of a preliminary microwave signal transmission experiment over a distance of 1.4 m in free-space at 5.2 GHz with the integrated AFPM as a photodetector.

In this paper, we first investigate the characteristics of movie contents over the Internet. As in the previous studies, we found the lognormal-distribution well fits the distribution of file size for the whole set of general movie contents. When we specifically focus on the subset that consists of movie trailers, however, it shows different distribution from the lognormal-distribution. Our analysis shows it is similar to an exponential-distribution. We here assume that movie trailers are one of the relevant contents for Contents Delivery Networks (CDN) or Peer-to-Peer (P2P) file exchange communities. We further studies the relationship between playing duration and file size for the movie trailers and we did not find any linear correlation among them. We next consider bandwidth requirements to retrieve movie trailer contents. Our objective is to make it possible for user to view the contents in real-time. Many previous studies investigate bandwidth requirement based only on the file size distribution. In this paper, we analyze the traffic design criteria for CDN or P2P by taking into account both of the results for the file size distribution and the relationship between playing duration and file size for movie trailers. Simulation studies reveal the impact for the bandwidth requirement.

In this paper, we propose a modified CP-AFC (Cross-Product Automatic Frequency Control) algorithm to enhance coherent signal detection for WCDMA reverse link receiver. We introduce a moving average filter at the FDD input to decrease the noise effect by increasing the number of cross-products, since pilot symbol in WCDMA is not transmitted continuously. We also add normalization algorithm to overcome the conventional CP-FDD's sensitivity to the variance of input signal amplitude and to increase the linear range of S-curve. For rapid frequency acquisition and tracking, we adopt a multi-stage tracking mode. We applied the proposed algorithm in the implementation of WCDMA base station modem successfully.

Real traffic flows are captured in various network environments and their statistical properties are analyzed. Based on real traffic flows, MWM (Multifractal Wavelet Model) and Poisson equivalent synthetic traffic flows are generated. Performance analysis of a SB (Synchronous Bulk) packet switch is joined with different types of traffic. Maximum throughput performance of the SB packet switch for various real traffic flows and appropriate MWM and Poisson equivalent synthetic traffic flows are evaluated by using discrete-event simulations. Different flow persistence, SF (Stretch Factor) and scheduling mechanisms are used in order to asses their influence on SB packet switch performance. Traffic asymmetry, either input or output based, has a major influence on SB packet switch performance. By increasing the level of asymmetry, maximum throughput values decrease considerably, especially if the ROT (Rotation) scheduling mechanism is applied. Traffic asymmetry also decreases the influence of the SF parameter on maximum switch throughput. As a general rule of thumb, SF values of no more then 5 must be used if asymmetrical traffic is switched. It is also advisable that OPF (Oldest Packet First) scheduling mechanism is used in such cases. The influence of burstiness and scaling of traffic flows turns out to be relatively insignificant for the SB packet switch maximum throughput results, if the OPF scheduling mechanism is used. Larger throughput discrepancies are detected, if ROT scheduling is used.

In this paper we study traffic engineering in Multiprotocol Label Switching (MPLS) networks. We consider off-line computation of disjoint working and restoration paths where path rerouting is used as the restoration scheme. We first compute maximum number of paths for each demand such that paths satisfy diversity requirements. Using the generated path set we study four different approaches for selecting working and restoration paths, and formulate each method as an Integer Linear Programming (ILP) problem. The first two methods treat working and restoration path design problems separately. We propose two new path design methods that jointly optimize the working and restoration paths. A traffic uncertainty model is developed in order to evaluate performances of these four approaches based on their robustness with respect to changing traffic patterns. We compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network. It is shown through simulations that the weighted load balancing method proposed in this paper outperforms the other three methods in handling traffic demand uncertainty.

End-to-end delay and loss measurement is an efficient way for a host to examine the network performance. Unnoticed clock errors that influence the accuracy of the timestamp may result in fatal system errors. In this paper, we discuss the characteristics and defects of the existing clock distortion adjustment algorithms. Those algorithms are not applicable to process a long-term delay trace, which contains periodical NTP clock adjustment. Therefore, we propose a relatively robust algorithm to resolve the problem. The algorithm employs window function to partition the long-term trace into short segments, improves the precision of the estimation of the time and amount of NTP clock adjustment To evaluate the performance of our proposed algorithm, we practice it in adjusting the clock distortion of the real delay traces collected from Internet. The results indicate that our proposed algorithm has excellent effect on the removal of the clock distortion from the long-term delay traces.

In recent computer systems, a large portion of energy is consumed by on-chip cache accesses and data movement between cache and off-chip main memory. Reducing these memory system energy is indispensable for future microprocessors because power and thermal issues certainly become a key factor of limiting processor performance. In this paper, we discuss and evaluate how our architecture called SCIMA contributes to energy saving. SCIMA integrates software-controllable memory (SCM) into processor chip. SCIMA can save total memory system energy by using SCM under the support of compiler. The evaluation results reveal that SCIMA can reduce 5-50% of memory system energy and still faster than conventional cache based architecture.

The differentiated services (DiffServ) architecture is proposed to provide a service differentiation between traffic classes or behavior aggregates in a scalable manner. A key functional element to deploy DiffServ is traffic conditioning, more specifically traffic marker. This paper proposes an adaptive and aggregated traffic marker embodying the functions: (1) inter-connect two-rate three color markers (trTCMs), (2) estimate the aggregate rate of Assured Forwarding (AF) classes, and (3) re-mark the some parts of excessive portion of assigned link-rate per AF class queue with some down-grading probability to lower AF class. Both analysis and simulations are used to evaluate the performance of the proposed aggregate-traffic marker. The analysis of the proposed marker shows its clear service differentiation among behavior aggregates (BAs) under different traffic load conditions. Also a performance evaluation is performed through network simulation with more realistic traffics as unbalanced intensities among different BAs. Shortly, our proposed aggregate-traffic marker enables to keep the priority orders in terms of loss rate and delay/jitter among BAs in spites of varying and unbalanced traffic intensities.

As use of the Internet continues to spread rapidly, Traffic Engineering (TE) is needed to optimize IP network resource utilization. In particular, load balancing with TE can prevent traffic concentration on a single path between ingress and egress routers. To apply TE, we have constructed an MPLS (Multi-Protocol Label Switching) network with TE capability in the JGN (Japan Gigabit Network), and evaluated dynamic load balancing behavior in it from the viewpoint of control stability. We confirmed that with this method, setting appropriate control parameter values enables traffic to be equally distributed over two or more routes in an actual large-scale network. In addition, we verified the method's effectiveness by using a digital cinema application as input traffic.

An adaptive congestion control scheme that can be applied to various random access protocols in mobile communication systems is proposed. Its main features are scalability for handling increasing numbers of mobile terminals and adaptability for coping with drastic changes in traffic load. These are achieved by controlling the traffic load adaptively to maintain maximum throughput even under overload conditions. Procedure for measuring and estimating offered traffic and a method of setting control thresholds that maximize the average throughput are analytically derived, and the algorithm for adaptively controlling the permission rate is described. This scheme was applied to both the slotted ALOHA and ICMA/CD protocols. For each protocol, three control parameters--the unsuccessful rate, optimal traffic, and control thresholds--were analytically derived. Then stationary throughput characteristics were numerically evaluated. We found that the scheme could achieve high throughput by regulating transmission adaptively depending on the offered traffic. The preferred range of the permission base rate that enables adaptive control and limits the amount of processing at terminals was also clarified. Since one of the main advantages of our scheme is its adaptability to drastic variations in traffic load, we simulated its transient characteristics with three types of time-variant input models. The results indicate that this control scheme achieved nearly theoretically optimal throughput even during an overload for each input model.

A key problem under imperfect power control in multimedia DS-CDMA networks is how to guarantee the differentiated outage probabilities of different traffic classes resulted from the uncertainty of received powers. In addition, in order to utilize the scarce wireless resource efficiently, as many users as possible should be admitted into the network while providing guaranteed quality-of-service support for them. In this work, a call admission control scheme, Differentiated Outage Probabilities CAC or DOP-CAC, is proposed to achieve the above goals for imperfectly power-controlled multimedia CDMA networks. Two important features of CDMA systems are considered in our scheme: one is the power multiplexing among bursty traffics and the other is the power allocation scheme employed at the physical layer. The validity and efficiency of DOP-CAC are verified by numerical examples. Two power allocation schemes, Limited Optimal Power Allocation (LOPA) proposed in [3] and Quasi-Optimal Power Allocation (QOPA) we proposed in [6], are considered respectively and compared in the performance evaluation of DOP-CAC. The results show that DOP-CAC achieves much better resource utilization under QOPA than it does under LOPA. By employing QOPA at the physical layer and DOP-CAC at the link layer, our work suggests a high efficiency solution for QoS support of multimedia traffic under imperfect power control environment.

Randomly addressed polling was proposed as a multiple access control protocol for wireless local area networks (LANs). However, the protocol has difficulties in supporting real-time services such as voice transmission. We propose a reservation scheme and make it possible to support real-time services. The scheme is described in detail. Efficiency and average access delay are analyzed.

In this paper, we propose a medium access control (MAC) protocol for multimedia code division multiple access (CDMA) communications. In the proposed protocol, a base station (BS) estimates the instantaneous number of simultaneously transmitted packets in the future slots with exploiting a stochastic property of traffic. In order to carry out this estimation, we employ an adaptive algorithm. We evaluate the performance of the proposed protocol by comparing that with two different cases. One is no estimation case and the other is perfect estimation case. From these results, we clarify the advantage of the proposed MAC protocol.

Distributed Denial of Service (DDoS) attacks are a pressing problem on the Internet as demonstrated by recent attacks on major e-commerce servers and ISPs. Since the attack is highly distributed, an effective solution must be formulated with a distributed approach. Recently, some solutions, in which intermediate network nodes filter or shape congested traffic, have been proposed. These solutions may decrease the congested traffic, but they still cause "collateral victims problem," that is, legitimate packets may be discarded mistakenly. In this paper, we propose Active Countermeasure Platform to minimize traffic congestion and to address the collateral victim problem using the Active Networks paradigm, which incorporates programmability into intermediate network nodes. Our platform can prevent overloading of the target and consuming the network bandwidth of both the backbone and the protected site autonomously. In addition, it can improve the collateral victim problem based on user policy. This paper shows the concept of our platform, system design and evaluation of the effectiveness using a prototype.

As demonstrated by many studies, measured wide-area network traffic exhibits fractal properties, such as self-similarity, burstiness, and long-range dependence (LRD). In order to describe long-range dependent network traffic and to emphasize the performance aspects of descriptive traffic models with additive and multiplicative structures, the multifractal wavelet model (MWM), which is based on the binomial cascade, has been shown to match the behavior of network traffic over small and large time scales. In this paper, using appropriate mathematical and statistical analyses, we develop the MWM proposed in [14], which provides a complete description of long-range dependent network traffic. First, we present accurate parameters of the MWM over different time scales. Next, a marginal stable distribution of MWM network traffic data is analyzed. The accuracy of the proposed MWM compared to actual data measurements is confirmed by queuing behavior performance through computer simulations.

Among ITS applications, it is very important to acquire detailed statistics of traffic flows. For that purpose, vision sensors have an advantage because of their rich information compared to such spot sensors such as loop detectors or supersonic wave sensors. However, for many years, vehicle tracking in traffic images has suffered from the problems of occlusion effect and illumination effect. In order to resolve occlusion problems, we have been proposing the Spatio-Temporal Markov Random Field model(S-T MRF) for segmentation of Spatio-Temporal images. This S-T MRF model optimizes the segmentation boundaries of occluded vehicles and their motion vectors simultaneously by referring to textures and segment labeling correlations along the temporal axis as well as the spatial axis. Consequently, S-T MRF has been proven to be successful for vehicle tracking even against severe occlusions found in low-angle traffic images with complicated motions, such at highway junctions. In addition, in this paper, we define a method for obtaining illumination-invariant images by estimating MRF energy among neighbor pixel intensities. These illumination-invariant images are very stable even when sudden variations in illumination or shading effect are occurred in the original images. We then succeeded in seamlessly integrating the method for MRF energy images into our S-T MRF model. Thus, vehicle tracking was performed successfully by S-T MRF, even against sudden variations in illumination and against shading effects . Finally, in order to verify the effectiveness of our tracking algorithm based on the S-T MRF for practical uses, we developed an automated system for acquiring traffic statistics out of a flow of traffic images. This system has been operating continuously for ten months, and thus effectiveness of the tracking algorithm based on S-T MRF model was proven.

Automatic traffic surveillance based on visual tracking techniques has been desired for many years. This paper proposes a basic highway surveillance system using an HMM-based segmentation method. The presented system meets the essential requirement of ITS: real-time running. Its another advantage is robustness to the shadows of moving objects, which have been recognized as one of main obstacles to robust car tracking. At present, using the system we can estimate velocity of vehicles with high accuracy. For acquiring metric information in the real world, the system does not require a precise calibration but only needs four point correspondences between the image plane and ground plane.

This paper presents an active vision system for on-line traffic sign recognition. The system is composed of two cameras, one is equipped with a wide-angle lens and the other with a telephoto lens, and a PC with an image processing board. The system first detects candidates for traffic signs in the wide-angle image using color, intensity, and shape information. For each candidate, the telephoto-camera is directed to its predicted position to capture the candidate in a larger size in the image. The recognition algorithm is designed by intensively using built-in functions of an off-the-shelf image processing board to realize both easy implementation and fast recognition. The results of on-road experiments show the feasibility of the system.