• Proceedings of the KSR Conference
• /
• 2009.05a
• /
• pp.284-290
• /
• 2009

As the increased importance is placed on the new transit systems owing to the environmental pollution caused by the road traffic congestion, the policy for the introduction of the new transit systems as an alternative solution to ease the heavy burden of the construction expenses is being actively established. Since the explicit recognition of such transit systems and the review on the method of its adoption have been a pressing matter in the light of reducing the pending traffic congestion, the development of the rolling stock systems in modes of new transportation has been made in various ways taking into consideration the regional circumstances to alleviate traffic congestion, and offer a more efficient service with the application of their intrinsic characteristics. Such systems also have been developed as a mix of punctuality for railway systems operating on the runway and flexibility for buses. This paper, therefore, deals in more detail with 3 modes of systems such as low-floor articulated buses, GRT(Guided Rapid Transit) and tram cars, and studies the overseas cases of the operation of those systems involving both negative and positive aspects.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.399-403
• /
• 2004

In this paper, we have analyzed the TCP throughput of Portable Internet system in 2.3GHz wireless environment with considering user's mobility speed. As the Portable Internet uses large cells compared to wireless LAM and supports user's nobility, we have adapted different wireless channel model to derive the TCP throughput of the system. We have assumed wireless channel is Rayleigh fading channel and the channel is modeled as two-state Markov model with which user's nobility speed can be considered by varying transition matrix of the model. from the simulation results, we have known that higher TCP throughput under the slow fading than under the fast fading. Because the TCP throughput is closely related to the sender's congestion control, the more congestion control is done by the sender, the lower TCP throughput we have. The more congestion control is caused in the sender under the fast fading than the slow fading so the lower TCP throughput is resulted in the fast fading environment.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.6D
• /
• pp.623-636
• /
• 2012

Roundabout is an intersection that allows vehicles to pass through the intersection by circulating the circular traffic island at the center of the intersection. In this study, a comparative analysis was conducted on roundabout at five locations in order to deduce the operational result and financial effect of roundabout and signal intersection. As for the operational result, it was found that roundabout showed improvement effect in the average delay per vehicle compared to that of signal intersection by minimum of 65.6% and maximum of 91.77%. it was found that roundabout showed financial cost-saving effect in the traffic congestion cost compared to that of signal operation by minimum of 58.59% and maximum of 81.69% per year. It can be known from these analysis results that roundabout has significant operational effects under certain amount of traffic volume by allowing vehicles to pass through the intersection in a continuous way without much waiting time and stoppage from signal control.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.425-436
• /
• 2008

In this paper, we propose a resource effective call admission control(CAC) in integrated WLAN and cellular network. The proposed CAC mitigates the congestion of cellular network by handing over non-realtime traffic to WLAN. We analyze the proposed CAC in numerical and simulation method. The simulation results show that the proposed CAC achieves better performance than normal CAC. Especially, the proposed CAC can sustain desired QoS more robustly against high incoming non-realtime traffic load than againt realtime traffic load.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1116-1121
• /
• 2014

Mesh structure is one of typical interconnection networks, and it is used in the part of VLSI circuit design. Torus and Hyper-Torus are advanced interconnection networks in the part of diameter and fault-tolerance of mesh structure. In this paper, we will analyze embedding between Torus and Hyper-Torus networks. We will show T(4k,2l) can be embedded into QT(m,n) with dilation 5, congestion 4, expansion 1. And QT(m,n) can be embedded into T(4k,2l) with dilation 3, congestion 3, expansion 1.

• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.57-72
• /
• 2016

To provide effective communication in the wireless mesh network (WMN), several algorithms have been proposed. Since the possibilities of numerous failures always exist during communication, resiliency has been proven to be an important aspect for WMN to recover from these failures. In general, resiliency is the diligence of the reliability and availability in network. Several types of resiliency based routing algorithms have been proposed (i.e., Resilient Multicast, ROMER, etc.). Resilient Multicast establishes a two-node disjoint path and ROMER uses a credit-based approach to provide resiliency in the network. However, these proposed approaches have some disadvantages in terms of network throughput and network congestion. Previously, the buffer based routing (BBR) approach has been proposed to overcome these disadvantages. We proved earlier that BBR is more efficient in regards to w.r.t throughput, network performance, and reliability. In this paper, we consider the node/link failure issues and analogous performance of BBR. For these items we have proposed a resilient packet transmission (RPT) algorithm as a remedy for BBR during these types of failures. We also share the comparative performance analysis of previous approaches as compared to our proposed approach. Network throughput, network congestion, and resiliency against node/link failure are particular performance metrics that are examined over different sized WMNs.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.19-35
• /
• 2007

This study is for detecting the Braess Paradox by stable dynamics in general transportation networks. Stable dynamics, suggested by Nesterov and de Palma[18], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model based on link latency function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. The phenomenon that increasing capacity of a network, for example creating new links, may decrease its performance is called Braess Paradox. It has been studied intensively under user equilibrium model with link latency function since Braess[5] demonstrated a paradoxical example. However it is an open problem to detect the Braess Paradox under stable dynamics. In this study, we suggest a method to detect the Paradox in general networks under stable dynamics. In our model, we decide whether Braess Paradox will occur in a given network. We also find Braess links or Braess crosses if a network permits the paradox. We also show an example how to apply it in a network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.255-269
• /
• 2006

The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

• International Journal of Highway Engineering
• /
• v.19 no.5
• /
• pp.153-162
• /
• 2017

PURPOSES : This study was conducted to analyze the effects arising from extending the duration of nighttime road construction on improving road quality and durability. METHODS : Most previous studies estimating the social cost of various construction conditions did not consider road pavement cooling time as a factor in improving road pavement quality. This study investigated the feasibility of achieving higher road quality and durability by extending the duration of nighttime road construction time extension. For this investigation, the effects of such an extension on traffic conditions were analyzed based on micro-simulation studies and scenario-based cost-benefit analyses, using factors including traffic volume, delay, construction cost, and road pavement cooling time. RESULTS : The results of the traffic simulation studies and cost-benefit analyses indicate that the current road construction method that emphasizes completing nighttime road construction by 6 a.m. reduces pavement life while causing relatively little traffic delay. If the night construction time is instead extended to 2 p.m., road pavement lifetime is increased, reducing road re-construction cost. These savings are greater than the cost of congestion arising from extending the duration of nighttime construction. CONCLUSIONS : The current nighttime construction durations need to be extended in order to efficiently manage roads and reduce road management costs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.