• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.527-531
• /
• 2003

Previous researches on scalability problem of distributed virtual environment (DVE) have been mainly focused on spatial partitioning of area of interest (AOI). Congestion phenomena by avatar groups in AOI have been neglected relatively. However, AOI congestion is highly related to scalability of DVT because it exhausts system resources such as network bandwidth and rendering time, and could be a bar to perform collaboration among participants. In this paper, this will be defined as the problem that must be solved for the realization of the scalable DVE, and a model will be proposed to measure and control congestion situation in AOI. The purposes of the proposed model are to prevent high density of participants in AOI, and to protect stable collaboration in DVE. For evaluation of the performance it is compared with a previous method by defining the resource cost model which is dynamically activated to AOI congestion.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.3
• /
• pp.15-27
• /
• 2017

In general, increasing train dwell time leads to increasing train service frequency, and it in turn contributes to increasing the congestion level of train and platform. Therefore, the studies on train dwell time have received growing attention in the perspective of scheduling train operation. This study develops a prediction model of train dwell time to enable train operators to mitigate platform congestion by metering passenger inflow at platform gate with respect to platform congestion levels in real-time. To estimate the prediction model, three types of independent variables were applied: number of passengers to get into train, number of passengers to get out of trains, and train weights, which are collectable in real-time. The explanatory power of the estimated model was 0.809, and all of the dependent variables were statistically significant at the 99%. As a result, this model can be available for the basis of on-time train service through platform gate metering, which is a strategy to manage passenger inflow at the platform.

• Archives of Craniofacial Surgery
• /
• v.16 no.3
• /
• pp.143-146
• /
• 2015

In this report, we present a scalp defect reconstruction with lateral arm free flap. We highlight the difficulty in obtaining a recipient vein and the venous drainage managed through an open end of the donor vein. A 52-year-old woman presented with a pressure sore on the left scalp. A lateral arm free flap was transferred to cover this $8{\times}6cm$ defect. The arterial anastomosis was successful, but no recipient vein could be identified within the wound bed. Instead, we used a donor venous end for the direct open venous drainage. In order to keep this exposed venous end patent, we applied heparin-soaked gauze dressing to the wound. Also, the vein end was mechanically dilated and irrigated with heparin solution at two hour intervals. Along with fluid management and blood transfusion, this management was continued for the five days after the operation. The flap survived well without any complication. Through this case, we were able to demonstrate that venous congestion can be avoided by drainage of the venous blood through an open vessel without the use of leeches.

• Journal of Korean Society of Transportation
• /
• v.5 no.2
• /
• pp.81-95
• /
• 1987

In line with the continued growth of car ownership, the traffic problems in central area of metropoles such as Seoul would become increasingly degraded. comparing with most western cities, the problems in Seoul are characterized by the improportionately high rates of intersection delay, station congestion, traffic accidents caused by weaving conflicts and pedestrian congestion. It is caused by the lack of flexibility I street network, which is prerequisite for upholding the efficacy of traffic management and control, resulted from the simplicity of network graph in terms of connectivity, street density and distribution by width. This pattern has been resulted from the prolonged policy pursuing the street-widening of the nagging bottleneck in such a short period since the 1950s, comparing that most western cities had undergone over several centuries an age of horse-and-vehicle transportation. In order to improve the expected traffic problems in central area over the coming periods of motorization, it is imperative to restructure the street network in Central Seoul so that the efficacy of traffic management and control may be operative. Based upon the long-range planning the street network should be restructured by stages so that cenral traffic may be controled by one-way operation and most through-traffic be detoured around fringe area.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.141-156
• /
• 2009

As the TCP is the protocol designed for the wired network that packet loss probability is very low, because TCP transmitter takes it for granted that the packet loss by the wireless network characteristics is occurred by the network congestion and lowers the transmitter's transmission rate, the performance is degraded. The Snoop Protocol was designed for the wired network by putting the Snoop agent module on the BS(Base Station) that connect the wire network to the wireless network to complement the TCP problem. The Snoop agent cash the packets being transferred to the wireless terminal and recover the loss by resending locally for the error occurred in the wireless link. The Snoop agent blocks the unnecessary congestion control by preventing the dupack (duplicate acknowledgement)for the retransmitted packet from sending to the sender and hiding the loss in the wireless link from the sender. We evaluated the performance in the wired/wireless network and in various TCP versions using the TCP designed for the wired network and the Snoop designed for the wireless network and evaluated the performance of the wired/wireless hybrid network in the wireless link environment that the continuous packet loss occur.

• 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.344-348
• /
• 2006

This paper proposes a QoS policy for cellular networks which support the policy based network management scheme. The policy exploits the existing underlying DiffServ mechanism and the priority-based packet scheduler in order to provide the packets with different handling priority depending on their belonging traffic classes. The simulation results reveals the effectiveness of the proposed policy under the network congestion; it shows that the goodput of the real-time traffic is not affected at all in spite of the surge of the non real-time traffic.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.619-622
• /
• 2004

For recent years, hacking is in the trends of making excessive traffic unnecessarily to obstruct the service by getting a system's performance down. And we can also see systems paralyzed in service ability due to the flash crowds of normal traffic to a popular website. This is an important problem certainly solved in the point of QoS guarantee for the clients. It is known that the former is DDoS(Distributed Denial of Service) attack and the latter is FE(Flash Event). These two are samely anomalous traffic because these make excessive congestion on the network or system and downgrade the system's service ability. In this paper, we propose a scheme for protecting the system against anomalous traffic and for guaranteeing the QoS. For this, a server records and maintains the information of clients accessed more than one time before when it is in normal condition. When it falls into the congestion, the records are used for filtering the spoofed IP. We send and receive the ICMP request/reply packet to know whether the IP is spoofed. And we also propose for applying the object spliting of CDN to guarantee the QoS in the initial FE situation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2096-2105
• /
• 1998

As there can be coincident bursts which may result in congetsion in a node of ATM network, reactive flow control schemes are required to guarantee user's Quality of Service. But, the high speed characteristics of ATM networks make it difficult to control source transmission rate in reacting to congestions in intermediate nodes. Therefore, flow control in Customer Premise Network may be more efficient than end-to-end flow control. In this paper, we propose a management model for flow ontrol in CPN and new Network Access Flow/Congestsion control scheme to utilize efficiently Virtual Path Connection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3B
• /
• pp.487-492
• /
• 2000

The ABR(available bit rate) service has been developed to support data application over ATM(asynchronous Transfer mode) networks, and TCP is the most widely used transport layer protocol in existing data networks. Thus, the performance improvement of TCP over ABR is an issue of cardinal importance. In this paper, we propose algorithm of the adjustment of congestion window size utilizing RM(resource Management) cell information. The motivation is to use more reliable information in ER(explicit rate) field within RM cell to determine TCP window size. Simulations are performance using the suggested algorithm is improved, as compared to TCP-reno.