• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.1-7
• /
• 2012

DDoS attack is a malicious attempt to exhaust resources of target system and network capacities using lots of distributed zombi systems. DDoS attack introduced in early 2000 has being evolved over time and presented in a various form of attacks. This paper proposes a scheme to detect DDoS attacks and to reduce possibility of such attacks that are especially based on vulnerabilities presented by using control packets of existing network protocols. To cope with DDoS attacks, the proposed scheme utilizes a buffer management techniques commonly used for congestion control in Internet. Our scheme is not intended to detect DDoS attacks perfectly but to minimize possibility of overloading of internal system and to mitigate possibility of attacks by discarding control packets at the time of detecting DDoS attacks. In addition, the detection module of our scheme can adapt dynamically to instantly increasing traffic unlike previously proposed schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.859-876
• /
• 2012

Since the existing protocols separated mobility management part and routing protocol part in their design and used a flooding, they suffer from the high control overhead, thereby limiting performance. In this paper, we use a tree-based mobility management method and present a simple and efficient routing protocol that exploits the topology information which is built additionally through mobility management. Thus, the mobility management and the routing protocol closely cooperate to optimize control overhead. Furthermore, we use a progressive path discovery method to alleviate traffic congestion around IG and a unicast-based broadcast method to increase the reliability of message delivery and to judge link validity promptly. The proposed protocol reduces control overhead greatly and works in a stable manner even with the large number of nodes and high mobility. This was proven by comparing with the AODV protocol that employs the hybrid mobility management protocol.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.2D
• /
• pp.113-118
• /
• 2010

This paper presents an analysis of the instability phenomenon on motorways, with the aim of arriving at the definition of a control strategy suitable for keeping the flow stable. By using some results of the motorway reliability theory, a relationship and some flow characteristics is obtained, which shows that the existence of a reliability threshold critical for flow stability. The macroscopic flow characteristics corresponding to this threshold are very different in different situations, so that this control of flow stability requires the analysis of speed and density microscopic process surveyed on a cross section of the motorway carriage ways to be controlled. A method is presented, based on integrated moving average(IMA) analysis in real time of these processes, by which it is possible to detect the approach of instability before its effects become manifest, and to single out the proper control strategy in different situations.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.99-106
• /
• 2004

This paper presents some comparisons between Cournot-Nash and Stackelberg game in bi-level program, composed of both upper level program and lower level one. The upper level can be formulated to optimize a specific objective function, while the lower formulated to express travelers' behavior patterns corresponding to the design parameter of upper level problem. This kind of hi-level program is to determine a design parameter, which leads the road network to an optimal state. Bi-level program includes traffic signal control, traffic information provision, congestion charge and new transportation mode introduction as well as road expansion. From the view point of game theory, many existing algorithms for bi-level program such as IOA (Iterative Optimization Assignment) or IEA (Iterative Estimation Assignment) belong to Cournot-Nash game. But sensitivity-based algorithms belongs to Stackelberg one because they consider the reaction of the lower level program. These two game models would be compared by using an example network and show some results that there is no superiority between the models in deterministic case, but in stochastic case Stackelberg approach is better than that of Cournot-Nash one as we expect.

• Science of Emotion and Sensibility
• /
• v.23 no.2
• /
• pp.103-120
• /
• 2020

Using driving simulation, this study investigated the effects of driver's trust in the adaptive cruise control (ACC) system and road density on driver's workload and situation awareness. The drivers were allocated into one of four experimental conditions manipulated by ACC system trust level (trust-increased vs. trust-decreased) and road congestion (high vs. low). The workload and situational awareness of the participants were measured as dependent variables. The results showed followings. First, trust-decreased group for the ACC system had significantly lower trust scores for the system in all of the measurement items, including reducing the driving load and securing safe driving due to the use of this system, than the trust-increased group. Second, the trust-decreased group showed a slower reaction time in the secondary tasks and higher subjective workload than trust-increased group. Third, in contrast, the situational awareness for the driving situation was significantly higher in the trust-decreased group than trust-increased group. The results of this study showed that the driver's trust in the ACC system can affect the various information processing performed while driving. Also, these results suggest that trust in the user's system should be considered as an important variable in the design of an automated driving assistance system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1083-1096
• /
• 2008

This paper proposes an energy-aware path management scheme, so-called the TBP(Threshold based Back-Pressure) algorithm, which is designed for lifetime extension of the energy-constrained wireless sensor networks. With the goal of fair energy consumptions, we extensively utilize the available paths between the source and the sink nodes. The traffic distribution feature of the TBP algorithm operates in two scales; the local and the whole routing area. The threshold and the back-pressure signal are introduced for implementing those operations. It is noticeable that the TBP algorithm maintains the scalability by defining both the threshold and the back-pressure signal to have their meanings locally confined to one hop only. Throughout several experiments, we observe that the TBP algorithm enhances the network-wide energy distribution. which implies the extension of the network lifetime. Additionally, both the delay and the throughput outcomes show remarkable improvements. This shows that the energy-aware path control scheme holds the effects of the congestion control.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• Journal of Korean Society of Transportation
• /
• v.27 no.2
• /
• pp.199-206
• /
• 2009

In relation with economical efficiency analysis on investment evaluation of transportation system, among vehicle operating cost saving benefit that is applied to general preliminary assessment guidelines and investment evaluation guidelines, oil expense calculated data which concentrated and analyze on the relationship between oil consumption amount on running state and running speed. For uninterrupted flow which does not have stopped delay due to traffic signal, consideration for reduction benefit is possible due to the changes of running speed and travel time however, for interrupted flow which the stopping occurs due to signal control on actual signal intersection has no consideration for stopping delay time reduction and stopping rate improvement thus reflection of reality on improved effect analysis is difficult. Therefore, this research makes a framework to analyze benefits that reflects the features of signalized intersections by benefits associated with decrease of stopping delay time with existing research and developing vehicle operating cost calculation model formula. Vehicle operating cost has been redefined considering the stopping delay time by applying the oil consumption amount at idling and the economical benefit between conventional model and newly developed model when applied for the optimization of traffic signal system on the two roads in Seosan city has been analyzed comparative. While the importance of traffic system maintenance is being emphasized due to the increase of congested areas on roads, it is expected to assist in more realistic economical analysis which reflect the delay improvement through the presentation of an economic analysis model that considers the features of signalized intersections in signal optimization system improvements and effect analysis of congestion improvement projects`.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.518-531
• /
• 2004

This paper discusses a testbed architecture for implementing scalable service differentiation in the Internet. The differentiated services (DiffServ) testbed architecture is based on a model in which a bandwidth broker (BB) can control network resources, and the ALTQ can reserve resources in a router to guarantee a Quality of Service (QoS) for incoming traffic to the testbed. The reservation and releasemessage for the ALTQ is contingent upon a decision message in the BE. The BB has all the information in advance, which is required for a decision message, in the form of PIB. A signaling protocol between the BB and the routers is the COPS protocol proposed at the IETF. In terms of service differentiation, a user should make an SLA in advance, and reserve required bandwidth through an RAR procedure. The SLA and RAR message between a user and the BB has implemented with the COPS extension which was used between a router and the BB. We evaluates the service differentiation for the video streaming in that the EF class traffic shows superb performance than the BE class traffic where is a network congestion. We also present the differentiated service showing a better packet receiving rate, low packet loss, and low delay for the EF class video service.