In this letter, we present bit error analysis (BER) of orthogonal multi-carrier direct sequence code division multiple access (DS-CDMA) system with multi-rate (multimedia) traffic. Analysis is carried out with random signature codes for an AWGN channel. Interference in such a system is severe because all users of all media transmit over the same assigned sub-carriers. This makes the analysis difficult. In our analysis, we divide this interference into different types and carry out our analysis to obtain the BER taking into account all these types. We show that the performance of the system is improved as the number of assigned sub-carriers M increases until a limit where the improvement does not continue even when M increases more. This is because of, as we show, the interference due to other sub-carriers becomes constant even in the case of M , and the interference in a multi-rate multi-carrier system is bigger than that in a single-carrier (M=1) by a factor of π2/3.

This paper discusses the teletraffic characteristics of cellular systems using Dynamic Channel Assignment. In general, it is difficult to exactly and theoretically analyze the teletraffic characteristics of Dynamic Channel Assignment. Also, it is not easy to theoretically evaluate influence of mobility on the traffic characteristics. This paper proposes approximate techniques to analyze teletraffic characteristics of Dynamic Channel Assignment considering mobility. The proposed techniques are based on Clique Packing approximation.

Surface morphology and piezo response on SBT films were simultaneously measured by scanning probe microscopy. In a sample that had many short-circuited capacitor pads, some curious structures were observed on the SBT film surface. The piezo image partially did not correspond with the AFM image. Some specific grains were revealed to be piezo defects. Also observed were some smaller grains with flat surface, which showed good ferroelectricity. Next, we carried out simultaneous measurements of surface morphology and leakage current. The scanning at an intentionally high voltage was repeated until the leakage points were found. We found the leakage points, which were on some large grains, not at grain boundaries or on the flat smaller grains. In another SBT film derived from an unrefined source, many ferroelectric defects were observed despite there being no curious structures on the surface. Purity has an important bearing on the ability to avoid these defects. Thus, these nanoscopic investigations would greatly facilitate understanding of the mechanisms responsible for problems and enable optimization of the process conditions in device fabrication.

A signaling system for a single-track railroad has been specified in CafeOBJ. In this paper, we describe the specification of arbitrary two adjacent stations connected by a single line that is called a two-station system. The system consists of two stations, a railroad line (between the stations) that is also divided into some contiguous sections, signals and trains. Each object has been specified in terms of their behavior, and by composing the specifications with projection operations the whole specification has been described. A safety property that more than one train never enter a same section simultaneously has also been verified with CafeOBJ.

Various shadows are one of main factors that cause errors in vision based vehicle detection. In this paper, two simple methods, land mark based method and BS & Edge method, are proposed for vehicle detection and shadow rejection. In the experiments, the accuracy of vehicle detection is higher than 98%, during which the shadows arisen from roadside buildings grew considerably. Based on these two methods, vehicle counting, tracking, classification, and speed estimation are achieved so that real-time traffic parameters concerning traffic flow can be extracted to describe the load of each lane.

Recent studies on traffic measurement analysis in the various networks (LAN, MAN, WAN) have shown that packet traffic exhibits Self-Similarity. The packet traffic represents some behavior quite different from what it has been assumed. Some papers reported that Self-Similarity degrades the network performance, such as buffer overflow and network congestion. Thus, we need new network control scheme considering Self-Similar properties. The control scheme requires high-speed calculation method of Hurst Parameter. In this paper, we propose high-speed calculation method of Hurst Parameter based on the Variance-Time Plot method, and show its performance. Furthermore, we try to apply this method to the simple network control, in order to show effectiveness of the network control with Self-Similarity.

In this paper, we investigate the performance characteristics of parallel switching architectures constructed by a stack of multistage switching networks. We first find that the performances of the previously proposed parallel switching architectures are much worse than the expected ones from analytic models which are based on the assumption that traffic is uniformly distributed at each stage of a switching network. We show that this phenomenon is closely related to a traffic-distribution capability of a parallel switching system and has a large influence on the performance. From these results, we then propose an architectural solution based on the Generalized Shuffle Network (GSN) and analyze its performance by proposing a new iterative analysis method. The proposed architecture uses self-routing and deflection routing, and inherently has a traffic-distribution capability to improve switch performances such as cell loss and delay in a cost-effective manner. From the comparison of simulation and analysis results, it is shown that the developed models are quite accurate in predicting the performance of a new parallel switching system.

