This paper studies the optimization of signature waveforms and power allocation for synchronous code-division multiple access (CDMA) systems under the root-mean-square (RMS) bandwidth constraint. The optimization is considered for two types of receivers, namely the conventional matched filter (MF) receiver and the minimum mean-square error (MMSE) receiver. For both cases, the optimization criterion is to maximize the average signal to interference ratios (SIRs) at the receivers' outputs. For a given RMS bandwidth constraint and an arbitrary power allocation scheme, a procedure to obtain the optimal signature waveforms is provided. Based on this procedure, it is then shown that the optimal power allocation is achieved when all the received powers are equal. With the optimal power allocation, solutions for the optimal signature waveforms are presented and discussed in detail. It is also demonstrated that, compared to the previously obtained Welch-bound-equality (WBE) signature waveforms, the proposed signature waveforms can significantly improve the user performance.

The Quality of Service (QoS) requirements such as delay and cell loss ratio (CLR) are very stringent for video transmission. These constraints are difficult to meet if high network utilization is desired. Dynamic bandwidth allocation in which video traffic prediction can play an important role is thus needed. In this paper, we suggest to predict the variation of I frames instead of the actual size of I frames, and propose an algorithm that can achieve fast convergence and small prediction error, thus imposing QoS and attaining high network utilization. The performance of the scheme is studied using the renegotiated constant bit rate (RCBR) service model. The overall dynamic bandwidth allocation scheme based on our fast convergent algorithm is shown to be promising, and practically feasible for efficient transmission of real time videos.

A new optical access system based on the synchronous transfer mode - passive double star system has been developed to provide high-speed LAN-like access. It uses a shared-band method that enables multiple users to efficiently share a single bandwidth of up to 10 Mb/s and a grouping function that divides the access network into several logical networks, each of which can provide a virtual LAN to users. This paper describes an information model and a framework for configuration management and fault management and discusses the requirements for element management, which involves data-link establishment, logical group management, and testing. Element management mainly requires appropriate remote handling on data cards installed in each optical network unit on user premises. A method is proposed that satisfies these requirements. With this method, the element operations system can provide the required operational functionality.

The optimization of path bandwidth allocation in large-scale telecommunication networks is studied. By introducing a decomposition-coordination scheme to global optimization of the path bandwidth allocation which aims at minimizing the worst case call blocking probabilities in the network, the spatial and time complexities are both reduced, while the accuracy is almost the same as that given by direct optimization.

A new graphic and display processor, which is suitable for high-performance car navigation systems or next-generation ITS mobile terminals, has been developed. The performance bottleneck of conventional consumer graphic systems exists not only in the rendering performance of the graphic processor itself, but also in CPU-capability and CPU-bus bandwidth. To release this latter bottleneck, the new processor has Controller/DSP Unit and FPU for graphic-macro-command parsing and geometric operations, respectively, which used to be the CPU tasks and occupy some amount of CPU-bus bandwidth to transfer their results. The architecture of the new processor is organized so as to carry out macro-pipelined operations of graphic and display processing smoothly. One of the features of this processor is having special hardware, Polygon-Engine and Short-Vector-Accelerator, for the rapid rendering of 2D maps, where complex polygons and short line-segments are the dominant objects to be rendered. Another feature is the hardware support of multi-layer/window display with alpha-blend overlapping. This function and additional video processing capability, such as MPEG4 decoding, would be useful in the next generation intelligent terminals. The processor LSI has been successfully fabricated by using 0.18 µm standard CMOS technology. More than five million transistors are implemented on this chip. The peak rendering speed of this processor has been measured as 200 Mpixel/s at 133 MHz processor internal clock frequency. Other results of the graphic system evaluation have demonstrated that this new processor has appropriately high performance and useful functions for the next generation mobile terminals.

