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

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.
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.
Fuzzy/neural congestion control for integrated voice and data DS-CDMA/FRMA cellular networks
(2000-02-01)
Chang, CJ
;
Chen, BW
;
Liu, TY
;
Ren, FC
;
電信工程研究所
The paper proposes congestion control using fuzzy/neural techniques for integrated voice and data direct-sequence code division multiple access/frame reservation multiple access (DS-CDMA/FRMA) cellular networks. The fuzzy/neural congestion controller is constituted by a pipeline recurrent neural network (PRNN) interference predictor, a fuzzy performance indicator, and a fuzzy/neural access probability controller It regulates traffic input to the integrated voice and data DS-CDMA/FRMA cellular system by determining proper access probabilities for users so that congestion can be avoided and throughput can be maximized. Simulation results show that the DS-CDMA/FRMA fuzzy/neural congestion controllers perform better than conventional DS-CDMA/PRMA with channel access function in voice packet dropping ratio, corruption ratio, and utilization. In addition, the neural congestion controller outperforms the fuzzy congestion controller.
TCP with sender-based delay control
(2003-09-01)
Kung, HT
;
Tan, KS
;
Hsiao, PH
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
This paper describes a congestion control method for TCP that adjusts the transmission rate of a TCP connection by changing not only the congestion window size as in normal TCP, but also by delaying the transmission of packets at the sender. We refer to this method as TCP with sender-based delay control, or simply SDC. SDC can keep the window size of a TCP connection above a certain threshold even when its fair share of bandwidth is arbitrarily small. Since TCP fast retransmit and recovery is likely to work when the window size of the connection is sufficiently large, the new method can result in reduced frequency of TCP timeouts for the connection. In particular, SDC allows many TCP flows to share a link without experiencing many timeouts. In addition, SDC can reduce a well-known TCP bias against connections with large RTTs. This paper presents the principle behind SDC, and simulation results demonstrating its properties and advantages. (C) 2003 Elsevier Science B.V. All rights reserved.
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.
RoVegas: a router-based congestion avoidance mechanism for TCP Vegas
(2004-10-15)
Chan, YC
;
Chan, CT
;
Chen, YC
;
資訊工程學系
;
Department of Computer Science
Transmission control protocol (TCP) Vegas detects network congestion in the early stage and successfully prevents periodic packet loss that usually occurs in TCP Reno. It has been demonstrated that TCP Vegas outperforms TCP Reno in many aspects. However, TCP Vegas suffers several problems that inhere in its congestion avoidance mechanism, these include issues of rerouting, persistent congestion, fairness, and network asymmetry. In this paper, we propose a router-based congestion avoidance mechanism (RoVegas) for TCP Vegas. By performing the proposed scheme in routers along the round-trip path, RoVegas can solve the problems of rerouting and persistent congestion, enhance the fairness among the competitive connections, and improve the throughput when congestion occurs on the backward path. Through the results of both analysis and simulation, we demonstrate the elfectiveness of RoVegas. (C) 2004 Elsevier B.V. All rights reserved.
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.
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.
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.
MCR: MAC-assisted congestion-controlled routing for wireless multihop networks
(2012-06-01)
Hsu, Yu-Pin
;
Feng, Kai-Ten
;
電機工程學系
;
Department of Electrical and Computer Engineering
Techniques for improving network congestion have been proposed in different fields. In recent years, the congestion control problems were studied to enhance the routing performance in wireless multihop networks (WMNs). In this paper, the network allocation vector (NAV) introduced by the contention-based medium access control (MAC) protocols is utilized for the determination of the channel status around a wireless node (WN). A MAC-assisted congestion-controlled routing (MCR) algorithm is proposed to alleviate the network congestion problem by adopting the information from the MAC layer. The routing path is selected based on the congestion-free probability along the path for transmitting the data packets. Moreover, the adaptive path-switching scheme and the aggressive hop-reduction (AHR) local repair mechanism further enhance the routing performance of the proposed MCR algorithm. The effectiveness of the MCR protocol is evaluated via both the analytical study and the simulation results. Without consuming excessive control packets for each WN, the MCR algorithm can achieve better performance when compared with other existing schemes, especially under the scenarios with network congestion. Copyright (C) 2010 John Wiley & Sons, Ltd.

學術出版;;Publications

Browse

Filters

Settings

Sort By

Results per page

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

Search Results