An adaptive service framework is expected to support real-time multimedia services in wirless/mobile cellular networks with various classes of traffic and diverse bandwidth requirements. Quality of service (QoS) provisioning in an adaptive framework is another challenging consideration, such as quantifying the level of bandwidth degradation of an ongoing calls and guaranteeing stable QoS levels. Considering both the period and the depth of degradation, the degradation area ratio (DAR) represents the average ratio of a call's degradation and is one of the meaningful measures for adaptive service in call level analysis. In this paper, analytical models for estimating the DAR and finding the optimal control parameters are presented in multi-class traffic call management situations. In complete partitioning capacity based threshold-type call admission control (CAC), a one-dimensional Markov chain with an absorbing state is proposed for estimating the DAR in each traffic class. We formulate a two-leveled optimization problem minimizing the total blocking probabilities subject to QoS requirements and present the procedures required in finding the optimal capacities and threshold values by using modified dynamic programming. In complete sharing capacity based threshold-type CAC, the multidimensional Markov model is approximately reduced to a one-dimensional model in order to reduce complexity and hence calculation time. The reduced model is compared with multidimensional Markov model in numerical examples. The optimization problem is formulated minimizing the total blocking probabilities subject to QoS requirements and the optimal threshold parameters are found by using a genetic algorithm. Performance of two adopted admission policies in adaptive framework situations is illustrated by numerical results.

The conventional decentralized supervisory control architectures for discrete event systems assume that default control of controllable events is static. In this paper, we propose a new decentralized supervisory control architecture using dynamic default control of controllable events. We present necessary and sufficient conditions for the existence of a decentralized supervisor in the proposed architecture. Then, we give an example of a language that is achieved in the proposed architecture, but not in the conventional architectures using static default control.

In order to simultaneously combat both of the inter-carrier interferences (ICIs) and multiple access interferences (MAIs) to achieve reliable performance in multi-carrier code division multiple access (MC-CDMA) systems, this letter proposes a maximum likelihood based scheme for joint frequency offset estimation and multiuser symbol detection. To reduce the computational complexity called for by the joint decision statistic without extra mechanisms, the genetic algorithm (GA) is employed to solve the nonlinear optimization involved. Due to the robustness of the GA, the joint decision statistic can be efficiently solved, and, as shown by furnished simulation results, the proposed approach can offer satisfactory performance in various scenarios.

Timing optimization is an important goal of global routing in deep submicron era. To guarantee the timing performance of the circuit, merely adopting topology optimization becomes inadequate. In this paper, we present an efficient timing-driven global routing algorithm with buffer insertion. Our approach is capable of applying topological-based timing optimization and buffer insertion simultaneously with routablity considerations. Compared with previous works, we efficiently solve the timing issues under a limited buffer usage. The experimental results have demonstrated significant delay improvement within short runtime with very small number of buffers inserted.

A recursive quadratic programming (RQP) approach is proposed for multiuser detection in multicarrier code-division multiple-access (MC-CDMA) systems. In this approach, the combinatorial problem associated with the optimal maximum likelihood (ML) detection is relaxed to a quadratic programming (QP) problem first and then a recursive approach is developed to improve the detection performance. Computer simulations are presented which demonstrate that the detector developed based on the proposed approach offers close-to-optimal symbol-error rate (SER) performance which outperforms several existing suboptimal detectors.

Access selection in future multiple radio access environments is considered in this paper from a new perspective, that of the consumer. A model is proposed for the automatic acquisition of user preferences to assist in access selection decision making. The proposed approach uses a two-level Bayesian C-Metanetwork that models individual user preferences in terms of affordable cost, acceptable level of quality of service and reputation of the access networks. User preferences under different contexts, such as leisure and business, are also considered. The model also adapts to the change of user preferences over time. A simulator has been developed to evaluate the proposed model and the simulation results are promising in terms of the proportion of correct preference predictions after a small number of training samples.

Recently, Juang proposed an efficient password authenticated key agreement scheme using smart cards for the multi-server architecture. Juang's scheme was intended to provide mutual authentication and session key agreement. Herein, we show that Juang's scheme is vulnerable to a privileged insider's attack and is not easily reparable. Furthermore, it does not provide forward secrecy and the user eviction mechanism.