For a baseband pulse amplitude modulation (PAM) signal limited to Nyquist frequency, mathematical derivation of the timing recovery for a fourth-law circuit followed by a band-pass filter is carried out. The results show that the derived timing wave is expressed as a function of the pulse shape entering the timing path and the bandpass filter tuned to the pulse repetition frequency.

Carrying IP traffic over connection-oriented networks requires the use of bandwidth on demand schemes at gateways or network interfaces. A new virtual queue occupancy, which is more accurate than the classical one, is being proposed for IP/SONET bandwidth on demand. Based on the virtual queue occupancy, two enhanced periodic approaches for lossless services, LAVQ and LAVQL, are simulated and evaluated. Simulations show that LAVQ outperforms its counterpart LAQ in terms of bandwidth utilization. By curbing the queue occupancy fluctuation, LAVQL further promotes bandwidth utilization and conceals the influence of the system latency on delay jitter as well.

We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving an approximately fair allocation of bandwidth with a small amount of hardware in a high-speed network. The basic process for the allocation of bandwidth uses selective packet dropping that compares the measured input rate of the flow with an estimated fair share of bandwidth. Although V-WFQ is a hardware-efficient FIFO-based algorithm, it achieves almost ideal fairness in bandwidth allocation. V-WFQ can be implemented in the high-speed core routers of today's IP backbone networks to provide various high-quality services. We have investigated V-WFQ's performance in terms of fairness and link utilization through extensive simulation. The results of simulation show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.

In this paper, we introduce a concept of minimum bandwidth guaranteed service model for mobile multimedia. In this service model, service is defined in the context of the guaranteed minimum bandwidth and the residual service share. Each flow under this service model is guaranteed with its minimum bandwidth and provided with more in proportion to the residual service share if there is leftover bandwidth. The guaranteed minimum bandwidth assures a flow to keep minimum tolerable quality regardless of the network load, while the leftover bandwidth enhances the quality of service according to the application's adaptivity and the user's interest. We show that the minimum bandwidth guaranteed service model could be implemented by a two-folded wireless packet scheduler consisting of a guaranteed scheduler and a sharing scheduler. Wireless channel condition of each flow is considered in scheduling so that wireless resource can be distributed only to the flows of good channel state, improving total wireless link utilization. We evaluate the service model and the scheduling method by simulation and implementation.

This paper elucidates the optimum bandwidth per sub-carrier in the reverse link for multicarrier (MC)/DS-CDMA using a 10 to 80-MHz bandwidth in a multipath fading channel with numerous resolved multipaths, taking into account all major effects, i.e., the improvement in the Rake time diversity effect and the degradation in the path search and the channel estimation due to multipath interference (MPI). In the paper, we assume a broadband channel model with the maximum delay time of up to approximately 1 µsec simulating a microcell with the radius of less than 1 km in an urban area. The simulation results clarify that the improvement in the radio link performance is almost saturated at a bandwidth greater than approximately 40 MHz when the spreading factor of the channel is SF=32, and the best performance is achieved at the bandwidth of approximately 20-40 MHz when SF=4, employing two-branch antenna diversity reception (an average equal power delay profile and an exponential decay power delay profile are assumed, where the number of multipaths is changed from 12 to 48 for both profiles). This is generated by the tradeoff between the improvement in the Rake time diversity effect and the increased MPI in addition to the degradation in accuracy of the path search and channel estimation associated with a lower average received signal-to-interference plus background noise power ratio. Therefore, we conclude that MC/DS-CDMA, where each sub-carrier has the bandwidth of approximately 20-40 MHz, is one of the most promising candidates for broadband packet wireless access in the reverse link.

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.

Recent advances make it possible to mitigate a number of drawbacks of conventional phase locked loops. These advances permit the design of phase tracking system with much improved characteristics that are sought after in modern communication system applications. A new phase tracking system is outlined which reduces the effects of VCO phase noise to an insignificant level. This fact permits extremely narrow bandwidth phase tracking systems to be realized, even when a VCO with poor phase noise characteristics is employed. The improvement in performance over conventional phase locked loops is analyzed. The new phase tracking system also has other benefits such as precise centre frequency and elimination of peaking in the transfer function. To implement the phase tracking system requires a frequency measurement. We outline a new highly integrated frequency measurement method suitable for narrow bandwidth applications. Experimental results from a prototype confirms theoretical results.

