Competition in some telecommunication services has emerged in Japan since deregulation of telecommunication markets in 1985. Demand forecasting methods which take into account competition and investment plan based on it should be studied. There are many forecasting and network planning methods, but most of them do not take into account competition. Thus, in this paper, the competitive Bass model, attraction model, regression model and entropy model are discussed as forecasting methods which can be used under competitive environment. Most of the existing planning methods have treated costs and interest rates as deterministic values, but in fact they are not deterministic. Thus, we show a method which represents undefined factors by fuzzy numbers with triangular membership functions.

The design and engineering of new network intelligence platforms to accommodate the ever-changing and growing demands of customers, presents rich market opportunities and challenges tempered by concerns arising from the problematic experiences of similar system and network developments. As the telecommunications industry evolves, customers are increasingly coming to expect the perception of instantaneous access to service providers together with transparency to network failures. System performance dictates that response times need to be minimised, sufficient redundant capacity installed in case of failure and controls embedded within the design to manage the exceptional situations (such as media stimulated events) that continually threaten network integrity. Network design based on a 'top-down,' 'end-to-end' methodology plays a fundamental role in delivering solutions that meet customers' performance needs. It is necessary to consider service scenario mixes, service demand, physical network topology, signalling message flows, the mapping of functional entities to physical components, and routing as part of the network design process to ensure that performance requirements are met. The use of 'what-if' design tools is particularly relevant as part of this process. A challenging task faces the System Designer with the often conflicting goals of good performance and provision of service flexibility.

Significant traffic variations occur in telecommunication networks. This paper focuses on hour-to-hour traffic variations during 24 hours and investigates the possibility of using idle periods effectively by introducing non-realtime service at a discount rate. In order to provide non-realtime service, memory is placed at each telecom center. When immediate service is not available, messages of non-realtime calls are stored in the memory and served later when network resources are available. Realtime calls are served with preference. A basic model and a method of dimensioning the memory capacity are presented. The basic model is extended to the network model, and methods of designing a minimum cost network and pricing and profit issues are presented. The results for a basic model are verified by traffic simulation. Numerical examples are given to show the effectiveness of non-realtime service.

This paper is concerned with two important planning problems for transport network planning; circuit routing problems and facility planning problems. We treated these optimization problems by taking into account survivability requirements. In the circuit routing problem tackled in this paper, therefore, optimization of circuit restoration plans, namely allocation of spare capacity for assumed failure scenarios is considered together with optimization of circuit routing in a no failure case. In the facility planning problems, failure scenarios of new facilities whose installation is yet to be determined are considered. In this paper, we present a formulation of these two optimization problems, and give 1) optimization algorithms based on the IA (Increment Assignment) method for routing problems and 2) optimization algorithms based on a combination of the GA (Genetic Algorithm) and the IA method for facility planning problems. The IA based routing algorithm can cope flexibly with various constraints on practical network operations and is applicable to large-scale complicated network models without causing a rapid increase in computation time. The GA based facility planning algorithm includes the IA based algorithm as a function for evaluating objective function values. Taking advantage of the important features of the IA based algorithm, we propose an acceleration technique for the GA based facility planning algorithm. In this paper, several numerical examples are provided and the effectiveness of the proposed algorithms is numerically evaluated.

This paper discusses the problems in designing virtual-path (VP) networks and underlying transmission-path (TP) networks using the "self-sizing" capability. Self-sizing implies an autonomous adjustment mechanism for VP bandwidths based on traffic conditions observed in real time. The notion of "bandwidth demand" has been introduced to overcome some of the problems with VP bandwidth sizing, e.g., complex traffic statistics and diverse quality of service requirements. Using the bandwidth demand concept, a VP-bandwidth-sizing procedure is proposed in which real-time estimates of VP bandwidth demand and successive VP bandwidth allocation are jointly utilized. Next, TP bandwidth demand, including extra capacity to cover single-link failures, is defined and used to measure the congestion level of the TP. Finally, a TP provisioning method is proposed that uses TP "lifetime" analysis.

This paper discusses the development of a design tool which supports a process for constructing PVC-based, ATM networks. Because of mathematical complexities, a heuristic approach has been adopted to find an optimal network configuration. Through a GUI, users define a physical network, and PVC networks which are logically constructed within the physical network. Based on the defined network configurations and user traffic demand, the tool evaluates performance measures. In response to the results of the evaluation, network designers can modify the network configuration to improve the performance. With the aid of this tool, they can repeat this interactive process until the estimated performance measures meet a desired quality. The tool has been applied to the design of several private ATM networks which will be constructed in the near future. The response time of this design tool is so fast that wait time can be negligible.

