Differentiated Services architecture provides a framework that enables relative differentiation of Assured Forwarding (AF) service. The differentiation is quantified by QoS parameters in terms of loss probability and maximum delay. We develop herein an efficient model to compute resource allocation in terms of buffer and service rate that satisfies the QoS differentiation between classes of service. To evaluate the performance of the proposed model, we conducted extensive simulation on both single-node and multi-node cases. The simulation studies show that the model can provide an efficient method to allocate network resources for aggregated traffic.

The Real-time VLBI Correlator (RVC) is a new type processor for the Very-Long-Baseline Interferometry (VLBI). This correlator was primarily designed for supporting the VLBI Space Observatory Programme (VSOP). Two particular techniques, the fringe rotator after correlation and the lag-time extension technique, are newly developed for the RVC. The correlation circuit size of VLBI correlator is reduced to half by introducing the new fringe rotator, and it makes possible to realize a large delay window being essential in finding a cross correlation in real-time. The delay window can be changed flexibly with the lag-time extension technique, and its technique is useful to detect the fringe peak in a VSOP observation. The new correlator was installed at the Usuda Deep Space Center in Japan, and is used in VSOP and other domestic VLBI observations. In this paper, the key features of the Real-time VLBI Correlator (RVC) focusing on these advanced techniques are presented, and the results of its performance test are shown.

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.

The proposed medium access protocol deals especially with the timely-transmission of real-time packets in wireless multimedia networks where users of many types of traffic are present. It works based on Time Division Multiple Access/Time Division Duplex (TDMA/TDD) technique and fixed-length packet switching incorporating two different policies to work differently on either non-congestion or congestion periods. In the policy to deal with congestion periods the concept of urgent packet has been introduced as any packet whose transmission deadline is on the next frame. Hence, during periods of congestion users inform to the Base Station the number and average deadline of the urgent packets in their buffers through requirement messages. According to that information the system is able to distribute its resources in a more efficient way during periods of congestion making the real-time packet loss rate decrease considerably. The simulation results show a very good performance of the method in networks where different types of traffic coexist even under high traffic-load conditions. The results also show a good trade-off characteristic between the real-time access delay and the buffer occupancy of non-real time terminals during congestion periods.

A new expression for cell/packet loss probability in an ATM and packet switched queue system with a finite buffer is presented. Cell and packet loss analysis is based on the new concept of a "buffer overflow cluster" and the overflow probability for a queue with an infinite buffer. This approach holds for a wide variety of long-range dependent traffic sources typical of wide-area networks, as well as Internet and other communication traffics. The method is verified by simulations of two long-range dependent traffic scenarios: fractional Gaussian noise and multifractal wavelet model traffic with a beta marginal distribution.

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.

For the successful realization of the multimedia information environment, it is strongly required to develop very cost effective optical access networks. Accordingly, ways of reducing system cost are described. At the same time, the development of attractive new services is indispensable to drive network modernization. The connectionless networking service for community user groups is proposed together with the new concept of group communication.

A simple nation-wide core network architecture based on the optimized combination of WDM and OTDM technologies in a two-tier structure network is proposed. The dynamic timeslot allocation in a fixed length frame structure associated with the wavelength routing scheme creates a virtual path with variable bandwidth for edge-to-edge transport of any type of packet protocol without O-E-O conversion. The simulation results show that dynamic timeslot assignment with bandwidth reservation is the best alternative for the network bandwidth utilization efficiency. The influence of the delay caused by the physical size of the network during the request-acknowledgement process is also discussed.

Time variations of the wireless channel cause Inter-Carrier Interference (ICI) between different subcarriers in an OFDM system. In a highly mobile environment this interference may become so high that it degrades up to unacceptable levels the communication channel. In this paper, firstly we obtain a simplified expression for the total ICI experienced by every subcarrier in an OFDMA system. Unlike other previous works, the result establishes an explicit and useful relation between the ICI on each subcarrier and the speed of the rest of the terminals in the system. Then, by means of a mathematical analysis we extend the scope of that expression to a hybrid system in which OFDMA and CDMA are combined. Using the good autocorrelation and cross-correlation properties provided by Gold-sequences we propose a Gold-Code-based CDMA-OFDMA transmission technique for the asynchronous uplink channel. We show that the proposed method can reduce the total ICI and potentially increase the capacity of the system in comparison to a conventional OFDMA system.

