We propose burst based bandwidth reservation method called FRP (Fast Reservation Protocol) in ATM LAN with general topology, and evaluate its performance. In FRP, the bandwidth is allocated on each link on burst basis, not on call basis. This enables an effective use of network resources when it is applied to highly bursty traffic, which can be typically found in data communications. The problem of FRP is that VCs traversing the different number of links experience different blocking probabilities as can be found in the conventional circuit-switching networks. In this paper, we treat a fairness issue in FRP-based ATM local area networks. The Max-Min flow control is adopted as the fair bandwidth allocation method to accomplish the fairness in the throughput. However, the original Max-Min flow control works in a centralized fashion, which is not desirable in the FRP-based ATM LAN. We therefore propose a "semi"-distributed Max-Min flow control suitable to FRP, in which each switch maintains its own local information about bandwidth usage of the connected links. Through simulation experiments, we show that the proposed semi-distributed Max-Min flow control can achieve the fairness among VCs as the original Max-Min flow control when the propagation delays are not large and the number of VCs is not so much.

Various kinds of new architectures have been proposed to enhance operating performance of the DRAM. This paper reviews these architectures including EDO, SDRAM, RDRAM, EDRAM, and CDRAM. The EDO slightly modifies the output control of the conventional DRAM architecture. Other innovative architectures try to enhance the performance by taking advantage of DRAM's internal multiple bits architecture with internal pipeline, parallel-serial conversion, or static buffers/on-chip cache. A quantitative analysis based on an assumption of wait cycles was made to compare PC system performance with some architectures. The calculation indicated the effectiveness of external or on-chip cache. Future trends cover high-speed I/O interface, unified memory architecture, and system integrated memory. The interface includes limited I/O swing such as HSTL and SSTL to realize more than 100MHz operation. Also, Ramlink and SyncLink are briefly reviewed as candidates for next generation interface. Unified memory architecture attempts to save total memory capacity by combining graphics and main memory. Advanced device technology enables system integration which combine system logic and memory. It suggests one potential direction towards system on a chip in the future.

An ATM network design algorithm is treated as a resource allocation problem. As an effective way to facilitate a coexistence of traffic with its diverse characteristics and different quality of service (QOS) requirements in ATM networks, a virtual path (VP) concept has been proposed. In attempting to design the VP (Virtual Path)-based ATM network, it requires to consider a network topology and traffic pattern generated from users for minimizing a network construction cost while satisfying QOS requirements such as cell / call loss probabilities and cell delay times. In this paper, we propose a new heuristic design algorithm for the VP-based ATM network under QOS constraints. A minimum bandwidth required to transfer a given amount of traffic is first obtained by utilizing an equivalent bandwidth method. After all the routes of VPs are temporarily established by means of the shortest paths, we try to minimize the network cost through the alternation of VP route, the separation of a single VP into several VPs, and the introduction of VCX nodes. To evaluate our design algorithm, we consider two kinds of traffic; voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in the cost-effective VP-based ATM network.

In the millimeter-wave propagation inside of figure U guideway of maglev, a multipath model using the ray-tracing method is presented. Prediction shows that delay spread is exceedingly small and high speed data transmission more than 100Mbps is possible without an equalizer.

Ever increasing demand for higher bandwidth memories, which is fueled by multimedia and 3D graphics, seems to be somewhat satisfied with various emerging memory solutions. This paper gives a review of these emerging DRAM architectures and a performance comparison based on a condition to let the readers have some perspectives of the future and optimized graphics systems.

Efficiency of network resource can be improved by statistical multiplexing in ATM networks. If cell traffic characteristics of each connection could be obtained beforehand, we could admit maximum connections while satisfying the QoS (Quality of Service) objective. Since such traffic characteristics as an average rate and a mean burst length are difficult to anticipate, only peak rate will be used for CAC (connection admission control). The peak rate assignment strategy will, however, lead to inefficient network utilization for bursty traffic. This paper proposes an adaptive admission control using real-time traffic measurements to overcome the above problem. This scheme is based on two-state cell stream model composed of overload and underload states. The two-state model simplifies the measuring algorithm, which is suited for online processing. Performance of this scheme is investigated through simulation study for multiplexing of on-off sources with a wide spectrum of traffic characteristics. Since the proposed control scheme exploits measurements of cell streams, it achieves nearly optimum bandwidth efficiency.

A uniquely-structured Usage Parameter Control (UPC) method named Virtual-shaping is proposed which considers cell arrival time jitter between user and UPC point. The method uses a modified Dangerous Bridge UPC circuit (Sliding window type) and virtually (logically) shapes cell traffic using cell arrival time compensation to offset cell delay variation (CDV). In addition, the proposed method is based on a cell-buffer-less structure and can be realized with reasonable hardware. The method yields precise and accurate monitoring. Computer simulations show that the method offers higher network utilization than the conventional Leaky Bucket based UPC method. The proposed method will make it possible to create more effective B-ISDNs, and more cost-effective broadband VBR services.

