<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

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

Has files: NoSubject: search.filters.subject.congestion control

Search Results

Now showing 1 - 8 of 8
  • Thumbnail Image
    Item type:Item,
    Congestion Control for Machine-Type Communications in LTE-A Networks
    (2016-01-01)
    Chang, Chia-Wei
    ;
    Lin, Yi-Hao
    ;
    Ren, Yi
    ;
    Chen, Jyh-Cheng
    ;
    資訊工程學系
    Collecting data from a tremendous amount of Internet-of-Things (IoT) devices for next generation networks is a big challenge. A large number of devices may lead to severe congestion in Radio Access Network (RAN) and Core Network (CN). 3GPP has specified several mechanisms to handle the congestion caused by massive amounts of devices. However, detailed settings and strategies of them are not defined in the standards and are left for operators. In this paper, we propose two congestion control algorithms which efficiently reduce the congestion. Simulation results demonstrate that the proposed algorithms can achieve 20 similar to 40% improvement regarding accept ratio, overload degree and waiting time compared with those in LTE-A.
  • Thumbnail Image
    Item type:Item,
    A Fuzzy Inter-Ring Route Control with PRNN Predictor Bridged Resilient Packet Rings
    (2010)
    Tang, Wen-Shiang
    ;
    Chang, Chung-Ju
    ;
    電機工程學系
    ;
    Department of Electrical and Computer Engineering
    In this paper, we propose an intelligent inter-ring route control, called fuzzy inter-ring route control with PRNN predictor (FIRC-P), for the bridged resilient packet rings (BRPR). The FIRC-P contains three functional blocks implemented by fuzzy logic systems or pipeline recurrent neural networks (PRNN): fuzzy bridge-node congestion indicator (FBCI), PRNN downstream-node fairness predictor (PDFP), and fuzzy route controller (FRC). The determination of the FIRC-P is based on the load balancing principle, in which the CW or CCW ringlet with lower congestion degree and higher service rate will be chosen. Simulation results show that the FIRC-P improves the performance by about 10% and 220% in packet dropping probability, by about 13% and 18% in average packet delay, and by about 6% and 19% in throughput over the queue length threshold route controller (QTRC) and the shortest path route controller (SPRC), respectively.
  • Thumbnail Image
    Item type:Item,
    RedVegas: Performance improvement of TCP Vegas over heterogeneous networks
    (2004-07-01)
    Chan, YC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Current IP network has become the dominant paradigm for all networking environments. The significant cause of packet losses in such heterogenous networks is no longer limited to network congestion. Traditional TCP interprets every packet loss as caused by congestion which may be not the case in the current Internet. Misinterpretation of wireless random loss as an indication of network congestion results in TCP slowing down its sending rate unnecessarily. In this paper, we propose a new variant of TCP Vegas named RedVegas. By using the innate nature of Vegas and congestion indications marked by routers, RedVegas may detect random packet losses precisely. Through the packet loss differentiation, RedVegas reacts appropriately to the losses, and therefore the throughput of connection over heterogeneous networks can be significantly improved.
  • Thumbnail Image
    Item type:Item,
    A Fast-Converging TCP-Equivalent Window-Averaging Rate Control Scheme
    (2012)
    Tsao, Shih-Chiang
    ;
    Lai, Yuan-Cheng
    ;
    Lin, Ying-Dar
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Smooth rate control schemes are necessary for Internet streaming flows to use available bandwidth. To equally share the Internet bandwidth with existing Transmission Control Protocol (TCP) flows, these new schemes should meet TCP-equivalent criterion, i.e., achieve the same transmission rates as TCP under the same network conditions. However, when the available bandwidth oscillates, many of these schemes fail to meet this criterion due to their slow increasing rate. This study proposes a window-averaging rate control (WARC) scheme to send packets at the same average rate as a TCP flow over a fixed time interval. Considering the TCP rate only over a fixed interval allows WARC to forget the historical loss condition more rapidly than other schemes, thus achieving a faster increasing rate when additional bandwidth becomes available. When the available bandwidth drops dramatically, WARC uses a history-reset procedure to converge its rate to the new steady rate immediately after a specified number of losses. The simulations in this study show that WARC not only achieves the same bandwidth as TCP, but exhibits faster convergent behaviors and has a smoother rate than existing schemes.
  • Thumbnail Image
    Item type:Item,
    Performance enhancement of XCP for high bandwidth-delay product networks
    (2005)
    Yang, YR
    ;
    Chan, CT
    ;
    Wang, PC
    ;
    Chen, YC
    ;
    資訊工程學系
    It has been demonstrated that as the per-flow product of bandwidth delay increases, TCP becomes inefficient and unstable, regardless of the queuing discipline. By decoupling utilization control from fairness control, the eXplicit Control Protocol (XCP) outperforms TCP in both conventional and high bandwidth-delay environments. In this article,. we present an efficient flow control scheme based on XCP for high bandwidth-delay product networks. It can shorten the response time and improve the performance of XCP. Simulation results show the effectiveness of our proposed scheme in several performance aspects. Moreover, its implementation is simple enough to fulfill the required criteria of high bandwidth-delay product networks.
  • Thumbnail Image
    Item type:Item,
    Smart window adjustment for XCP's congestion management
    (2006)
    Yang, YR
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    Chan, YC
    ;
    資訊工程學系
    In the large bandwidth-delay product (BDP) networks, it has been demonstrated that the eXplicit Control Protocol, XCP, outperforms TCP and remains efficient, fair, and stable. However, once a packet drop is detected, an XCP's congestion management should follow TCP's Van Jacobson congestion control. In other words, congestion window should be halved and the fast retransmission/fast recovery, congestion avoidance algorithms should be applied. In the mean time, congestion window should be reduced by the value of the negative feedback. In this article, we present a smart window adjustment scheme for XCP's congestion management to shorten the response time and improve network performance.
  • 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.
  • Thumbnail Image
    Item type:Item,
    Cross-layer routing for congestion control in wireless sensor networks
    (2008)
    Hsu, Yu-Pin
    ;
    Feng, Kai-Ten
    ;
    電信工程研究所
    ;
    Institute of Communications Engineering
    Techniques for improving the network congestion have been proposed in different fields. In recent year, the congestion control problems were studied to enhance the routing performance for wireless sensor networks. In this paper, an Adaptive NAV-Assisted Routing (ANAR) algorithm is proposed to improve the network congestion with a crosslayer approach. The NAV vectors obtained from the RTS/CTS packets are utilized for the determination of the channel status around a sensor node. The routing path is selected based on the congestion-free probability along the route for the transmission of data packets. Moreover, the adaptive path-switching scheme further enhances the routing performance of the proposed ANAR algorithm. The effectiveness of the ANAR protocol is illustrated via the simulations. Without consuming excessive power for each sensor node, the ANAR algorithm can achieve better performance comparing with other existing schemes, especially under the scenarios with network congestion.