This paper presents an efficient scheme for access bandwidth control for VBR (Variable Bit Rate) traffic between radio mobile terminals and their base stations in a WATM (Wireless ATM) network. After introducing the wireless ATM system model, we describe a new algorithm that enables dynamic slot allocation under TDMA/TDD (Time Division Multiple Access/Time Division Duplex) Media Access Control, making use of UPC (Usage Parameter Control) parameters and traffic characteristics. We show more efficient bandwidth utilization with our proposed algorithm, compared to other conventional algorithms. Moreover, we reveal that our algorithm improves cell transmission delays.

In this paper, we propose an efficient algorithm of quick routing for private Wireless ATM (Asynchronous Transfer Mode) networks. This algorithm uses hierarchical source routing, which first establishes a connection between the sending node and the home node (which has the terminal location information), and then, partially releases the connection and reroutes it between the sending node and the receiving node. This results in less delay than found in other conventional routing methods, and avoids passing through congested nodes, because this algorithm uses traffic estimation based on queuing theory. We also show the effectiveness of this algorithm with the use of computer simulations.

This paper presents sector based flooding (SBF) and adaptive sector-based flooding (ASBF) that are flooding methods for mobile ad hoc networks using position information. SBF, which divides the communication area of a sender node into sectors, allows only the node nearest to a sector representative position in each sector to rebroadcast a packet. SBF is divided into two methods, SBF-1 and SBF-2; the difference is the number of criteria used to decide whether to rebroadcast or to drop the packet. In ASBF, each node selects a flooding method from among SBF-1, SBF-2, and pure flooding, depending on its local node density. The node density is obtained from the distance between the sector representative position and its nearest node. Simulation results show that SBF reduces the number of packet transmissions generated in flooding and ASBF has high packet reachability with few packet transmissions.

IEEE 802.11 wirelesses LANs (WLANs) have been rapidly deployed in enterprises, public areas, and households. Voice-over-IP (VoIP) and similar applications are now commonly used in mobile devices over wireless networks. Recent works have improved the quality of service (QoS) offering higher data rates to support various kinds of real-time applications. However, besides the need for higher data rates, seamless handoff and load balancing among APs are key issues that must be addressed in order to continue supporting real-time services across wireless LANs and providing fair services to all users. In this paper, we introduce a novel access point (AP) with two transceivers that improves network efficiency by supporting seamless handoff and traffic load balancing in a wireless network. In our proposed scheme, the novel AP uses the second transceiver to scan and find neighboring STAs in the transmission range and then sends the results to neighboring APs, which compare and analyze whether or not the STA should perform a handoff. The initial results from our simulations show that the novel AP module is more effective than the conventional scheme and a related work in terms of providing a handoff process with low latency and sharing traffic load with neighbor APs.

Introduction of fiber-optic systems to the subscriber network is the key issue for the next generation network. Fiber-optic systems have, so far, been limited to business applications. However, the large scale introduction of fiber-optic systems to all customers, especially to the home and to small business customers is indispensable for the smooth evolution of B-ISDN. Accordingly, NTT plans to introduce a fiberoptic subscriber network widely to the home from around 1995 and to achieve an all fiber subscriber network by 2015. This paper presents the development and deployment concept for a fiber-optic subscriber network. It also proposes the fiber-optic network services that should be offered upon fiber-optic system deployment. Near term system development and deployment strategies are also discussed.

In past, dependable networks meant minimizing network outages or the impact of the outages. However, over the decade, major network services have shifted from telephone and data transmission to Internet and to mobile communication, where higher layer services with a variety of contents are provided. Reviewing these backgrounds of network development, the importance of the dependability of higher layer network services are pointed out. Then, the main aspects to realize the dependability are given for lower, middle and higher layer network services. In addition, some particular issues for dependable networks are described.

An initial trial of the optical fiber transmission system in NTT is reported in this paper. In NTT's transmission networks, the shorthaul application appears attractive in the near future. The laboratory test is primarily targeted to 32 Mb/s bit rate and 8 km long repeater spacing. We report here the design philosophy of step-index multimode fibers and repeaters for this trial. Through the design and manufacturing of fibers, the fundamental and common characteristics of fibers are clarified. Stable, compact and low power consuming optical repeaters are realized. Trere is no trouble of optical repeatered line and all repeaters in the line are operating with sufficient optical power margin. Multi-repeatered test has confirmed that experimental results are in good agreement with the design values.