學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Search Results

Now showing 1 - 10 of 19

Achieving Large Sum Rate and Good Fairness in MISO Broadcast Communication
(2019-06-01)
Huang, Ji-You
;
Lu, Hsiao-Feng
;
電機工程學系
;
電信工程研究所
;
Department of Electrical and Computer Engineering
Atradeoff between sum rate and fairness for multiple-input single-output (MISO) broadcast communication employing dirty paper coding or zero-forcing dirty paper coding at physical layer is investigated in this paper. The tradeoff is based on a new design objective termed "tri-stage" approach as well as a new l(1)-based fairness measure that is much more robust than the well-known Jain's index for comparing fairness levels achieved by various design objectives at a much finer resolution in high SNR regime. The newly proposed tri-stage design also introduces a new concept of statistical power allocation that randomly allocates power to users based on an optimal probability distribution derived from the tradeoff between sum rate and fairness. Simulation results show that the proposed approach can simultaneously achieve a larger sum rate and better fairness than the reputable proportional fairness criterion. A performance upper bound is also given in the paper to show the excellent performance of the proposed approach at moderate and high SNR regimes as well as some potential for further improvement in low SNR regime.
Multi-operator Fairness in Transparent RAN Sharing
(2018-01-01)
Lin, Ying-Dar
;
Chien, Hsu-Tung
;
Chang, Hsien-Wen
;
Lai, Chia-Lin
;
資訊工程學系
Radio access network (RAN) sharing attracts much attention from telecom operators. However, current mechanisms applied to RAN sharing do not consider fairness among operators such that the RAN is not fairly shared, and either under-or over-utilized. Fairness cannot be guaranteed among operators because resources are distributed on a first-come-first-serve basis. "Soft-partition with Blocking and Dropping" (SBD)" is proposed to offer inter-operator fairness based on a "soft-partition" concept. Subscribers to an operator may overuse the predefined service-level-agreement (SLA) when the shared RAN is under-utilized, but become blocked or even dropped when over-utilized. According to our simulation results, SBD maintains inter-operator fairness at 0.997, even better than hard-partition at 0.98 and much better than no-partition at 0.6. Meanwhile, it retains high utilization of shared RAN at 98%. SBD reduces blocking rate from 35% of hard partition to almost 0%, while controlling dropping rate at 5%.
Scheduler design issues for wireless high-speed data systems
(2004-01-01)
Huang, CY
;
Su, HY
;
電子工程學系及電子研究所
;
Department of Electronics Engineering and Institute of Electronics
To understand the tradeoff between the system throughput and the user fairness, in this paper, two different scheduler design concepts are discussed and evaluated based on the full-buffer data model and finite packet-call-size data model. In finite packet-call-size data model, we will show analytically and by simulation that the system throughput depends on the number of active users and the user's in-slot rates. In order to quantify the impacts, a simulation platform is developed based on IxEV-DO technology.
Multi-Operator Fairness in Transparent RAN Sharing by Soft-Partition With Blocking and Dropping Mechanism
(2018-12-01)
Chien, Hsu-Tung
;
Lin, Ying-Dar
;
Chang, Hsien-Wen
;
Lai, Chia-Lin
;
資訊工程學系
Radio access network (RAN) sharing has attracted significant attention from telecom operators as a means of accommodating data surges. However, current mechanisms for RAN sharing ignore the fairness issue among operators, and hence the RAN may be under- or over-utilized. Furthermore, the fairness among different operators cannot be guaranteed, since the RAN resources are distributed on a first come, first served basis. Accordingly, the present study proposes a "soft-partition with blocking and dropping" (SBD) mechanism that offers inter-operator fairness using a "soft-partition" approach. In particular, the operator subscribers are permitted to overuse the resources specified in the predefined service-level-agreement when the shared RAN is under-utilized, but are blocked (or even dropped) when the RAN is over-utilized. The simulation results show that SBD achieves an inter-operator fairness of 0.997, which is higher than that of both a hard-partition approach (0.98) and a no-partition approach (0.6) while maintaining a shared RAN utilization rate of 98%. Furthermore, SBD reduces the blocking rate from 35% (hard partition approach) to almost 0%, whereas controlling the dropping rate at 5%. Notably, the dropping rate can be reduced to almost 0% using a newly proposed bandwidth scale down procedure.
An Intelligent Priority Resource Allocation Scheme for LTE-A Downlink Systems
(2012-06)
Chung, Wen-Ching
;
Chang, Chung-Ju
;
Wang, Li-Chun
;
電機學院
;
College of Electrical and Computer Engineering
In this paper, we propose an intelligent priority resource allocation (iPRA) scheme for long term evolution-advanced (LTE-A) downlink systems with multimedia traffic. The iPRA scheme intelligently computes priorities for users by using fuzzy inference system so as to enhance system throughput and attain high Jain fairness index while guarantee QoS requirements. Simulation results show that the iPRA scheme can achieve higher system throughput and better QoS requirement guarantee than conventional radio resource allocation schemes in high traffic load, while attains a rather large Jain fairness index.
Pseudo-rate TCP: a congestion avoidance scheme with nearly optimized fairness and throughput
(1999-09-25)
Chen, JR
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
As the bandwidth requirement on the Internet grows, the efficiency of networking protocol becomes an important concern. This paper proposes a so-called pseudo-rate TCP, which features both better fairness and higher throughput than TCP Vegas by exponentially increasing the window size to a derived bound. The pseudo-rate TCP avoids the typical problem that sources with shorter round-trip times always get better chance in allocating the bandwidth. We discuss two key mechanisms designed for pseudo-rate TCP, and compare its performance with TCP Vegas through system simulation. (C) 1999 Elsevier Science B.V. All rights reserved.
Bounded tag fair queueing for broadband packet switching networks
(2000-01-01)
Chen, YJ
;
Lee, SY
;
資訊工程學系
;
Department of Computer Science
Fair Queueing (FQ) is an attractive packet scheduling mechanism, which can establish firewall among packet flows. Thus, the quality of service (QoS) of each flow can be guaranteed. To implement the mechanism, three important performance issues are concerned: fairness, bounded delay, and efficiency. We propose a scheme, named BTFQ, which satisfies the three criteria. The scheme BTFQ + is also proposed to improve the fairness property of BTFQ and is designed to combine with a low-cost, high-speed hardware for reducing computation time. For comparison, we classify some well-known packet scheduling schemes into six classes according to their fairness properties. BTFQ and BTFQ + are excellent in bounded delay and efficiency. Their fairness properties, although a little bit weak, are but still very good if the traffic load is under 95%, according to the simulation results. Because of the tradeoff among the performance issues, BTFQ and BTFQ + provide another good choices. (C) 2000 Elsevier Science B.V. All rights reserved.
Vegas plus: Improving the service fairness
(2000-05-01)
Chen, JR
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
TCP Vegas is a congestion avoidance scheme designed to prevent the periodic packet loss which occurs in traditional schemes. Since Vegas successfully avoids such packet loss, it achieves much higher throughput than TCP Reno. However, it does not concern the fairness among source-destination pairs with different round-trip times (RTT's). In this letter, we propose a different mechanism to adjust the window size, this allows TCP to provide much better fairness regardless the large variation of RTT's.
An end-to-end flow control approach based on round trip time
(2000-09-30)
Chen, JR
;
Chen, YC
;
Lee, CL
;
資訊工程學系
;
Department of Computer Science
Traditional TCP Row control schemes, such as Tahoe and Reno, continuously increase the window size until possible packet loss is detected. These schemes generate congestion unnecessarily by themselves and utilize the buffer space inefficiently. Therefore, Vegas was proposed to accommodate the drawbacks. It uses the measured round-trip time (RTT) to obtain the information required for the flow control. in this work, we propose a Row control scheme, RTT-based TCP, which uses the RTT directly to control the window size adjustment. RTT-based TCP comprises four mechanisms: the modified exponential window increment, the RTT measurement, the queue occupancy estimation, and the quick queue-occupancy reduction. Simulation results show that RTT-based TCP outperforms Vegas in the aspects of throughput, fairness and efficiency of buffer usage. (C) 2000 Elsevier Science B.V. All rights reserved.
Fast mutual exclusion algorithms using read-modify-write and atomic read/write registers
(1998)
Huang, TL
;
資訊工程學系
;
Department of Computer Science
Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocessors. The algorithm is particularly suitable in such systems for applications with small critical sections and frequent resource requests.

學術出版;;Publications

Browse

Filters

Settings

Sort By

Results per page

🏛️國立陽明交通大學機構典藏

Search Results