To satisfy huge service demand and multi-traffic requirements with limited bandwidth, this paper proposes two different procedures of multi-channel multiple access schemes with the slotted ALOHA operation for both data and voice traffic and presents an exact analysis to numerically evaluate the performance of the systems. In scheme I, there is no limitation on access between data transmissions and voice transmissions, i.e., all channels can be accessed by all transmissions. In scheme II, a channel reservation policy is applied, where a number of channels are used exclusively for voice packets while the remaining channels are used for both data packets and voice packets. We call the system using scheme I "Non-reservation system" and call the system using scheme II "Reservation system. " Performance characteristics we obtained include loss probability for voice traffic, average packet delay for data traffic and channel utilization for both traffic. The performance of the schemes and the effects of the design parameters are numerically evaluated and compared to a wide-bandwidth conventional single-channel slotted ALOHA system with single data traffic. The analysis presented in this paper will be not only useful for the performance evaluation and the optimum design of multi-channel multi-traffic systems in wireless environments, but also applicable to evaluate other performance measures in priority networks, cellular mobile radio networks or multi-hop wireless networks.

Understanding traffic characteristics in mobile communications is invaluable for planning, designing, and operating cellular networks, and various mobility models have therefore come to be developed to predict traffic characteristics. In this paper, cell-dwell-time distribution and transition probability in a virtual cellular system are first estimated from the results of measuring taxi motion using the Global Positioning System (GPS) for large-city and small-city ranges of motion. Then, on the basis of simulations using these estimations, traffic characteristics like handoff rate and channel blocking probability in a cellular system are evaluated. It was found that a difference between large and small cities could be observed in speed distribution and direction-of-travel probability, but only a slight difference in cell-dwell-time distribution.

This paper proposes an adaptive zone selection (AZS) scheme with adaptive modulation for wireless packet transmission systems to achieve high throughput and low delay performances even under non-uniform traffic conditions. In the proposed system, based on the measurement of the propagation path characteristics to each access point (AP) as well as broadcasted blocking probability information from each AP, a terminal autonomously selects an AP and modulation parameters that give the minimum transmission failure probability determined by both the call blocking rate due to lack of radio resource and packet error rate due to severe channel conditions. Computer simulation confirms that the proposed scheme greatly improves throughput and delay performances especially under non-uniform traffic conditions.

This letter presents a new transformation technique of series solution to asymptotic solution for a perfectly conducting wedge illuminated by E-polarized plane wave. This transformation gives an analytic manipulation example of the Weber-Schafheitlin integral for diffraction problem.

We have developed a new traffic measuring tool and applied it to the real-time simulation of a network. It monitors IP traffic on an ATM link and continuously transfers the length and timestamp of each IP packet to a post-processing system. The post-processing system receives the data, estimates the cell's arrival epoch at the transmission queue of the ATM link, and simulates the queueing behavior on-line if conditions differ from those of the actual system. The measuring tool and real-time simulation represent a new approach to traffic engineering. A new estimation problem, the arrival sequence estimation, is shown and some algorithms are proposed and evaluated. Also, a new dimensioning algorithm called the queue decay parameter method, which is expected to be robust and applicable to real-time control, is proposed and evaluated.

The cellular-communication systems of the future will be required to provide multimedia services to users moving about in a variety of ways (on foot, in automobiles etc.). Different forms of motion have different characteristics. The characterization of the different forms of motion and their effects on telecommunications traffic is important in the planning, design and operation of mobile communication networks. The characterization of the motion of various platform types (inter-city buses, recreational vehicles, freight trucks, and taxis) based on measurements using Global Positioning System is presented in this paper. The measured characteristics of motion are then used to evaluate teletraffic statistics such as cell cross-over rate and cell dwell time by overlaying hypothetical cell systems on the measured loci of vehicles. Self-similarity was discovered in the cell dwell time characteristic of the taxis.

We consider a dynamically reconfigureable network where dynamically changing traffic is offered. Rearrangement and adjustment of network capacity can be performed to maintain Quality of Service (QoS) requirements for different traffic classes in the dynamic traffic environment. In this work, we consider the case of a single, dynamic traffic class scenario in a loss mode environment. We have developed a numerical, analytical tool which models the dynamically changing network traffic environment using a time-varying, fluid-flow, differential equation; of which we can use to study the impact of adaptive capacity adjustment control schemes. We present several capacity adjustment control schemes including schemes which use blocking and system utilization as means to calculate when and how much adjustment should be made. Through numerical studies, we show that a purely blocking-based capacity adjustment control scheme with a preset adjustment value can be very sensitive to capacity changes and can lead to network instability. We also show that schemes, that uses system utilization as a means to calculate the amount of capacity adjustment needed, is consistently stable for the load scenarios considered. Finally, we introduce a minimum time interval threshold between adjustments, which can avoid network instability, in the cases where the results showed that capacity adjustment had been performed too often.

