A new traffic engineering and operation of ATM networks is described, which features adaptive virtual path (VP) bandwidth control and VP network reconfiguration capabilities. We call this operation system resilient self-sizing operation. By making full use of self-sizing network (SSN) capabilities, we can operate an ATM network efficiently and keep high robustness against traffic demand fluctuation and network failures, while reducing operating costs. In a multimedia environment, the multimedia services and unpredictability of traffic demand make network traffic management a very challenging problem. SSNs, which are defined as ATM networks with self-sizing traffic engineering and operation capability are expected to overcome these difficulties. This paper proposes VP network operation methods of self-sizing networks for high flexibility and survivability. The VP network operation is composed of adaptive VP bandwidth control to absorb changes in traffic demand, VP rerouting control to recover from failures, and VP network reconfiguration control to optimize the network. The combination of these controls can achieve good performance in flexibility and survivability.

In GSM High Speed Circuit Switched Data (HSCSD), the data rate can be increased by using multiple time slots instead of single time slot. Multiple time-slot assignment results in high blocking rate. To accommodate more users, flexible resource allocation strategies have been proposed. Since GSM follows TDMA/FDMA, the channels (time slots) in a base station are segmented by frequency carriers. The base station must allocate the channels which belong to the same frequency carrier to individual requests. This Flexible Resource Allocation scheme for GSM (FRA-GSM) is contrastive to the scheme proposed in our previous studies where a base station may arbitrarily allocate idle channels in the base station to incoming requests. We define satisfaction indication SI as the measurement to compare the performance of these schemes. Experiment results indicate that FRA-GSM scheme has good performance when the user mobility is high, or when some cost factors are taken into account.

Video on demand is regarded as one of the most important applications in future broadband networks. Although several trial runs in various parts of the world do not bring instant success, its inherent requirements for bandwidth and bounded delay make it a suitable candidate for studying various networks and protocols in real-time applications. Recently, the Hybrid Fiber Coaxial (HFC) networks emerged as network architecture for bringing broadband services to the home. The co-axial cable network uses a tree-like architecture and requires complex protocols for synchronizing and sharing uplink communications among many users. This paper proposes that a dual bus network may be a simpler and cost effective alternative. We implement an interactive VOD (IVOD) system as an example to demonstrate its simplicity and suitability as a community network. The system uses client/server architecture with guaranteed bandwidth and bounded delays. Simulations are conducted to test the network load and response time for different number of users. The results indicate its feasibility and the delay time can be further reduced by releasing bandwidth during the pause operation.

This paper proposes and performs the primary feasibility evaluation on Flow Attribute Notification Protocol (FANP), which is a protocol between neighbor CSR (Cell Switch Router) nodes for the management of cut-through packet forwarding, in order to apply label switching paradigm. In cut-through packet forwarding with label switching, a router doesn't have to perform conventional IP packet processing for the received packets. FANP indicates the mapping information between a data-link connection and a packet flow to the neighbor node. FANP defines two key procedures, i. e. , one is the VCID Notification Procedure, and the other is the Flow-ID Notification Procedure. The VCID Notification Procedure lets the label switching paradigm over the label swapped data-link, such as ATM link, though the other label switch architecture can not work over the label swapped data-link. The primary evaluation of FANP has been performed using the prototype system and with the actual packet statistics. The result shows that, with a corporate backbone level, the label switch router system with FANP would work well.

A novel cell-level FEC (forward error correction) scheme at SSCS of AAL type 5 for error-free data transmission services in ATM networks is proposed and evaluated. In the proposed cell-level FEC scheme, both the length of user data (e. g. , IP packet) and attached redundant data can be modified based on sender's local decision without any end-to-end parameter re-negotiation procedure. The writing and reading order regarding an interleave matrix for cell-level FEC algorithm are the same, in order to perform pipelining data transmission. The prototype implementation with software processing achieves few Mbps end-to-end throughput. The end-to-end data transmission latency and the amount of retransmission packets due to packet error at the receiver entity are evaluated by computer simulation with correlated cell dropping process. Simulation results show that the benefits of cell-level FEC scheme for the error-free data transmission services, i. e. , by use of cell-level FEC scheme, the amount of retransmitted packets can be reduced, even if the average latency for end-to-end data transmission increases slightly.

This paper describes key techniques for automatic program generation of office data handling for all types of switching systems. Our office data scenario tool generates logical-physical office data conversion programs to be installed in switching systems. Also, it generates logical office data generation programs to be installed in a logical office data generation tool that converts office conditions to a logical office data file. We were able to apply this tool to all the office data types for our new switching systems, and automatically generated about 5. 5% of the total program size. This technique reduces not only the software production cost but also the bug ratio because there is no room for human error. Also, switching system programs are much more portable, since no machine-code-dependent parts are involved in office data handling. Thus, we expect that these techniques will be the basis for highly productive, reliable, and portable software platforms for the next-generation multimedia communication systems.