This paper presents a Fault-Tolerant Object Group (FTOG) model that provides the group management service and the fault-tolerance service for consistency maintenance and state transparency. Through Intelligent Home Network Simulator, we verify that FTOG model supports both of reliability and the stability of the distributed system.

In this paper, we address how to efficiently support differentiated services with the optimized bandwidth reservation in a polling-based generalized TDMA network like E-PON (Ethernet Passive Optical Network). In E-PON, performances of service differentiation for QoS (Quality of Service) guaranteed multiples services are directly affected by the bandwidth reservation algorithm of ONU (Optical Network Unit) in addition to the priority-based packet scheduling. Our proposed Service Quality Pre-engagement (SQP) algorithm reduces the system buffer size, the light-load penalty problem and the service interference among classes effectively by partially introducing the dynamic forward recurrence reservation scheme for QoS guaranteed classes. We also introduce the FRC(Forward Reservation Class) Selection algorithm that preserves the optimized reservation bandwidth to minimize the unnecessary reservation contentions. These algorithms do not mandate the basic concept of DBA and request the similar amount of REPORT bandwidth. The analytic and simulation results are performed to evaluate the performances of the proposed algorithms.

In this paper, we propose a single-user strategy for demodulating asynchronous direct-sequence code-division multiple access (DS/CDMA) signals for improving the performance of the adaptive receiver in fast fading channels. Since the adaptive receiver depends on the channel coefficient of all users, it cannot be implemented adaptively in fading channels due to severe tracking problem. A proposed adaptive receiver based on the modified minimum mean-squared-error (MMSE) criterion is used for solving this problem. By simulation, it is verified that our proposal is a promising method to solve the problem, and the results show that the proposed adaptive receiver has substantially larger capacity than the conventional adaptive receiver in fast fading channels.

IP-over-optical multilayer networks are capable of flexibly dealing with traffic increases and fluctuations because they support both high-speed transmission using lightpaths and scalable IP hop-by-hop transmission. This paper introduces an architecture for quality of service (QoS) control in such networks, based on the differentiated services (DiffServ) concept. The architecture supports both class-based queues and class-based lightpaths to efficiently handle multiple-QoS-class traffic. QoS schemes based on the proposed architecture are categorized into four types according to their traffic-differentiation and transmission mechanisms. Through simulation, the schemes are evaluated in terms of measures that largely determines network costs. Finally, the conditions under which each scheme is feasible are clarified in terms of the traffic volume and the cost of class-based queues for DiffServ.

We study the impact of incorporating handoff prediction information in the session admission control process in mobile cellular networks. We evaluate the performance of optimal policies obtained with and without the predictive information, while taking into account possible prediction errors. Two different approaches to compute the optimal admission policy were studied: dynamic programming and reinforcement learning. Numerical results show significant performance gains when the predictive information is used in the admission process.

We propose an accurate and efficient model of having an unbalanced differential line structure, where mode-conversion and frequency dependent loss effects are considered in above the GHz frequency range. To extract model parameters of the proposed unbalanced differential line model, we measured s-parameters of test patterns using a 2-port VNA and defined a new type of mixed-mode s-parameter. The model parameters were obtained and are described for various types of the unbalanced differential line structures. Finally, the validity of the proposed model and the model parameters were successfully confirmed by a series of time-domain measurements and a lattice diagram analysis.

The bandwidth explosion ushered in by the popularity of the Internet has spurred the recent acceleration in the development and deployment of equipment supporting packet based broadband services. This coupled with the widespread deployment of WDM based Optical Transport Systems in the core network to satisfy the corresponding increase in capacity demand, has led network planners for tighter coordination between IP and Optical layers to increase reliability, robustness of next generation backbone network. In this paper, we propose a solution known as border model, which is tailored to address deployment concerns associated with GMPLS technology in existing networks. We extend our proposal to include, "Border model based Multi-layer service network architecture," to provide coordinated multi-layer IP and Optical services, for different network design scenarios. Resource Control is an important aspect of multi-layer service networks. This paper examines next generation requirements for resource control, defines resource control architecture and presents some evaluation results for multi-layer recovery techniques in the context of Multi-layer service network based on border model.