Private information retrieval for k 1 databases (denoted by (k,l)-PIR for short) is a protocol that (1) a user sends an l tuple query to each of k noncommunicating replicated databases; (2) each database responds the user with an answer corresponding to the l tuple query; (3) the user privately retrieve any single bit out of the n bits of data stored in k databases. In this model, "privacy" implies that the user retrieves the bit he is interested in but releases to each database nothing about which bit he wishes to get. In general, the efficiency of (k,l)-PIR is measured by the total amount of bits exchanged between the user and the k databases, but few about its lower bounds are known except for restricted cases. In this paper, we classify (k,l)-PIR into a linear type, a multilinear type, and an affine type with respect to the relationship between queries to each database (made by the user) and answers to the user (made by each database), and show that (1) the lower bound for the communication complexity of any multilinear type (k,l)-PIR is Ω(n1/(l+1)) (Theorem 3.1); (2) the lower bound for the communication complexity of any linear type (k,l)-PIR is Ω(n) (Corollary 3.2); (3) the lower bound for the communication complexity of any affine type (k,l)-PIR is Ω(n1/(l+1)) (Theorem 4.2).

A new approach for bandwidth allocation of heterogeneous regulated traffics is proposed for cases of lossless multiplexing and statistical multiplexing under the constraint of maximum delay. Minimum bandwidth required for lossless multiplexing can be expressed as 1-dimensional unconstrained-optimization problem. The corresponding optimality condition gives an optimal bandwidth and buffer requirements. This optimality condition is extended to the case of statistical multiplexing. In case of statistical multiplexing with independent, periodic on-off fluid sources, two random variables representing stochastic worst cases for the amount of traffics generated in an arbitrary time interval are introduced and these are combined optimally. This combined model guarantees the worst case bound for the regulated traffics. Using the proposed approach, bandwidth and buffer requirements of each virtual circuit are obtained simultaneously. As these values are sensitive to multiplexing environments, an effective bandwidth considering trade-off between bandwidth and buffer requirements is introduced. The proposed effective bandwidth can be matched directly with the boundary of the acceptance region, which is less sensitive to mutiplexing environments.

This paper introduces a flexible, stream-oriented dataflow processing model based on the "Communicating Logic (CL)" framework. As the target architecture, we adopt the dual layered "Plastic Cell Architecture (PCA). " Datapath processing functionality is encapsulated in asynchronous hardware objects with variable graining and implemented using look-up tables. Communication (i.e. connectivity and control) between the distributed processing objects is achieved by means of inter-object message passing. The key point of the CL approach is that it offers the merits of scalable performance, low power hardware implementation with the user friendly compilation and linking capabilities unique to software.

This paper presents a real-time integrated traffic management (RITM) scheme that can effectively manage variable bit rate (VBR) and available bit rate (ABR) traffics having unpredictable characteristics in asynchronous transfer mode (ATM) networks. An unique feature of this scheme is that it has a special ATM cell control block, which makes it possible to monitor VBR and bursty traffics in real-time so that the delay incurred to measure cell arrival rate is minimized. In addition to its traffic monitor capability, the proposed scheme intends to dynamically reassign the leftover network resources to VBR/ABR connections without any deterioration in quality of service (QoS) of the existing connections. Particularly, we investigate into some functions of traffic management schemes that should be integrated to operate correctly in the emerging ATM networks. Also, we emphasize the merits of the RITM that has been developed to be a simple and efficient traffic management scheme to support the increasing data/Internet services and to get over difficulties in hardware complexities. The capability of managing the incoming ATM traffics in real-time helps determine an optimal acceptable number of user connections for a given network condition. We can use this value as a threshold to prevent the network from being congested and to find out a cost-effective buffer design method. This property makes the scheme extremely attractive as it supports most delay-sensitive and loss-sensitive applications at the same time without changing the existing ATM switching system architecture. The RITM scheme has been verified to reliably monitor incoming traffics and to efficiently manage network resources by computer simulations.

Multi-user uniquely decodable (UD) k-ary coding for the multiple-access adder channel is investigated. It is shown that a Tf+g+1-user UD k-ary affine code with code length f+g+1 can be obtained from two Tf-user and Tg-user UD k-ary affine codes. This leads to construct recursively a Tn-user UD k-ary affine code with arbitrary code length n. The total rate of the code tends to be higher than those of all the multi-user UD k-ary codes reported previously as the number of users increases.

Two main characteristics of VBR MPEG video traffic are the different statistics according to different picture types and the periodic traffic pattern due to GOP structure. Especially, the I-pictures at the beginning of each GOP generate much more traffic than other pictures. Therefore, when several VBR MPEG video sources are superposed, the multiplexing performance can vary according to the variations of their I-picture start times. In this paper, we show how the start time arrangement of the superposed VBR MPEG videos can significantly affect the cell loss ratio characteristics at the multiplexers, by using U-NDPP/D/1/B queueing model. It is also shown that the Lognormal distribution is more suitable for modeling VBR MPEG video traffic than the Normal and Gamma distributions, in the queueing application's view points.