This paper proposes a media synchronization mechanism for live media streams. The mechanism can also handle stored media streams by changing parameter values. The authors have implemented the mechanism on a lip-synch experimental system. Live video and voice streams input at a source workstation are transferred, and then they are synchronized and output at a destination workstation. This paper also evaluates the system performance such as mean square error of synchronization, average output rate, and average delay.

We present a throughput analysis of a multi-address call extraction server in F-NET. The extraction server splits a multi-address call into individual calls. Since the actual operation mechanisms of the server are complicated, it is difficult to directly apply the standard Markov chain technique. Restricting ourselves to the case where the server is offered by a saturated input process, we propose a simple probabilistic method to investigate the departure process of the server and its asymptotic behavior. Numerical examples evaluated by the method are compared with simulations, which demonstrate the accuracy of our modeling approach.

For the realization of the very high-speed data transmission over wide area network, the HIPPI-ATM conversion for connecting two remote HIPPI end systems is specified by ANSI. Since the credit scheme is adopted for the flow control on the ATM part in the specification, the propagation delay influences the remarkable transfer throughput degradation with the longer distance between end systems. In this paper, two priority types of HIPPI bursts are proposed, which include the flag indicating the priority, high priority or low priority. We propose the hybrid scheme that the credit scheme is adopted only for sending the high priority HIPPI bursts and the source can send low priority HIPPI bursts without reserving buffers in the receiver. In order to confirm the effectiveness of the proposed scheme, we show the characteristics of transfer performance and low priority bursts loss ratio v. s. transmission distance by simulation. Furthermore, we introduce the implemental example of the proposed scheme in the MPEG video transmission application, and show it's good performance.

An efficient hybrid scheme has been developed for optimizing register allocation applicable to CISC and RISC processors, which is crucial for maximizing their execution speed. Graph-coloring at the function level is combined with a powerful local register assigner. This assigner uses accurate program flows and access patterns of variables, and optimizes a wider local range, called an extended basic-block (EBB), than other optimizing compilers. The EBB is a set of basic-blocks that constitute a tree-shaped control flow, which is suitable for the large nested branches that frequently appear in embedded system-control programs, such as those for telephone call processing. The coloring at the function level involves only the live-ranges of program variables that span EBBs. The interference graph is therefore very small even for large functions, so it can be constructed quickly. Instead of iterative live-range splitting or spilling, the unallocated live-ranges are optimized by the EBB-based register assigner, so neither load/store insertion nor code motion is needed. This facilitates generating reliable code and debug symbols. The information provided for the EBB-based assigner facilitates the priority-based heuristics, fine-grained interference checking, and deferred coloring, all of which increase the colorability. Using a thread-support package for CHILL as a sample program, performance measurement showed that local variables are successfully located in registers, and the reduction of static cycles is about 20-30%. Further improvements include using double registers and improving debuggability.

Exception handling is not only useful for increasing program readability, but also provides an effective means to check and locate errors, so it increases productivity in large-scale program development. Some typical and frequent program errors, such as out-of-range indexing, null dereferencing, and narrowing violations, cause exceptions that are otherwise unlikely to be caught. Moreover, the absence of a catcher for exceptions thrown by API procedures also causes uncaught exceptions. This paper discusses how the exception handling mechanism should be supported by the compiler together with the operating system and debugging facilities. This mechanism is implemented in the compiler by inserting inline check code and accompanying propagation code. One drawback to this approach is the runtime overhead imposed by the inline check code, which should therefore be optimized. However, there has been little discussion of appropriate optimization techniques and efficiency in the literature. Therefore, a new solution is proposed that formulates the optimization problem as a common assertion elimination (CAE). Assertions consist of check code and useful branch conditions. The latter are effective to remove redundant check code. The redundancy can be checked and removed precisely with a forward iterative data flow analysis. Even in performance-sensitive applications such as telecommunications software, figures obtained by a CHILL optimizing compiler indicate that CAE optimizes the code well enough to be competitive with check suppressed code.