The Virtual Path (VP) concept is one of the versatile features of ATM/B-ISDN. Using the VP concept, a bundle of virtual circuits can be grouped together between any two switching nodes in the network. Further, the VP bandwidth and routing can be dynamic. Building on this idea, a dynamically reconfigurable, dynamic call routing wide area (backbone) broadband network concept is proposed. Specifically, this provides dynamism at two levels: at the VP level and at the connection level. For an incoming connection request, at most two logical virtual path connections (VPCs) are allowed between the origin and the destination; these logical VPCs are defined by setting virtual paths links (VPLs) which are, in turn, physically mapped to the transmission network. Based on the traffic pattern during the day, the bandwidth of such VPCs and their routing, as well as call routing, changes so that the maximum number of connection requests can be granted while maintaining acceptable quality of service (QoS) for various services. Within this framework, we present a mathematical model for network design (dimensioning) taking into account the variation of traffic during the day in a heterogeneous multi-service environment. We present computational results for various cost parameter values to show the effectiveness of such networks compared to static-VP based networks in terms of network cost.

We propose a new network architecture nemed Holonic Network for personalized multimedia communications, which is characterized by distributed cooperative networking based on autonomous management and all-optical transport networks. We than propose autonomous routing method. Moreover, an information searching method and a route generation method with network maps, which are essential for this network, are proposed. Lastly, we evaluate the proposed network performance by theoretical analysis and system emulation.

In this paper, we introduce a VP rearrangement scheme to realize the dynamic control of ATM network. We demonstrate its effectiveness for the transport of B-ISDN traffic which is both fluctuous and hard to predict. First, we present a strategy for the ATM network provisioning, used to manage both the logical VP network and the underlying physical transport network. We then propose a VP rearrangement scheme and discuss its performance. Lastly, we analyze the proposed scheme by simulations, and confirm that its performance, in comparison to the conventional, dynamic VP bandwidth control scheme, is superior.

A new GSM data protocol called high speed circuit switched data (HSCSD) have been developed by European Telecommunications Standards Institute (ETSI) for high speed file transfer and mobile video applications. HSCSD increases data rate by using multiple TDMA time slots (up to 8) instead of one time slot in the current GSM implementation. The problem of multiple time slot assignment is that blocking rate of the system will increase. This problem can be solved by flexible resource assignment where the service specifies the maximum and the minimum capacity. Based on the current available capacity of a base station, a user will be assigned any rate between the maximum and the minimum capacities. This article describes HSCSD protocol and presents four radio resource allocation strategies for HSCSD: always allocates maximum, always allocates minimum, allocates maximum unless available resources are not enough, and allocates resources according to the current blocking statistics of the base station. A simulation model is proposed to investigate the performance of these algorithms. The blocking probability, the call completion probability, and the quality of service are used to evaluate the effects of algorithms in different system behaviors.

This paper investigates the problem of constructing a logical multicasting tree which dispatches data to multiple destinations according to their bandwidth requirements. An optimization problem is formulated to minimize the maximum delay between a sender and multiple receivers. An algorithm of finding the optimum branching locations is presented. Performance analysis from the closed queueing network theory is given to evaluate a multicasting tree network based on this proposed algorithm.

In this paper, we evaluated performance of mobile exchange control network. Queueing network model is used for modeling of mobile exchange control network. We developed a call control processing and location registration scenario that has a message exchange function between processors in mobile exchange control network. The network symbols are used the simulation models that are composed of the initialization module, message generation module, message routing module, message processing module, message generation module, HIPC network processing module, output analysis module. As a result of computer simulation, we obtain the processor utilization, the mean queue length, the mean waiting time of control network based on call processing and location registration capacity. The call processing and location registration capacity are referred by the number of call attempts in the mobile exchange and must be satisfied with the quality of service (delay time).

The emerging, ATM network will support permanent, semi-permanent and switched virtual channel connections (SVCC). A number of simulation studies have been carried out to study the performance of SVCCs using empirical data. The absence of an analytical model has prevented the study of SVCCs under known traffic distributions. In this paper, we develop a new delayed vacation model to facilitate the performance study of SVCCs with configurable inactivity timer in the ATM network interface card (NIC). Comparison with simulation results indicates that the proposed model is very accurate and can be effectively used to optimise the performance of SVCCs by selecting an appropriate inactivity timer.

In the design and analysis of circuit-switched alternate-routing networks a fundamental and important problem is the decomposition of the overflow traffic from a given trunk-group (or link) into its component traffic streams. Decomposition is required because the individual streams corresponding to different sources of traffic can in principle be routed to different links depending upon the routing algorithms. Because the exact solution of this problem is intractable, several approximate methods have been given in the past. However, these approximate methods yield either incomplete solutions or solutions that are not tractable enough to be implementable in today's large networks. In this paper, we describe a model which provides a complete solution for the individual streams overflowing a group of trunks when this group of trunks is offered a number of independent traffic streams with varying peakedness values (peakedness=variance/mean, where mean and variance are the first two moments of a given traffic stream (or distribution); these moments adequately describe a given traffic distribution for teletraffic calculations). The derived formulas are simple and easily implementable in algorithms for the design of today's networks which can require large amounts of computation.

In recent years, and increasing number of studies have been reported regarding multimedia LANs that integrate voice, data and video communications. The Movable Boundary method has been suggested as a way to integrate circuit and packet switching. However, how this can be practically managed, especially for multimedia LANs, is not clear. Working under the assumption that an optical loop network in used as a multimedia LAN, we propose Hybrid Allocation as a new Movable Boundary method. Hybrid Allocation features traffic prediction for circuit switching calls, and timeslot allocation close to the boundary of circuit and packet switching areas. Evaluations of traffic simulation and network efficiency show it to be a promising architecture for integrating circuit and packet switching on a multimedia LAN.

