Browsing by Author "Chen, Hsiao-Wei"

Now showing 1 - 2 of 2

A flexible public cloud based testing service for heterogeneous testing targets
(2014)
Hsieh, Sheng-Jen
;
Luo, Guo-Heng
;
Yuan, Shyan-Ming
;
Chen, Hsiao-Wei
;
資訊工程學系
To guarantee quality of the service, services need to be tested to ensure the service quality. But most of existing testing service can\'t provide multi-type testing and deploy testing clients concurrently in different regions. To overcome these problems, in this paper, a cloud testing service combine cloud computing and multi-testing tools is proposed. Using the proposed service user can deploy the testing clients in different countries to access the testing targets, when the testing is finish user can easily get both of detail and summarized test results. To show the capabilities of proposed service, an experiment is performed. The results shows that the proposed service can guarantee testing quality, automatically deploy testing clients concurrently in different region, get latency from different countries, and perform press testing.
A Rearrangement Algorithm for Scheduled Automatic Power Save Delivery of Wireless LANs
(2010)
Lee, Tsern-Huei
;
Hsieh, Jing-Rong
;
Chen, Hsiao-Wei
;
傳播研究所
;
Institute of Communication Studies
One of the major challenges to integrate the wireless LAN technology into portable devices is the limited battery life. The IEEE 802.11e introduced an advanced architecture to improve 802.11 power saving mechanism, named Scheduled Automatic Power Save Delivery (S-APSD). In S-APSD, the access point negotiates periodical schedules with wireless Stations (STA) to deliver buffered traffic and thus prevents the need to poll for each frame by STAs. In S-APSD, in order to reduce wastage of energy, the AP has to avoid overlapping of Service Periods (SPs). Based on existing scheduled events (SEs), the OAS-APSD (Overlapping Aware S-APSD) and LCS-APSD (Low Complexity S-APSD) were proposed to incrementally select the Service Start Times (SSTs) for the new joining traffic streams (TSs) to minimize the chance of SP overlapping. However, in this scheduling fashion, the resulted power saving performance depends on the joining order of TSs and thus may be unsatisfactory. Therefore, our idea is to rearrange the relative offsets of existing SEs to enlarge the system minimum distance. From numerical results, we find that the proposed scheduling algorithms can provide better power saving.