學術出版;;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 11

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.
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.
The traffic conditioner with promotion and fairness guarantee schemes for DiffServ networks
(2003)
Chang, CJ
;
Cheng, YH
;
Lin, LF
;
電信工程研究所
;
Institute of Communications Engineering
In this paper, we propose a traffic conditioner with promotion and fairness guarantee (TC_PFG) schemes to amend the inappropriate marking by conventional traffic conditioners. The TC_PFG is based on the Two Rate Three Color Marker (TRTCM) scheme. It can allocate appropriate bandwidth to micro-flows to reduce the unfair distribution among micro-flows and improve the utilization by allowing promotion of packets when there is available bandwidth. Simulation results show that TC_PFG outperforms TRTCM; the former achieve higher fairness among micro-flows and better throughput than the latter.
Practical design considerations for next generation high-speed data wireless systems
(2003)
Huang, CY
;
Su, HY
;
電機學院
;
College of Electrical and Computer Engineering
In a high-speed wireless data system, based on a bias treatment (through a scheduler control.) on good RF-condition users, the system could potentially reach high throughput if good RF users have the infinite data to send. But, in reality, most data applications have only finite sizes. With this finite-size constraint, users at poor RE conditions will occupy more timing resources than good RF users to finish the transmission of a data packet call. As a result, we will show analytically that to improve system performance, scheduler algorithms not only should focus on allocating more resources to good RF users but also need to improve low data rate users at the same time. Based on the 1xEV-DO technology, two scheduler design concepts are used to evaluate the impacts on the system throughput for both the infinite data buffer case and the finite data buffer case.
Schedulers for 1xEV-DO: Third generation wireless high-speed data systems
(2003)
Huang, CY
;
Su, HY
;
Vitebsky, S
;
Chen, PC
;
交大名義發表
Scheduling algorithms have been developed and proposed to improve system performance by taking the benefit of channel variance among users. When the optimization of the system throughput is the main objective for scheduler algorithm designs, the associated algorithms might cause unfairness in user transmission rates. To explore the fairness problem, in this paper, we will focus on the fairness performance by considering different scheduling algorithms in various fading channels. The Dynamic Target with Max/Min (DTM) Rate Controlled Scheduler Algorithm is proposed to resolve the potential fairness problems and to maintain the minimum transmission rate for all uses in which we believe that most applications require the minimum rate to maintain the application quality. The DTM algorithm includes also the maximum rate control to prevent the resource hogging from users at the good RF conditions.
Adaptive scheduler algorithm for multi-criterion designs in B3G wireless systems
(2004)
Fan, YL
;
Huang, CY
;
電機學院
;
College of Electrical and Computer Engineering
In this paper, multi-criterion scheduler algorithms are discussed. An adaptive scheduler control algorithm is provided to explore the tradeoff between the system throughput and different user fairness in both the average number of assigned slots and average transmission rates. We will show even though it is difficult to achieve an unique optimum point to satisfy all design criteria, there exists an operator-defined optimality if the priorities of different design criteria are chosen. All performance will be quantified based on 1xEV-DO technologies.

學術出版;;Publications

Browse

Filters

Settings

Sort By

Results per page

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

Search Results