The recent progress of B-ISDN signaling systems has enabled networks to handle calls which require a wide variety of ATM connection sets. This paper is concerned with the circuit group which handles calls requesting asymmetric forward and backward multi-connections, and has the capability of both bandwidth negotiation and bandwidth reservation as a traffic control for enhancing call blocking performance. A model of the circuit group is first established focusing on the call level characteristics of the group, and then a method based on the reduced load approximation and an approximate analysis of a multirate group is proposed for calculating approximate blocking probabilities. The accuracy of the approximation method is evaluated numerically by comparing with an exact method and simulation. Further the impact of bandwidth negotiation and reservation on call blockings is examined based on numerical examples.

Recently as one of attractive applications in the B-ISDN era, LAN/MAN interconnection through an ATM network has been coming up because burstiness of LAN/MAN data traffic is applicable to distinctive features of cell based ATM network. In order to overcome a difference of the connection mode, i.e., CL packet transfer of LAN/MAN and CO cell transfer of ATM network, a number of interworking and bandwidth allocation mechanisms have been proposed. These methods, however, indicate both merits and drawbacks concerning with CL data transfer quality, network resource efficiency and processing overhead in IWU/CLS and the network, and have been mostly evaluated only for a single IWU model. This paper aims at showing the most appropriate method of LAN/MAN interworking for IWU-IWU or IWU-CLSF connection. In the paper, some interworking issues including a general qualitative assessment are clarified. We then evaluate the selected five interworking methods based on Bandwidth Renegotiation (BR) and VC Establishment (VCE), which are combined with Traffic Enforcement Functions (TEFs) based on policing mechanisms and Cell Loss Control (CLC) scheme. By transient and stationary simulation approach for a single IWU and an IWU-CLS connection model, the most applicable method is indicated as a case study from view points of the communication quality, effective use of the bandwidth and processing load.

The FDDI-II is a high speed and flexible backbone LAN. It can divide the capacity into one packet-switched channel with flexible bandwidth and up to 16 isochronous channels which may be allocated for a variety of real-time services such as video and voice. How to allocate and maintain isochronous bandwidth is an important issue for supporting good services to users. The FDDI-II standard proposed a centralized scheme to achieve this goal. In this paper, we propose a new scheme in a distributed fashion for the management of isochronous bandwidth. Based on our scheme, the network can support various services in a more efficient way.

The newly developed high speed DRAMs are introduced and their innovative circuit techniques for achieving a high data bandwidth are described; the synchronous DRAM, the cache DRAM and the Rambus DRAM. They are all designed to fill the performance gap between MPUs and the main memory of computer systems, which will diverge in '90s. Although these high speed DRAMs have the same purpose to increase the data bandwidth, their approaches to accomplish it is different, which may in turn lead to some advantages or disadvantages as well as their fields of applications. The paper is intended not only to discuss them from technical overview, but also to be a guide to DRAM users when choosing the best fitting one for their systems.

In this paper, trellis coded modulation with bandwidth expansion is examined. The proposed scheme is a modified Symbol-rate-increased TCM [3]-[5], which allows the bandwidth expansion ratio to be varied to an arbitrary value. The Symbol-rate-increased TCM has been shown to be a particular case of the proposed scheme. Simulation results have clarified that the proposed scheme achieves a significant improvement over an uncoded scheme in an AWGN channel.

An improvement of Q evaluation is discussed. The Resonance Curve Area method was confirmed to give a deviation in the order of 6104. The result was three times more accurate than the widely known Q evaluating method which utilizes the cursor function installed in a network analyzer. A discussion is also made on the physical validity of the RCA method. It is shown that the application of the RCA method improves the accuracy of the cavity perturbation method. Actual measurements have shown that the deviation of dielectric constant is less than 1% and that of the loss tangent is less than 3%, in the order of 104. The accuracy of the RCA method was estimated to be three times that of the conventional cavity perturbation technique. The consistency of the perturbation with other methods has also confirmed. The accuracy comparison to more accurate formulae derived from a rigorous solution have shown that the difference is sufficiently small.

In this paper, we study a dynamic bandwidth control which is expected an effective use of network resources in transmitting highly bursty traffic generated by, e.g., interconnected LAN systems. First, a new LAN traffic model is proposed in which correlation of not only packet interarrival times but also packet lengths are considered. An analytic model for a LAN-ATM gateway is next introduced. It employs the dynamic bandwidth control using the proposed LAN traffic model and some performance measures are derived by it. The analytic model takes into account the probability that a bandwidth increase request may be rejected. Finally, some numerical examples are provided using the analysis method and performance comparisons between the dynamic and fixed bandwidth controls are made. As a result, it is quantitatively indicated that () if the equivalent bandwidth is used in average, the dynamic bandwidth control keeps packet and cell loss rates one to two orders lower than the fixed bandwidth control, () when the more strict QOS in terms of loss rate is requested, the dynamic bandwidth control can become more effective.