In leased line services used by ISPs (Internet Service Providers) the bandwidth is fixed, but the traffic changes dynamically. Therefore, there is a necessity for ISPs to accommodate extra capacity to meet peak usage demands; many resources are not used in off-peak hours. To address this, we propose an auction method for the dynamic allocation of bandwidth to ISPs sharing backbone networks. By this method, backbone networks can be used effectively as each ISP is able to secure bandwidth according to its own policy. The Internet users can also be expected to receive good services, as it enables them to obtain information about all ISPs, such as the access fee and QoS (quality of service) provided, and to select congenial ISPs from among all ISPs according to this information. In this study, we compare a dynamic bandwidth allocation service with a leased line service (fixed allocation of bandwidth to ISPs) by using the users' utility to estimate the effectiveness of the proposed method.

A fully on-chip open-drain CMOS output driver was designed for high bandwidth DRAMs, such that its output voltage swing was insensitive to the variations of temperature and supply voltage. An auto refresh signal was used to update the contents of the current control register, which determined the transistors to be turned-on among the six binary-weighted transistors of an output driver. Because the auto refresh signal is available in DRAM chips, the output driver of this work does not require any external signals to update the current control register. During the time interval while the update is in progress, a negative feedback loop is formed to maintain the low level output voltage (VOL) to be equal to the reference voltage (VOL.ref) which is generated by a low-voltage bandgap reference circuit. Test results showed the successful operation at the data rate up to 1 Gb/s. The worst-case variations of VOL.ref and VOL of the proposed output driver were measured to be 2.5% and 7.5% respectively within a temperature range of 20 to 90 and a supply voltage range of 2.25 V to 2.75 V, while the worst-case variation of VOL of the conventional output driver was measured to be 24% within the same ranges of temperature and supply voltage.

The provisioning of QoS in the Internet is gaining an increasing attention, thus the importance of methods capable of estimating the bandwidth requirement of traffic flows is constantly growing. This information can be used for a wide range of purposes. Admission control, QoS routing and load sharing all need the same basic information in order to be able to make decisions. This paper describes a number of methods that can be used to arrive at precise estimates of the bandwidth requirement focusing on those that are based on the theory of large deviations. A methodology is presented that allows the reformulation of earlier solutions based on the estimation of some form of an overflow probability so that their output becomes a bandwidth-type quantity, the format preferred by Internet control applications. The methodology provides two tracks for the conversion: an indirect method that encapsulates the overflow probability-type approach as an embedded calculation and a direct method that immediately results in the estimate of the bandwidth requirement. The paper introduces a novel method for the direct computation of the bandwidth requirement of Internet traffic flows using the many sources asymptotic regime of the large deviation theory. The direct bandwidth estimator method reduces the computational complexity of the calculations, since it results directly in the bandwidth requirement, allowing the omission of the frequent and costly computation of the buffer overflow probability. The savings arising from the reduction in computational complexity are demonstrated in a numerical example.

In this paper we addresses the problem of finding feasible solutions for the Group Multicast Routing Problem (GMRP). This problem is a generalization of the multicast routing problem whereby every member of the group is allowed to multicast messages to other members from the same group. The routing problem involves the construction of a set of low cost multicast trees with bandwidth requirements for all the group members in the network. We first prove that the problem of finding feasible solutions to GMRP is NP-complete. Following that we propose a new heuristic algorithm for constructing feasible solutions for GMRP. Simulation results show that our proposed algorithm is able to achieve good performance in terms of its ability of finding feasible solutions whenever one exist.

