Han Seok KIM Eun-Chan PARK Seo Weon HEO
We propose a token-bucket based rate control algorithm that satisfies both maximum and minimum rate constraints with computational complexity of O(1). The proposed algorithm allocates the remaining bandwidth in a strict priority queuing manner to the flows with different priorities and in a weighted fair queuing manner to the flows within the same priority.
Joo-Sang YOUN Seung-Joon SEOK Chul-Hee KANG
This paper presents a new QoS model for end-to-end service provisioning in multi-hop wireless networks. In legacy IEEE 802.11e based multi-hop wireless networks, the fixed assignment of service classes according to flow's priority at every node causes priority inversion problem when performing end-to-end service differentiation. Thus, this paper proposes a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD) to alleviate the problem and support effective service differentiation between end-to-end nodes. Many previous works for QoS model through the 802.11e based service differentiation focus on packet scheduling on several service queues with different service rate and service priority. Our model, however, concentrates on a dynamic class selection scheme, called Per Hop Class Assignment (PHCA), in the node's MAC layer, which selects a proper service class for each packet, in accordance with queue states and service requirement, in every node along the end-to-end route of the packet. The proposed QoS solution is evaluated using the OPNET simulator. The simulation results show that the proposed model outperforms both best-effort and 802.11e based strict priority service models in mobile ad hoc environments.
Te-Yuan HUANG Kuan-Ta CHEN Polly HUANG Chin-Laung LEI
Quantifying user satisfaction is essential, because the results can help service providers deliver better services. In this work, we propose a generalizable methodology, based on survival analysis, to quantify user satisfaction in terms of session times, i.e., the length of time users stay with an application. Unlike subjective human surveys, our methodology is based solely on passive measurement, which is more cost-efficient and better able to capture subconscious reactions. Furthermore, by using session times, rather than a specific performance indicator, such as the level of distortion of voice signals, the effects of other factors like loudness and sidetone, can also be captured by the developed models. Like survival analysis, our methodology is characterized by low complexity and a simple model-developing process. The feasibility of our methodology is demonstrated through case studies of ShenZhou Online, a commercial MMORPG in Taiwan, and the most prevalent VoIP application in the world, namely Skype. Through the model development process, we can also identify the most significant performance factors and their impacts on user satisfaction and discuss how they can be exploited to improve user experience and optimize resource allocation.
Cheon Seog KIM Sung Ho JIN Dong Jun SEO Yong Man RO
In heterogeneous network environments, it is mandatory to measure the grade of the video quality in order to guarantee the optimal quality of the video streaming service. Quality of Service (QoS) has become a key issue for service acceptability and user satisfaction. Although there have been many recent works regarding video quality, most of them have been limited to measuring quality within temporal and Signal-to-Noise Ratio (SNR) scalability. H.264/AVC Scalable Video Coding (SVC) has emerged and has been developed to support full scalability. This includes spatial, temporal, and SNR scalability, each of which shows different visual effects. The aim of this paper is to define and develop a novel video quality metric allowing full scalability. It focuses on the effect of frame rate, SNR, the change of spatial resolution, and motion characteristics using subjective quality assessment. Experimental results show the proposed quality metric has a high correlation to subjective quality and that it is useful in determining the video quality of SVC.
Warakorn SRICHAVENGSUP Akkarapat CHAROENPANICHKIT Lunchakorn WUTTISITTIKULKIJ
This paper considers the problem of contention resolution algorithm for multi-class with quality of service (QoS) constrained for wireless communication. Five different channel reservation schemes are proposed, namely, UNI+MLA, UNI+DS, UNI+DS+MLA, Partial UNI and Partial UNI+MLA schemes for multimedia traffic, all are extensions of our recently proposed UNI scheme for single-class traffic. The goal is to achieve the highest system performance and enable each traffic type to meet its QoS requirements. We evaluate the performance of each scheme by mathematical analysis. The numerical results show that our proposed schemes are effective in enabling each traffic type to achieve the best successful rate possible in this kind of environment. Finally when comparing between our proposed schemes and conventional technique in terms of both throughput performance and QoS requirements it is found that the UNI+MLA, UNI+DS+MLA and Partial UNI+MLA schemes are relatively efficient and suitable for practical applications.
Christian HOAREAU Ichiro SATOH
We present a model checking approach to the rationale, implementation, and applications of a query language for location-based services. Such query mechanisms are necessary so that users, objects, and/or services can effectively benefit from the location-awareness of their surrounding environment. The underlying data model is founded on a symbolic model of space organized in a tree structure. Once extended to a semantic model for modal logic, we regard location query processing as a model checking problem, and thus define location queries as hybrid logic-based formulas. Our approach is unique to existing research because it explores the connection between location models and query processing in ubiquitous computing systems, relies on a sound theoretical basis, and provides modal logic-based query mechanisms for expressive searches over a decentralized data structure. A prototype implementation is also presented and will be discussed.
Sang-Wook KIM Jinho KIM Sanghyun PARK
Similarity search in time-series databases finds such data sequences whose changing patterns are similar to that of a query sequence. For efficient processing, it normally employs a multi-dimensional index. In order to alleviate the well-known dimensionality curse, the previous methods for similarity search apply the Discrete Fourier Transform (DFT) to data sequences, and take only the first two or three DFT coefficients as organizing attributes. Other than this ad-hoc approach, there have been no research efforts on devising a systematic guideline for choosing the best organizing attributes. This paper first points out the problems occurring in the previous methods, and proposes a novel solution to construct optimal multi-dimensional indexes. The proposed method analyzes the characteristics of a target time-series database, and identifies the organizing attributes having the best discrimination power. It also determines the optimal number of organizing attributes for efficient similarity search by using a cost model. Through a series of experiments, we show that the proposed method outperforms the previous ones significantly.
The problem of joint orthogonal precoding and user scheduling in a multi-user multi-input multi-output (MU-MIMO) downlink system is considered. Based on the theoretics of subspace and vector projection, a novel orthogonal precoding matrix is designed to achieve high sum-rate capacity with low to moderate number of active users and in low SNR regions. With respect to sum-rate capacity, numerical simulations show that the proposed algorithm outperforms the zero-forcing beam-forming (ZFBF) and linear orthogonal beam-forming (OLBF).
Tae Ok KIM Kyung Jae KIM Bong Dae CHOI
We analyze the MAC performance of the IEEE 802.11 DCF and 802.11e EDCA in non-saturation condition where device does not have packets to transmit sometimes. We assume that a flow is not generated while the previous flow is in service and the number of packets in a flow is geometrically distributed. In this paper, we take into account the feature of non-saturation condition in standards: possibility of transmission performed without preceding backoff procedure for the first packet arriving at the idle station. Our approach is to model a stochastic behavior of one station as a discrete time Markov chain. We obtain four performance measures: normalized channel throughput, average packet HoL (head of line) delay, expected time to complete transmission of a flow and packet loss probability. Our results can be used for admission control to find the optimal number of stations with some constraints on these measures.
In MC-CDMA systems, subcarriers can be shared by different users. In this letter, we exploit the shared nature of subcarriers and propose a user grouping and subcarrier allocation algorithm for grouped MC-CDMA systems. The scheme aims at maximizing the total system throughput while providing bandwidth-fairness among groups. Simulation results are given to demonstrate the performance of the proposed algorithm in terms of sum capacity and per-user throughput.
In order to achieve the prioritized quality of service (QoS) guarantee, the IEEE 802.11e EDCAF (the enhanced distributed channel access function) provides the distinguished services by configuring the different QoS parameters to different access categories (ACs). An admission control scheme is needed to maximize the utilization of wireless channel. Most of papers study throughput improvement by solving the complicated multidimensional Markov-chain model. In this paper, we introduce a backoff model to study the transmission probability of the different arbitration interframe space number (AIFSN) and the minimum contention window size (CWmin). We propose an adaptive control scheme (ACS) to dynamically update AIFSN and CWmin based on the periodical monitoring of current channel status and QoS requirements to achieve the specific service differentiation at access points (AP). This paper provides an effective tuning mechanism for improving QoS in WLAN. Analytical and simulation results show that the proposed scheme outperforms the basic EDCAF in terms of throughput and service differentiation especially at high collision rate.
This letter presents a race-free mixed serial-parallel comparison (RFMSPC) scheme which uses both serial and parallel CAMs in a match line. A self-reset search line scheme for the serial CAM is proposed to avoid the timing race problem and additional timing penalties. Various 32 entry CAMs are designed using 90 nm 1.2 V CMOS process to verify the proposed RFMSPC scheme. It shows that the RFMSPC saves power consumption by 40%, 53% and 63% at the cost of a 4%, 6% and 16% increase in search time according to 1, 2, and 4 serial CAM bits in a match line.
Akira FUJIMAKI Masamitsu TANAKA Takahiro YAMADA Yuki YAMANASHI Heejoung PARK Nobuyuki YOSHIKAWA
We describe the development of single-flux-quantum (SFQ) microprocessors and the related technologies such as designing, circuit architecture, microarchitecture, etc. Since the microprocessors studied here aim for a general-purpose computing system, we employ the complexity-reduced (CORE) architecture in which the high-speed nature of the SFQ circuits is used not for increasing processor performance but for reducing the circuit complexity. The bit-serial processing is the most suitable way to realize the CORE architecture. We assembled all the best technologies concerning SFQ integrated circuits and designed the SFQ microprocessors, CORE1α, CORE1β, and CORE1γ. The CORE1β was made up of about 11000 Josephson junctions and successfully demonstrated. The peak performance reached 1400 million operations per second with a power consumption of 3.4 mW. We showed that the SFQ microprocessors had an advantage in a performance density to semiconductor's ones, which lead to the potential for constructing a high performance SFQ-circuit-based computing system.
Ultra fast switching speed of superconducting digital circuits enable realization of Digital Signal Processors with performance unattainable by any other technology. Based on rapid-single-flux technology (RSFQ) logic, these integrated circuits are capable of delivering high computation capacity up to 30 GOPS on a single processor and very short latency of 0.1 ns. There are two main applications of such hardware for practical telecommunication systems: filters for superconducting ADCs operating with digital RF data and recursive filters at baseband. The later of these allows functions such as multiuser detection for 3G WCDMA, equalization and channel precoding for 4G OFDM MIMO, and general blind detection. The performance gain is an increase in the cell capacity, quality of service, and transmitted data rate. The current status of the development of the RSFQ baseband DSP is discussed. Major components with operating speed of 30 GHz have been developed. Designs, test results, and future development of the complete systems including cryopackaging and CMOS interface are reviewed.
Hai-Han LU Wen-Jeng HO Wen-I LIN Hsiang-Chun PENG Po-Chou LAI Hoshin YEE
A radio-on-dense-wavelength-division-multiplexing (DWDM) transport system based on injection-locked Fabry-Perot laser diodes (FP LDs) with four microwave carriers and large effective area fiber (LEAF) transmission was proposed and demonstrated. Good performance of bit error rate (BER) and intermodulation distortion to carrier ratio (IMD/C) over a-50 km of LEAF was obtained. Signal quality meets the demands of personal handy system (PHS)/vehicle information and communication system (VICS)/electronic toll collection (ETC)/satellite broadcasting (SB).
We investigate the MIMO broadcast channels with imperfect channel knowledge due to estimation error and much more users than transmit antennas to exploit multiuser diversity. The channel estimation error causes the interference among users, resulting in the sum-rate loss. A tight upper bound of this sum-rate loss based on zeroforcing beamforming is derived theoretically. This bound only depends on the channel estimation quality and transmit antenna number, but not on the user number. Based on this upper bound, we show this system maintains full multiuser diversity, and always benefits from the increasing transmit power.
Huan SUN Xinyu WANG Xiaohu YOU
In this paper, a novel user scheduling algorithm for maximizing the sum-rate capacity of inhomogeneous network is investigated. In order to extract the multi-user diversity order and reduce the feedback quantity, selective feedback scheme is adopted. An algorithm of key parameter, the prescribed threshold, is proposed. Numerical simulations show that when adopted the proposed threshold in the inhomogeneous networks, selective feedback scheme can still preserve the majority of the sum-rate capacity of the full back scheme, while the feedback load is significantly reduced.
Masayuki UEDA Takuji TACHIBANA Shoji KASAHARA
In optical burst switching (OBS) networks, burst with different numbers of hops experience unfairness in terms of the burst loss probability. In this paper, we propose a preemptive scheme based on the number of transit hops in OBS networks. In our proposed scheme, preemption is performed with two thresholds; one is for the total number of hops of a burst and the other is for the number of transit hops the burst has passed through. We evaluate the performance of the scheme by simulation, and numerical examples show that the proposed scheme improves the fairness among the bursts with different numbers of hops, keeping the overall burst loss probability the same as that for the conventional OBS transmission without preemption.
Myoungju YU Jongmin LEE Tai-Won UM Won RYU Byung Sun LEE Seong Gon CHOI
We propose a new mobility management scheme using Label Switched Path (LSP) of Multi Protocol Label Switching (MPLS) for seamless service in Broadband Convergence Network (BcN) in Korea, and verify that the proposed scheme has lower latency time than the existing ones through the separation of control plane from data plane for handover signaling.
With the rapid advances in wireless network communication, multimedia presentation has become more applicable. However, due to the limited wireless network resource and the mobility of Mobile Host (MH), QoS for wireless streaming is much more difficult to maintain. How to decrease Call Dropping Probability (CDP) in multimedia traffic while still keeping acceptable Call Block Probability (CBP) without sacrificing QoS has become an significant issue in providing wireless streaming services. In this paper, we propose a novel Dynamic Resources Adjustment (DRA) algorithm, which can dynamically borrow idle reserved resources in the serving cell or the target cell for handoffing MHs to compensate the shortage of bandwidth in media streaming. The experimental simulation results show that compared with traditional No Reservation (NR), and Resource Reservation in the six neighboring cells (RR-nb), and Resource Reservation in the target cell(RR-t), our proposed DRA algorithm can fully utilize unused reserved resources to effectively decrease the CDP while still keeping acceptable CBP with high bandwidth utilization.