學術出版;;Publications
Permanent URI for this communityhdl:11536/1
收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作,涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.
Browse
7 results
Search Results
Item type:Item, 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.Item type:Item, TCP with sender-based delay control(2003-09-01) ;Kung, HT ;Tan, KS ;Hsiao, PH ;資訊管理與財務金融系 註:原資管所+財金所Department of Information Management and FinanceThis 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.Item type:Item, RoVegas: a router-based congestion avoidance mechanism for TCP Vegas(2004-10-15) ;Chan, YC ;Chan, CT ;Chen, YC ;資訊工程學系Department of Computer ScienceTransmission 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.Item type:Item, MCR: MAC-assisted congestion-controlled routing for wireless multihop networks(2012-06-01) ;Hsu, Yu-Pin ;Feng, Kai-Ten ;電機工程學系Department of Electrical and Computer EngineeringTechniques 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.Item type:Item, Improving performance of delay-based TCPs with rerouting(2007-01-01) ;Ho, Cheng-Yuan ;Chen, Yaw-Chung ;Ho, Cheng-Yun ;資訊工程學系Department of Computer ScienceDelay-based TCPs detect network congestion in the early stage and successfully prevent periodic packet loss that usually occurs in loss-based mechanisms. It has been demonstrated that delay-based algorithms outperform loss-based schemes in many aspects. However, a delay-based TCP may not prevent unnecessary throughput degradation when rerouting occurs and in mobile IP networks and mobile ad hoe networks because it could not differentiate whether the increased RTT is due to route change or network congestion. This work investigates how to improve the performance of delay-based TCPs with rerouting and proposes a mechanism for delay-based TCPs. The proposed mechanism is able to re-measure the BaseRTT if necessary by detecting the change of TTL value of two end-hosts. Based on the simulation results, we demonstrate the effectiveness and utilities.Item type:Item, Quick Vegas: Improving performance of TCP Vegas for high bandwidth-delay product networks(2008-04-01) ;Chan, Yi-Cheng ;Lin, Chia-Liang ;Ho, Cheng-Yuan ;資訊工程學系Department of Computer ScienceAn important issue in designing a TCP congestion control algorithm is that it should allow the protocol to quickly adjust the end-to-end communication rate to the bandwidth on the bottleneck link. However, the TCP congestion control may function poorly in high bandwidth-delay product networks because of its slow response with large congestion windows. In this paper, we propose an enhanced version of TCP Vegas called Quick Vegas, in which we present an efficient congestion window control algorithm for a TCP source. Our algorithm improves the slow-start and congestion avoidance techniques of original Vegas. Simulation results show that Quick Vegas significantly improves the performance of connections as well as remaining fair when the bandwidth-delay product increases.Item type:Item, Performance Improvement of Delay-Based TCPs in Asymmetric Networks(2011-03-01) ;Ho, Cheng-Yuan ;Ho, Cheng-Yun ;Wang, Jui-Tang ;資訊工程學系Department of Computer ScienceDelay-based TCPs detect network congestion in the early stage and successfully prevent periodic packet loss that usually occurs in loss-based TCPs. It has been demonstrated that delay-based algorithms outperform loss-based schemes in many aspects. However, a delay-based TCP may not prevent unnecessary throughput degradation in asymmetric networks and when the congestion occurs in the backward path over symmetric links. In this letter, we modify the mechanism of measuring RTT value for delay-based TCPs without clock synchronization. Based on the simulation results, we show the effectiveness and utilities.