A local area network (LAN) can now provide high-speed data communications in a local area environment to establish distributed processing among personal computers and workstations, and the need for interconnecting LANs, which are geographically distributed, is naturally arising. Asynchronous Transfer Mode (ATM) technology has been widely recognized as a promising way to provide the high-speed wide area networks (WAN) for Broadband Integrated Services Digital Network (B-ISDN), and the commercial service offerings are expected in the near future. The ATM network seems to have a capability as a backbone network for interconnecting LANs, and the LAN interconnection is expected to be the first service in ATM networks. However, there remain some technical challenges for this purpose; one of the main difficulties in LAN interconnection is the support of connectionless traffic by the ATM network, which is basically a connection-oriented network. Another one is the way of achieving the very high-speed data transmission over the ATM network. In this paper, we first discuss a LAN internetworking methodology based on the current technology. Then, the recent deployments of LAN interconnection methods through B-ISDN are reviewed.

This paper proposes a high-speed VP bandwidth control scheme for ATM networks that utilizes a distributed control mechanism. First, the characteristics of VPs are compared with those of digital paths in STM networks. A distributed control scheme is adopted for rapid control. The basic elements and the necessary distributed function, the control algorithm, and the message transmission mechanism, are elucidated. The bandwidth alteration time with the proposed algorithm is estimated by considering network element processing and queuing delay. The proposed VP bandwidth control scheme can be applied to both public networks and leased line services. Finally, this paper focuses on its application to leased line services, and discusses the resource reduction effects of the proposed scheme.

The effectiveness of traffic shaping for VBR traffic is analyzed. Evaluation results prove that traffic shaping can improve link efficiency for most forms of bursty VBR traffic and that link efficiency gains of more than 250% can be expected without the shaping delay imposing any significant QOS deterioration. Traffic shaping increases the link efficiency to about 80% for traffic with short burst repetition periods. The traffic shaping techniques and analytical results described herein can be employed in the traffic management of future B-ISDN/ATM networks.

This paper deals with a network architecture based on a backbone network, using ATM switches (ATM-SW) and ATM Cross-Connect Systems (ATM-XC). The backbone network is efficiently utilized by multiple-routing scheme. The performance of the network is controlled, exploiting the concept of Virtual Paths (VP) in ATM technology. The network is controlled by allocating the bandwidth of VPs so as to minimize the worst call blocking probability of all ATM-SW pairs, under the constraints of the ATM-SW capacities and the bandwidths of transmission paths in the backbone network. To improve network performance, we use a trunk reservation scheme among service classes. We propose a heuristic approach to solve the problem of non-linear integer programming. Evaluation of the proposed optimization scheme, in comparison to other optimal methods, shows the efficiency of the present scheme.

This paper analyzes the performance of an ATM cell multiplexer with a two level MMPP input on a discrete-time basis. We approximated the input process as a simple MMPP model. We developed an MMPP/D/1/K queueing model for the ATM cell multiplexer, and employed an analytic approach for the evaluation of cell loss probability. We verified the accuracy of the results using computer simulation. We applied the above analytic method to connection admission control (CAC) of the ATM network. The resulting connection admission control scheme employs the concept of the "effective bandwidth" and table-look-up procedure. We confirmed through a computer simulation that the proposed connection admission control scheme outperforms the peak bandwidth allocation scheme with respect to link utilization.

This paper discusses and evaluates, from the viewpoints of definition, analysis, and performance, frequency assignment schemes that enable the efficient assignment of multiple-bandwidth carriers on the transponder in SCPC/FDMA systems with demand assignment operation. The system considered handles carriers of two different bandwidths, and assigns only consecutive slots on the transponder band to broadband carriers. Three types of frequency assignment schemes are proposed, each of which incorporates one or both of two assignment concepts: (1) pre-establishment of assignment priorities on the transponder band, and (2) establishment of broadband slots to guide broadband carrier assignment. Following a definition of the schemes, equations are derived to theoretically analyze performance factors such as call loss for the narrowband and broadband carriers, and system utilization efficiency. Finally, theoretical performance calculated for various traffic and system conditions are presented and evaluated, for the purpose of comparison between the three schemes. Computer simulation results are also presented, to demonstrate the accuracy of the derived equations and to supply data for models too large for theoretical computation. Main results obtained are as follows. (1) Regardless of traffic or system conditions, the assignment scheme incorporating both assignment priorities and broadband slots shows the best performance in terms of broadband call loss and system utilization efficiency. (2) The establishment of broadband slots improves performance when the ratio of broadband traffic to the total traffic volume is high, but worsens performance when the narrowband traffic ratio is higher. (3) All aspects of performance improve with the increase of the total number of assignable slots on the transponder band.