• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.197-205
• /
• 2008

TCP packets occupy over 90% of current Internet traffic thus understanding of TCP throughput is crucial to understand Internet. Under the TCP congestion regime, heterogeneous flows, i.e., flows with different round-trip times (RTTs), that share the same bottleneck link will not attain equal portions of the available bandwidth. In fact, according to the TCP friendly formula, the throughput ratio of two flows is inversely proportional to the ratio of their RTTs. It has also been shown that TCP's unfairness to flows with longer RTTs is accentuated under loss synchronization. In this paper, we show that, injecting bursty background traffic may actually lead to new type of synchronization and result in unfairness to foreground TCP flows with longer RTTs. We propose three different metrics to characterize traffic burstiness and show that these metrics are reliable predictors of TCP unfairness.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.253-262
• /
• 2008

Providing Quality-of-Service (QoS) guarantee requires the reservation of resource needed to accommodate the traffic flow of service for which resource reservation protocol (RSVP) was introduced. However, if any RSVP-capable router on the path fails to accommodate the traffic flow due to lack of resource, the flow is not allowed no matter how much surplus resources other routers on the path have. In order to solve this problem, this paper proposes a resource reservation method with available resource migration between RSVP-capable routers in which the routers use the recently developed latency optimized fair queuing scheduler. The results of the simulation applying the proposed method to an evaluation network show that it may yield the gain of up to 165% compared to that in the original one in terms of the number of admitted flows.

• Journal of Korean Society of Transportation
• /
• v.17 no.4
• /
• pp.59-69
• /
• 1999

A Freeway corridor is a network consisting of a few Primary longitudinal roadways (freeway or major arterial) carrying a major traffic movement with interconnecting roads which offer the motorist alternative paths to his/her destination. Control measures introduced to ameliorate traffic performance in freeway corridors typically include ramp metering at the freeway entrances, and signal control at each intersections. During a severe freeway incident, on-ramp metering usually is not adequate to relieve congestion effectively. Diverting some traffic to the Parallel surface street to make full use of available corridor capacity will be necessary. This is the purpose of the traffic management system. So, an integrated traffic control scheme should include three elements. (a)on-ramp metering, (b)off-ramp diversion and (c)signal timing at surface street intersections. The purpose of this study is to develop an integrated optimal control model in a freeway corridor. By approximating the flow-density relation with a two-segment linear function. the nonlinear optimal control problem can be simplified into a set of Piecewise linear programming models. The formulated optimal-control Problem can be solved in real time using common linear program. In this study, program MPL(ver 4.0) is used to solve the formulated optimal-control problem. Simulation results with TSIS(ver 4.01) for a sample network have demonstrated the merits of the Proposed model and a1gorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.888-908
• /
• 2011

The increasing demand from passengers in vehicles to improve safety, traffic efficiency, and comfort has lead to the growing interest of Wi-Fi based vehicle-to-infrastructure (V2I) communications. Although the V2I system provides fast and cost-effective Internet connectivity to vehicles via roadside Wi-Fi access points (APs), it suffers from frequent handoffs due to the high mobility of vehicles and the limited coverage of Wi-Fi APs. Recently, the Mobile AP (MAP) platform has emerged as a promising solution that overcomes the problem in the V2I systems. The main advantage is that MAPs may yield longer service duration to the nearby vehicles that have similar mobility patterns, yet they provide smaller link capacities than the roadside APs. In this paper, we present a new association control technique that harnesses available connection duration as well as achievable link bandwidth in high-speed vehicular network environments. We also analyze the tradeoff between two association metrics, namely, available connection duration and achievable link bandwidth. Extensive simulation studies based on real traces demonstrate that our scheme significantly outperforms the previous methods.

• Journal of Korean Society of Transportation
• /
• v.35 no.3
• /
• pp.220-233
• /
• 2017

Traffic volumes are fundamental data widely used in various traffic analysis, such as origin-and-destination establishment, total traveled kilometer distance calculation, congestion evaluation, and so on. The low number of links collecting the traffic-volume data in a large urban highway network has weakened the quality of the analyses in practice. This study proposes a method to estimate the traffic volume data on a highway link where no collection device is available by introducing a spatial statistic technique with (1) the traffic-volume data from TOPIS, and National Transport Information Center in the Ministry of Land, Infrastructure, and (2) the navigation data from private navigation. Two different component models were prepared for the interrupted and the uninterrupted flows respectively, due to their different traffic-flow characteristics: the piecewise constant function and the regression kriging. The comparison of the traffic volumes estimated by the proposed method against the ones counted in the field showed that the level of error includes 6.26% in MAPE and 5,410 in RMSE, and thus the prediction error is 20.3% in MAPE.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.805-814
• /
• 1994

In this paper, we introduce a new method which is available for analyzing the throughput of the packet radio network by using the auxiliary Markov transient matrix with a failure state and a success state. And we consider the effect of symbol error for the network state(X, R) consisted of the number of transmitting PRU X and receiving PRU R. We examine the packet radio network of a continuous time Markov chain model, and the direct sequence binary phase shift keying CDMA radio channel with hard decision Viterbi decoding and bit-by-bit changing spreading code. For the unslotted distributed multi-hop packet radio network, we assume that the packet error due to a symbol error of radio channel has Poisson process, and the time period of an error occurrence is exponentially distributed. Through the throughputs which are found as a function of radio channel parameters, such as the received signal to noise ratio and chips of spreading code per symbol, and of network parameters, such as the number of PRU and offered traffic rate, it is shown that this composite analysis enables us to combine the Markovian packet radio network model with a coded DS/BPSK CDMA radio channel.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.279-286
• /
• 2010

Unbalanced traffic load offered to the nodes making up a path in the network guaranteeing quality-of-service has been known as a main cause deteriorating the capability of the path in admitting traffic flows. Several path load balancing methods have been developed to resolve this problem which used a feedback control scheme that adjusts the delay budget of a flow allocated to each node according to the conditions of available resource in the path. Because of no consideration about the probabilistic characteristics of the service quality, it is impossible for them to prevent in advance a bottleneck on the path which leads to a native restriction in the improvement of the capability being deteriorated. This paper proposes a preventive intra-path load balancing method applicable to the RSVP system which is based on the probabilistic characteristics of the quality-of-service of the offered load. The results of the simulation of the proposed method on a simple evaluation network showed that it provides the gain of 4~22% compared to the legacy one in terms of the number of admitted flows.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.203-210
• /
• 2013

Majority of the wireless ad hoc routing protocols are proposed to find feasible routes without considering the network load, end-to-end link quality and bandwidth requirements of the application. Therefore, protocol may not provide sufficient quality of service (QoS) to a high speed traffic such as multimedia. In this paper, we propose a path-quality and bandwidth-estimation based routing protocol (PBBR) for the high quality multimedia stream that can meet the application's bandwidth requirements and find the best reliable route. The novelty of this protocol is to select a reliable path to respond the application's requirements based on available bandwidth at each intermediate node and end-to-end path loss ratio. Obtained results from the simulation demonstrates that our protocol can achieve sufficient performance in terms of throughput and end-to-end delay.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.55-62
• /
• 2014

This paper has proposed Hybrid QoS Routing Link State Update(LSU) Algorithm that has had a both advantage of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. Hybrid LSU algorithm can adapt the threshold based network traffic information and has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed algorithm and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm that it can diminish to 10% of the LSU message count.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.11
• /
• pp.962-966
• /
• 2001

The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.