• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권10호
• /
• pp.4977-4996
• /
• 2016

The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. Researchers have made three types of suggestions to solve the bufferbloat problem. One is End to End (E2E) congestion control, second is deployment of Active Queue Management (AQM) techniques and third is the combination of above two. However, these solutions either seem impractical or could not obtain good bandwidth utilization. In this paper, we propose a Transmission Control Protocol（TCP）delayed window update mechanism which uses a congestion detection approach to predict the congestion level of networks. When detecting the network congestion is coming, a delayed window update control strategy is adopted to maintain good protocol performance. If the network is non-congested, the mechanism stops work and congestion window is updated based on the original protocol. The simulation experiments are conducted on both high bandwidth and long delay scenario and low bandwidth and short delay scenario. Experiment results show that TCP delayed window update mechanism can effectively improve the performance of the original protocol, decreasing packet losses and queuing delay while guaranteeing transmission efficiency of the whole network. In addition, it can perform good fairness and TCP friendliness.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2499-2502
• /
• 2005

Universal Serial Bus (USB) is one of the most popular communication interfaces. When USB is used in more extended range, especially configuring home network by connecting multiple digital devices each other, USB interface uses the bandwidth in the way of Time Division Multiplexing (TDM) so that the bottleneck of bus bandwidth can be brought under the heavy traffic. In this paper, the more effective usage of bus bandwidth to overcome this situation is introduced. Basically, in order to realize the system for transferring real-time moving picture data among digital information devices, we analyze USB transfer types and descriptors and introduce the method to enhance the detailed performance of isochronous transfer that is one of USB transfer types.

• 한국통신학회논문지
• /
• 제25권6A호
• /
• pp.910-917
• /
• 2000

Because the random early detection(RED) algorithm deals all flows with the same best-effort traffic characteristic, it can not correctly control the output link bandwidth for the flows with different traffic characteristics. To remedy this problem, several per-flow algorithms have been proposed. In this paper, we propose a new per-flow type Fair Droptail algorithm which can fairly allocate bandwidth among flows over a shared output link. By evenly allocating buffers per flow, the Fair Droptail can restrict a flow not to use more bandwidth than others. In addition, it can be simply implemented even if it employs the per-flow state mechanism, because the Fair Droptail only keeps each information of flow in active state.

• 한국정보과학회논문지:정보통신
• /
• 제37권6호
• /
• pp.415-419
• /
• 2010

본 논문에서는 이동 셀룰러 네트워크 환경에서 한정된 자원인 무선대역폭을 효율적으로 사용하기 위해 게임이론을 이용한 대역폭 예약 기법을 제안하였다. 제안된 기법에서는 게임 이론의 협상 해법 중 대표적인 NBS 기법을 이용하여 전체 시스템의 효용을 극대화하는 최적의 대역폭 대여량과 예약량을 계산한다. 성능평가 결과 제안된 기법이 다양한 네트워크의 상황에 탄력적으로 대응할 수 있었기에 기존에 제안된 기법에 비해 뛰어난 성능을 보임을 확인할 수 있었다.

• 드라이브 ㆍ 컨트롤
• /
• 제12권3호
• /
• pp.44-51
• /
• 2015

In this study, a metering cylinder was constructed, and the velocity obtained from the linear velocity transducer (LVT) of the cylinder piston was used to evaluate the dynamic performance of an electro-hydraulic servovalve. Frequency response experiments involving the spool displacement and piston velocity (LVT signal) were conducted with different input signal amplitudes, hydraulic pipe diameters, and supply pressures. The spool displacement signal accurately reflected the performance of the servovalve. Meanwhile, the -3 dB bandwidth frequency of the LVT signal was similar to the spool displacement signal, except for a small-amplitude input signal, and the $-90^{\circ}$ phase lag bandwidth frequency showed some differences.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.1061-1064
• /
• 1999

UDP has likely been used for real-time applications, such as video and audio. UDP supplies minimized transmission delay by omitting the connection setup process, flow control, and retransmission In general, more than 80 percent of the WAN resources are occupied by Transmission Control Protocol(TCP) traffic as opposed to UDP's simplicity, TCP adopts a unique flow control in this paper, I report new methods to minimize a udp packet loss considering TCP flow control on the real-time application the better performance of real time application can be obtained when they reduce a packet size and FIFO buffer scheduling method competing with TCP bandwidth for the bandwidth and buffering.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• 한국통신학회논문지
• /
• 제29권1B호
• /
• pp.64-72
• /
• 2004

Multiprotocol Label Switching (MPLS) has been developed as a key technology to enhance the reliability, manageability and overall quality of service of core If networks with connection-oriented tunnel LSP and traffic engineering such as constraint-based routing, explicit routing, and restoration. In this paper, we propose a control bandwidth borrowing scheme that maximizes the utilization of tunnel LSPs or physical links by an extension to the RSVP-TE label distribution protocol. MPLS-based core switching network and VPN services rely on the establishment of connection-oriented tunneled LSPs that are configured or predefined by network management systems. The mechanism of network management system varies from (i) a relatively static LSP establishment accounting, to (ii) a dynamic QoS routing mechanisms. With the use of hierarchical LSPs, the extra bandwidth that is unused by the trunk (outer) LSPs should be fully allocated to their constituent end-to-end user traffic (inner) LSPs in order to maximize their utilization. In order to find out the unused extra bandwidth in tunnel LSP or physical link and redistribute these resources to constituent LSPs, we expend the functionality of RSVP-TE and the found unused extra bandwidth is redistributed with a weight-based recursive redistribution scheme. By the extended RSVP-TE and proposed recursive redistributed scheme, we could achieve the instantaneous maximized utilization of tunnel LSP or physical link suffering from the potential under-utilization problem and guarantee the end-to-end QoS requirements. With the proposed scheme, network manager can manage more effectively the extra available bandwidth of hierarchical LSPs and maximize the instantaneous utilization of the tunneled LSP resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권2호
• /
• pp.63-81
• /
• 2008

WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

• 한국정보통신학회논문지
• /
• 제4권3호
• /
• pp.537-548
• /
• 2000

ATM은 다양한 전송속도의 트래픽을 통계적으로 다중화하여 효과적으로 수용할 수 있는 경제적인 정보 전달 방식이다. 그러나 일시적인 과부하시 큰 셀 손실 및 셀 지연이 발생할 수 있다. 따라서 사용자 관점에서 서비스 품질 보장과 망 관점에서 이용 효율의 극대화라는 상반된 내용에 대해서 효과적인 트래픽 제어와 망 자원관리가 요구된다. 본 논문에서는 ATM스위치 네트워크를 2단을 기본으로 구성하였을 때 혼합되어진 각 서비스 클래스에 대한 서비스 품질을 보장하기 위하여 ATM Forum에서 권고하는 반응제어 기법인 BP(Back Pressure) 방법과 pushout 메커니즘을 혼합한 POBP(PushOut BP) 방법을 제안하였다. 제안한 방법에서는 대역폭의 사용 현황을 실 시간적으로 정확하게 파악하여 협정이 이루어 져야 한다. 이러한 과정을 통하여 잔여 대역폭을 효과적으로 사용할 수 있을 뿐만 아니라 공정한 대역폭의 사용을 보장하여 2단 ATM 네트워크에서의 폭주 상태로 인한 셀 손실률을 개선할 수 있었다.