An innovative small planar packaging(SPP)system is described that can be combined with card-on-board(COB)packaging in high-speed asynchronous transfer mode switching systems with throughput of over 40-Gb/s. The SPP system provides high I/O pin count density and high packaging density, combining the advantages of both planar packaging used in computer systems and COB packaging used in telecommunication systems. Using a newly developed quasi-coaxial zero-insertion-force connector, point-to-point 311 Mb/s of 8-bit parallel signal transmission is achieved in an arbitrary location on the SPP systems shelf. Also about 5400 I/O connections in the region of the planar packaging system are made, thus the SPP system effectively eliminates the I/O pin count limitation. Furthermore, the heat flux management capability of the SPP system is five times higher than of conventional COB packaging because of its air flow control structure. An SPP system can easily enlarge the switch throughput and it will be useful for future high-speed, high-throughput ATM switching systems.

This paper analyzes first-order full-digital coherent and noncoherent PN code tracking loops for bandlimited baseband direct-sequence spread-spectrum signals under AWGN. The considered loop structures which employ a decimator to control the PN code phase have implementation advantages over loops employing higher-order interpolators. Analytic expressions are derived for the steady-state timing mean squared error, mean pull-in time, mean time to lose lock and the steady-state uncoded and coded bit error rates by employing appropriate Markov chain models. The analytical results are verified to be very accurate via computer simulations. Results are presented for BPSK spreading but extension to QPSK spreading is straightforward.

This paper presents a new approach to computing symbol error probability of fast frequency-hopped M-ary frequency shift keying (FFH/MFSK) systems with majority vote under multitone jamming. For illustrating the applications, we first consider the case in which the source data rate is fixed and the hopping rate is allowed to vary. In this case, the optimum orders of diversity for several values of M are examined. Results show that M=4 outperforms other values. Then, we treat another case in which the hopping rate is fixed and the data rate is adjusted so as to obtain maximum throughput under a given constraint of error probability. In addition to the case of diversity alone, we also evaluate the performances of the fixed hopping rate case with channel coding using convolutional code and BCH code.

Mechanism of UHF radiowave propagation into multistory office buildings are explored by using ray-tracing based models, which include a three-dimensional (3-D) ray-tracing model and a direct-transmitted ray (DTR) model. Prediction accuracy of the models is ascertained by many measured data and the measurements are carried out at many specific sites with different propagation scenarios. Their measured results also demonstrate some important propagation phenomena. It is found that (1) the direct transmitted wave may be the dominant mode; (2) the path loss neither increases nor decreases monotonically as a function of increasing floor level; and (3) there is not much difference of the average path loss among the receiving positions in the same room.

This paper proposes a high-speed connection admission control scheme, named PERB CAC (CAC based on Prior Estimation for Residual Bandwidth). This scheme estimates the residual bandwidth in advance by generating a series of virtual requests for connection. When an actual connection request occurs, PERB CAC can instantaneously judge if the required bandwidth is larger than the estimated residual bandwidth, so the connection set-up time can be greatly reduced. Therefore, PERB CAC can realize high-speed connection set-up.

Distributed web caching reduces retrieval latency of World Wide Web (WWW) objects such as text and graphics. Conventional distributed web caching methods, however, require many query messages among cache servers, which limits their scalability and reliability. To overcome these problems, we propose a query caching method in which each cache server caches not only WWW objects but also a query history. This method of finding cached objects can reduce the number of query messages among cache servers, making it possible to construct a large-scale distributed web cache server. We also propose an algorithm for constructing efficient query relationships among cache servers.

This paper studies how the self-similarity of traffic changes through shaper (buffered leaky bucket) and switch in ATM networks by numerical experiments. Further the applicability of CAC algorithm to shaped self-similar traffic is also investigated. Numerical experiments show self-similarity of total output traffic from shapers and switch is kept while connection-wise self-similarity is broken.

We propose a method of reducing laser-clipping-induced distortion in a subcarrier multiplexed (SCM) optical-cable TV system. This scheme reduces amplitude peaks of the SCM signal by controlling the phases of video carriers to prevent the clipping which occurs when these peaks fall below the threshold of a laser-diode. It is experimentally shown that using this method reduces the bit error rate in an AM-VSB / QAM hybrid optical-transmission system.

This paper presents the subjective speech quality evaluation in terms of the Mean Opinion Score (MOS) and the relationship between BER and subjective speech quality in a GSM-based radio system. The results show that in certain environments (hilly terrain and rural areas), a SNR (or C/I) higher than 12 dB is required for acceptable speech quality. For an acceptable speech quality, a BER(c1) better than 10^-2 is needed in a GSM-based system.

The Finite-Difference Time-Domain (FDTD) method is applied to the analysis of electromagnetic fields in a reverberation chamber. The chamber is used for radiated susceptibility/immunity measurement of electromagnetic compatibility (EMC) test and measurement of the radiated power of radio transmitters. The analytical results defined the distribution of the electric field in the reverberation chamber and clarified the effect on field uniformity of the size of the chamber and the number, size, and position of stirrers.