• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.1426-1440
• /
• 2008

In Korea, the concentration for the use of urban railroads is comparatively high during peak hours. In case of road traffic, overcrowdness leads the increase of total travel time and cost naturally but this does not happen in railroad systems because of fixed operational interval. Thus, passenger's disutility is generated physically and mentally from congestion increment. The increase of railroad capacity from new transit lines and expansion of existed lines contributes traveler's comfort benefits to rising. However, present evaluation guidelines for feasibility studies of road and railroad projects do not include any valuation methodology about passenger's comfort benefits. Therefore, in this research, various factors affecting comfort benefits are reviewed and stated preference survey is performed in order to estimate traveler's comfort benefits for congestion reduction. In addition, willingness to pay for congestion avoidance is calculated from that stated preference survey based on Tobit Model. As a result, detailed unit for willingness to pay according to congestion reduction is proposed in this study.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.267-277
• /
• 2011

Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.8-17
• /
• 2006

Recently, the high-speed Internet users increase rapidly and broadband networks have been widely deployed. However, the current TCP congestion control algorithm was designed for relatively narrowband network environments, and thus its performance is inefficient for traffic transport in broadband networks. To remedy this problem, the TCP having an enhanced congestion control algorithm is required for broadband networks. In this paper, we propose an improved TCP congestion control that can sufficiently utilize the large available bandwidth in broadband networks. The proposed algorithm predicts the available bandwidth by using ACK information and RTT variation, and prevents large packet losses by adjusting congestion window size appropriately. Also, it can rapidly utilize the large available bandwidth by enhancing the legacy TCP algorithm in congestion avoidance phase. In order to evaluate the performance of the proposed algorithm, we use the ns-2 simulator. The simulation results show that the proposed algorithm improves not only the utilization of the available bandwidth but also RTT fairness and the fairness between contending TCP flows better than the HSTCP in high bandwidth delay product network environment.

• 전자공학회논문지 IE
• /
• v.43 no.3
• /
• pp.41-48
• /
• 2006

In this paper, we propose a new active queue management (AQM) scheme by utilizing the predictability of the Internet traffic. The proposed scheme predicts future traffic input rate by using the auto-regressive (AR) time series model and determines the future congestion level by comparing the predicted input rate with the service rate. If the congestion is expected, the packet drop probability is dynamically adjusted to avoid the anticipated congestion level. Unlike the previous AQM schemes which use the queue length variation as the congestion measure, the proposed scheme uses the variation of the traffic input rate as the congestion measure. By predicting the network congestion level, the proposed scheme can adapt more rapidly to the changing network condition and stabilize the average queue length and its variation even if the traffic input level varies widely. Through ns-2 simulation study in varying network environments, we compare the performance among RED, Adaptive RED (ARED), REM, Predicted AQM (PAQM) and the proposed scheme in terms of average queue length and packet drop rate, and show that the proposed scheme is more adaptive to the varying network conditions and has shorter response time.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.130-134
• /
• 2007

DCF(Distributed Coordination Function) of IEEE 802.11 WLAN(Wireless Local Area Network) MAC Layer apply to CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) for solution of collision when the station try to access at the same time. But DCF happens falling performance as increasing a number of stations. In this paper, we suggest algorithm that improved performance in congestion. And we compare DCF, DCF+ and proposed algorithm respect to saturation throughput, delay, collision rate and drop rate using NS2(Network Simulator 2) simulation tool.

• 대한공업교육학회지
• /
• v.32 no.2
• /
• pp.199-216
• /
• 2007

Stream Control Transmission Protocol(SCTP) is a transport layer protocol to support the data transmission. SCTP is similar to Transmission Control Protocol(TCP) in a variety of aspects. However, several features of SCTP including multi-homing and multi-streaming incur the performance difference from TCP. This paper highlights the data transfer during the initial slow start phase in SCTP congestion control composed of slow start phase and congestion avoidance phase. In order to compare the mean transfer time between SCTP and TCP, we experiment with different performance parameters including bandwidth, round trip time, and data length. By varying data length, we also measure the corresponding initial window size, which is one of factors affecting the mean transfer time. For the experiment, we have written server and client applications by C language using SCTP socket API and have measured the transfer time by ethereal program. We transferred data between client and server using round-robin method. Analysis of these experimental results from the testbed implementation shows that larger initial window size of SCTP than that of TCP brings the reduction in the mean transfer time of SCTP compared with TCP by 15 % on average during the initial slow start phase.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.229-234
• /
• 2004

In this study, the performance is compared between RFC compatible normal TCP and several speed constraints Ignored TCP. To do these, the main algorithms that constraints the transmit rate of TCP are modified. We have modified TCP protocol stack in a Linux kernel to compare the speeds between the standard TCP and our modified TCP. We find that if the destination is short distance away from the source and packet error is scarce then the speed differences between normal and modified TCP nay be negligible. However, if the destination is far away from the source and slow start algorithm is not adopted then the transfer time for small file is different greatly In addition, if packet error occurred frequently, our modified TCP is faster than the standard TCP regardless of distance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.3
• /
• pp.27-36
• /
• 2012

With the increase of various user's requirements, lots of interesting applications on the Internet have been emerging recently. However, Internet has many limitations for providing upcoming new services because it was only designed to provide basic connectivity between research networks and simplified forwarding functions at the first time. Internet has many problems in the aspects of routing scalability, mobility, security and QoS, so lots of researches are being actively performed in many countries to solve these problems. In this paper, we implement RED(Random Early Detection) scheduler using NetFPGA platform and local testbed to provide active queue management. Using the implemented RED scheduler, packets are dropped according to the specified drop probability, so Global Synchronization coming from simultaneous TCP segment losses in a congestion condition can be prevented. With the comparison to the Drop-Tail scheme in the basic router, we show TCP performance can be enhanced in the congestion situation using the NetFPGA-based RED scheduler.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.80-91
• /
• 2002

A general goal of the AT%(Asynchronous Transfer Mode) network is to support connect across various network. On ATM networks, ABR services are provided using the remained ban after allocation CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR ado VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. In this paper a simulation has been performed to compare and evaluate the performance between the ERICA(Explicit Rate Indicate Avoidance) and EPRCA(Enhanced Proportional Rate Control Algorithm) switches which use Explicit Rate switch algorithm for ABR switch. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. As a result of simulation, ERICA algorithm switch was ten times long compared to ERPCA switch to achieve assigned fair share. so EPRCA switch is superior to ERICA about load response. For Fair share and stability, ERICA switch is excellent to EPRCA switch.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1367-1370
• /
• 2005

무선 센서 네트워크에서 제안된 혼잡을 회피한 TDMA 기반의 MAC 프로토콜은 많은 노드에서 한꺼번에 전송할 데이터가 발생하더라도 중간에서 전달하는 노드가 타임슬롯을 소스 노드의 타임슬롯을 선택함으로써 혼잡에 의한 지연 없이 데이터를 BS(base station)으로 전달할 수 있다. 하지만, 데이터를 전달받기 위해서는 모든 타임슬롯에 걸쳐서 idle listening 을 수행하여야 하므로 에너지 소비가 크다. 본 논문은 혼잡을 회피한 TDMA 기반의 MAC 프로토콜로써 전원 제어 패킷(power control packet)을 이용하여 데이터의 전달을 이웃 노드에게 예측할 수 있도록 함으로써 노드들로 하여금 수면 모드로의 전환이 가능하게 되어 각 노드의 에너지가 절감된다.