In this paper, a multi-Gbps pre-emphasis design methodology and circuits for a 4/2 Pulse Amplitude Modulation (PAM) transmitter of high-speed data serial link over cable are proposed. Theoretically analysis of the total frequency response including pre-emphasis, package, cable loss and termination are first carried out. In order to gain higher data rates without increasing of symbol rate, we use 4 PAM in our system. Then, we propose a pre-emphasis architecture and algorithm that can enlarge the high frequency response so the overall frequency response in the receiver side is uniform within the desired frequency range. The overall circuit is implemented in TSMC 0.18 µm 1P6M 1.8 V CMOS process. A test chip of this transmitter with pre-emphasis, PLL circuit and on-chip termination resistors is implemented by full custom flow to verify the design methodology. The measurement results of 10/5 Gbps (4/2 PAM) are carried out over 5 meter (m) long cable and is in agreement with our analysis and simulation results.

Performance of the minimum mean square error (MMSE) detection is far below that of the maximum likelihood (ML) detection in a multiuser environment and decreases significantly as the number of co-channel users increases. In this paper, we propose a combined MMSE and ML multiuser detection scheme for space-time block coded (STBC) orthogonal frequency division multiplexing (STBC-OFDM) which has improved performance but with low complexity. In particular, we propose a reduced complexity ML post-detection (ML-PDP) scheme which can correct erroneously estimated bits from the outputs of MMSE multiuser detection. The proposed ML-PDP scheme performs sequential search to detect a predefined number of bits with higher probability of error and then uses ML detection to correct them. Upon controlling the number of corrected bits it is possible to balance the system performance with complexity associated with the ML-PDP. We show that significant improvement can be achieved at the cost of only small additional complexity compared with the MMSE multiuser detection.

A detector based on calculation of a posteriori probability is proposed for code acquisition in singleuser direct sequence code division multiple access (DS/CDMA) systems. Available information is used for decision making, unlike conventional methods which only use a part of it. Although this increases the overhead in terms of additional memory and computational complexity, significant performance improvements are achieved. The frame work is extended to multiuser systems and again mean acquisition time/correct acquisition probability performance is superior to the conventional systems although computational complexity is high. An approximate multiuser method with significantly less complexity is also derived.

The recent Internet needs a network structure and traffic engineering that can support various applications requiring differentiated traffic processing and a high quality of service. The extension of the Internet from wired to wireless systems that generate location-dependent and burst errors has made the support of good services more difficult with existing packet scheduling algorithms. Accordingly, this paper proposes a wireless differentiated service packet scheduling (WDSPS) algorithm that can provide reliable and fair services in differentiated wireless internet service networks. As such, the proposed scheduling algorithm solves the HOL blocking problem within a class packet queue that occurs in a wireless network, supports differentiated services for each class defined in a differentiated service network, and facilitates gradual and efficient service compensation not only among classes but also among flows within a class, thereby preventing a monopoly by one class or one flow. Simulations confirmed that the proposed WDSPS scheduling algorithm could provide the required QoS differentiation between classes and enhanced the service throughput under various wireless network conditions.

Ad hoc networks are becoming an interesting research area, as they inherently support unique network applications for the wireless communications in a rugged environment, which requires rapid deployment and is difficult to be provided by an infrastructure network. Many issues need to be addressed for the ad hoc networks. In this paper, we propose an efficient distributed coordination function on the media access control protocol to enhance the power conservation of mobile hosts by using a power control algorithm and the network throughput of an ad hoc network by using an algorithm for simultaneous frame transmissions. Extensive simulation is studied to evaluate the improvement of the proposed method. The results of the simulation exhibit significant improvement to the standard access control protocol. With slight improvement of network throughput, up to 85% of the consumed energy was able to be saved in compared to the standard protocol and up to 7 times of the energy efficiency was enhanced with the proposed method.

The issue of importance of multiuser detection for CDMA-based mobile ad hoc networks is addressed in this paper. For conventional scheme, each terminal in the network uses matched filter to receive packets, so the performance (e.g., throughput) of the network suffers from multi-access interference (MAI). Different from above scheme, in this paper, each terminal of the ad hoc network is equipped with an adaptive blind linear multiuser detector, so the ability of MAI-resistance is gained. Employing slotted-ALOHA protocol in MAC layer and using fully-connected network model, the throughput of ad hoc network is studied. Theoretic analysis and simulation results show that multiuser detection can remarkably improve throughput performance of ad hoc networks.