Grouping multiple voice frames into a single IP packet ("frame grouping") is a commonly mentioned approach to saving bandwidth in IP telephony. But little is known as to when, how, and how much frame grouping should be done in Internet environment. This paper explores the feasibility and the methods of frame grouping based on Internet delay measurement. Specifically, we propose an adaptive frame grouping method that minimizes the delay violation while reducing the bandwidth usage by as much as a factor of two under real Internet delay fluctuations. The performance of the method is evaluated as it is used against a single voice stream and then against multiple voice streams.

Surging capacity demand triggered by the increasingly mobile-oriented and exponentially growing Internet has accelerated convergence of networking technologies. In the core network side, IP and photonics have been the two key driving factors of technical innovations. Amid this technical turmoil, Generalized MPLS (GMPLS) in IETF has recently attracted sizable attentions, as it offers potential for "Grand Unification Theory" for network technology convergence. Despite its prospects, however, the proposal is still missing comparable structures in management plane, which is in dire need for carrier-class, reliable operations. Among many industry proposals and standards, TINA vision on connection management architecture (CMA) is the one offering practical and deployable architecture for the converged photonic IP network. TINA IP Control and Management (IPCM) WG was established during TINA phase II (1998-2000), to study IP control and management issues using the architecture basis of TINA-CMA. Latest activities in TINA IPCM WG, compiling experience at Sprint, Telia, Telecom Italia Lab., and Fujitsu, have resulted in a specification for connectivity provider reference points, namely ConS, ConC, and FCon. Use of TINA CMA as building blocks for the IP photonic network convergence is illustrated. An overview of a ConS reference point specification for managed IP connectivity service, named ConS-IPCM, is explained.

Recently, demand on class-of-service (CoS) has known a great increase thanks to a set of real-time applications such as Internet Telephony service. Class-Based Queuing (CBQ) is considered as an efficient queuing mechanism to guarantee CoS. ALTQ is a widely used platform for realizing CBQ. In this paper, we verify through experiments that bandwidth control of CBQ/ALTQ contains overhead for fluctuating traffic. To avoid such an overhead, we introduce dynamic bandwidth allocation scheme for real-time traffic fluctuating within fixed ranges. In the light of the limited network resources, it quickly becomes obvious that when the traffic rate exceeds the maximum available bandwidth, arriving packets will be accumulated in the router queue. As a result, the traffic delay increases and the quality of real-time applications is degraded. To cope with such a problem, we revise the RED algorithm for a large amount of traffic and propose a new packet discard algorithm that uses bandwidth as a trigger. Experiment results show that our proposal outperforms the already existing packet discard algorithms (RED, DropTail) in providing lower delay/jitter services. We show the efficiency of our proposal using a real system.

The IETF Differentiated Services (DiffServ) framework achieves scalability by (1) aggregating traffic flows with coarse grain QoS on the data plane, and (2) allocating network resources with a bandwidth broker (BB) on the control plane. However, there are many issues that need to be addressed under such framework. First, it has been shown that the concatenation of strict priority (SP) scheduler of class-based queues (CBQ) can cause delay jitter unbounded under certain utilization, which is not acceptable to support the premium service (PS). Furthermore, it is not clear how such a DiffServ network can support traffic flows requiring the guaranteed service (GS), which is a desirable feature of the future Internet. This paper presents architecture and mechanisms to support multiple QoS under the DiffServ paradigm. On the data plane, we present a node architecture based on the virtual time reference system (VTRS). The key building block of our node architecture is the core-stateless virtual clock (CSVC) scheduling algorithm, which, in terms of providing delay guarantee, has the same expressive power as a stateful weighted fair queueing (WFQ) scheduler. With the CSVC scheduler as our building block, we design a node architecture that is capable of supporting integrated transport of the GS, the PS, the assured service (AS), and the traditional best effort (BE) service. On the control plane, we present a BB architecture to provide flexible resource allocation and QoS provisioning. Simulation results demonstrate that our architecture and mechanisms can provide scalable and flexible transport of integrated traffic of the GS, the PS, the AS, and the BE services.