<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

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

Browse

Filters

2007 - 200912010 - 20152

Settings

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

Author: search.filters.author.Ho, Cheng-YuanHas files: No

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item type:Item,
    A Case Study of Cache Performance in ICN - Various Combinations of Transmission Behavior and Cache Replacement Mechanism
    (2015)
    Ho, Cheng-Yun
    ;
    Ho, Cheng-Yuan
    ;
    Tseng, Chien-Chao
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Information-centric networking (ICN) is suggested by many papers and research projects to improve network performance and enhance network resource efficiency in recent years. Moreover, in these researches, some researchers not only proposed their ideal ICN approaches but also modified the existing cache replacement mechanism to fit their ICN approaches. In this paper, we aim at investigating and quantifying the effect of the cache hit ratio with two kinds of transmission behavior, sequential and un-sequential, and three cache replacement mechanisms, FIFO, LRU, and random, in ICN. We implement several simulations with ndnSIM under NS-3 simulator. The simulation results show that LRU and FIFO are suitable for all networking applications no matter sequential or un-sequential content transmission behavior is used. Besides, the simulation results reveal that the cache hit ratios in LRU and FIFO are same when the experiment settings are with same interest packets sending rate, same experiment time, and sequential content transmission behavior.
  • Thumbnail Image
    Item type:Item,
    Advanced bootstrap and adjusted bandwidth for content distribution in peer-to-peer live streaming
    (2015-05-01)
    Kuo, Jun-Li
    ;
    Shih, Chen-Hua
    ;
    Ho, Cheng-Yuan
    ;
    Chen, Yaw-Chung
    ;
    資訊工程學系
    Today peer-to-peer (P2P) systems have been deployed for various Internet multimedia applications such as live video streaming service. However, both peer churn and upload capacity insufficiency are inherent problems causing long start-up delay and unstable playback quality. Therefore, we introduce a scalable application-layer multicast algorithm, ABCD-P2P, which inherits the short end-to-end delay and low control overhead due to the push delivery scheme. The logical overlay is close to the physical topology (i.e., geographic proximity) in ABCD-P2P, so a short streaming multicast delivery path reduces the number of hops and avoids the network bottleneck or far routing. Both an advanced bootstrap mechanism and an adjusted bandwidth mechanism are suitable for the asymmetric bandwidth network. The mathematical analysis and simulation results demonstrate that our proposed scheme can achieve the goals of high playback smoothness, short start-up delay, short end-to-end delay, low control overhead, and short recovery time.
  • Thumbnail Image
    Item type:Item,
    TCP-Ho: A congestion control algorithm with design and performance evaluation
    (2007-03-01)
    Ho, Cheng-Yuan
    ;
    Chan, Yi-Cheng
    ;
    Chen, Yaw-Chung
    ;
    資訊工程學系
    ;
    Department of Computer Science
    A critical design issue of Transmission Control Protocol (TCP) is its congestion control that allows the protocol to adjust the end-to-end communication rate based on the detection of packet loss. However, TCP congestion control may function poorly during its slow start and congestion avoidance phases. This is because TCP sends bursts of packets with the fast window increase and the ACK-clock based transmission in slow start, and respond slowly with large congestion windows especially in high bandwidth-delay product (BDP) networks during congestion avoidance. In this article, we propose an improved version of TCP, TCP-Ho, that uses an efficient congestion window control algorithm for a TCP source. According to the estimated available bandwidth and measured round-trip times (RTTs), the proposed algorithm adjusts the congestion window size with a rate between exponential growth and linear growth intelligently. Our extensive simulation results show that TCP-Ho significantly improves the performance of connections as well as remaining fair and stable when the BDP increases. Furthermore, it is feasible to implement because only sending part needs to be modified.