Narrow-band ISDN services may experience nonstationary traffic conditions. Therefore, switch design should take account of these conditions. We propose new performance measures for switching systems and describe a traffic model, which is a mixture of stationary Poissonian traffic and momentarily focused traffic. On the basis of this model, performance measures are determined so as to satisfy grade of service requirements that are in effect during some short interval after the momentarily focused traffic enters the system. We also propose an overload control scheme that uses these new performance measures. Finally, we show practical and numerical examples for the performance measures and overload control scheme.

The use of existing metallic local line facilities is being studied for the provision of high-speed digital transmission services. Local line characteristics have to be modeled in the form of the objective requirements that should be met by DSL for estimating the feasibility of the service provision in the actual network. This paper presents the results of a study that models the metallic media characteristics of NTT's local network. First, the line lenghts determined by the existing local line deployment rule and the cable types used in the networks are introduced. Second, the values of crosstalk characteristics, the most significant factors in limiting DSL range, are given by classifying essential line conditioning states of each cable. The values of crosstalk characteristics are newly computed by taking into account detailed cable pair-binding (cabling) structures, and the worst case values among all possible combinations of multiple inter-pair interfering-interfered relationships within a cable are given though a previous study approximated cable pair-binding structures. The crosstalk characteristics of NTT's and American local networks are also compared. A modified approximate equation of line propagation characteristics is also proposed for representative local lines, and its precision is verified by comparing simulation results to actual measurements in both frequency and time domains.

A joint estimator for carrier phase, symbol timing, and data sequence is proposed. This fully digital scheme is systematically derived from the maximum likelihood estimation (MLE) theory. The simulation and the analytical results demonstrate that the scheme is asymptotical to the optimum in AWGN channel.

For down-link communication in a DS/CDMA cellular mobile radio system, the transmitted power of the base station must be effectively adjusted in real-time fashion to achieve good communication quality because the system exists multipath short-term fading and near-far problem. In this paper, we propose two down-link power control mechanisms: one is the centralized SIR-balancing method and the other is the distributed SIR-based method. We investigate how the outage probability is affected by system parameters and optimally design the parameters for these two down-link power control mechanisms. Also, the two down-link power control mechanisms are compared and discussed.

Partial capture effect for multi-carrier radio packet communication network is evaluated in frequency selective fading channel. In multi-carrier modulation (MCM) network where each terminal uses several sub-carriers for transmission,the terminals have different instantaneous frequency responses because of its location, fading pattern, and other various factors. This generates the difference of received power in frequency domain, then partial capture effect can be considered at each sub-carrier. Moreover these partially captured packets are not damaged by inter symbol interference (ISI) caused by frequency selective fading, which seriously degrades single-carrier modulation (SCM) network. From this point of view we present the partial capture effect for the MCM network in the frequency selective fading environment. The results show that the MCM network with partial capture has more advantages than the MCM network without partial capture in terms of the throughput and the average number of transmissions.

We propose a method to make new sequence number (SN^*) for AAL 3/4 in ATM networks. This method observes the segment type (ST) and length indicator (LI) fields with sequence number (SN) to make the SN^*. Our proposal also includes an example of the method.

This paper presents a novel approach to a soft-output equalizer, which makes a symbol-by-symbol soft-decision based on a posteriori probabilities (APP's) criterion in the presence of intersymbol interference. The authors propose a soft-output Viterbi equalizer (SOVE) employing expanded memory length in a trellis of the Viterbi algorithm with small arithmetic complexity. The proposed equalizer gives suboptimum soft-decision closer to that of a equalizer with the maximum a posteriori probabilities (MAP) algorithm than the conventional SOVE.

Many efforts are currently underway to design wideband mobile communication systems. In this letter, we clarify the received signal level characteristics for wideband mobile radio channels in line-of-sight (LOS) microcells. We conduct several urban-area field experiments to measure the received signal levels for various receiver bandwidths from 300 kHz to 30 MHz and the power delay profile. The experimental results show that the fading depth of the received signal decreases as the normalized rms delay spread, defined as the product of receiver bandwidth and rms delay spread, increases. These results are useful in designing wideband microcell systems for urban areas.

The valid region for the application of the conventional Improved Circuit Theory (ICT) in the analysis of wire antennas is established. To further extend the application of ICT to the analysis of much longer antennas, Tai's trial function is used to derive new formulas for the impedance matrix. Unlike the conventional ICT trial function, Tai's trial functions lead to input impedances which are finite irrespective of antenna length. Results of the new ICT impedance formulas are comparable in accuracy with the general method of moments. Moreover, since all the elements of the new formula have been expressed in closed-form, the resulting ICT algorithm is still superior in terms of computer running time with lesser storage requirement compared to other conventional methods like method of moments. This would enhance ICT applications in CAD/CAE systems.