• Title/Summary/Keyword: Information flows

Search Result 993, Processing Time 0.03 seconds

Defending HTTP Web Servers against DDoS Attacks through Busy Period-based Attack Flow Detection

  • Nam, Seung Yeob;Djuraev, Sirojiddin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2512-2531
    • /
    • 2014
  • We propose a new Distributed Denial of Service (DDoS) defense mechanism that protects http web servers from application-level DDoS attacks based on the two methodologies: whitelist-based admission control and busy period-based attack flow detection. The attack flow detection mechanism detects attach flows based on the symptom or stress at the server, since it is getting more difficult to identify bad flows only based on the incoming traffic patterns. The stress is measured by the time interval during which a given client makes the server busy, referred to as a client-induced server busy period (CSBP). We also need to protect the servers from a sudden surge of attack flows even before the malicious flows are identified by the attack flow detection mechanism. Thus, we use whitelist-based admission control mechanism additionally to control the load on the servers. We evaluate the performance of the proposed scheme via simulation and experiment. The simulation results show that our defense system can mitigate DDoS attacks effectively even under a large number of attack flows, on the order of thousands, and the experiment results show that our defense system deployed on a linux machine is sufficiently lightweight to handle packets arriving at a rate close to the link rate.

A Simplified Method to Estimate Travel Cost based on Traffic-Adaptable Heuristics for Accelerating Path Search

  • Kim, Jin-Deog
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.239-244
    • /
    • 2007
  • In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

Technique for Estimating the Number of Active Flows in High-Speed Networks

  • Yi, Sung-Won;Deng, Xidong;Kesidis, George;Das, Chita R.
    • ETRI Journal
    • /
    • v.30 no.2
    • /
    • pp.194-204
    • /
    • 2008
  • The online collection of coarse-grained traffic information, such as the total number of flows, is gaining in importance due to a wide range of applications, such as congestion control and network security. In this paper, we focus on an active queue management scheme called SRED since it estimates the number of active flows and uses the quantity to indicate the level of congestion. However, SRED has several limitations, such as instability in estimating the number of active flows and underestimation of active flows in the presence of non-responsive traffic. We present a Markov model to examine the capability of SRED in estimating the number of flows. We show how the SRED cache hit rate can be used to quantify the number of active flows. We then propose a modified SRED scheme, called hash-based two-level caching (HaTCh), which uses hashing and a two-level caching mechanism to accurately estimate the number of active flows under various workloads. Simulation results indicate that the proposed scheme provides a more accurate estimation of the number of active flows than SRED, stabilizes the estimation with respect to workload fluctuations, and prevents performance degradation by efficiently isolating non-responsive flows.

  • PDF

A Study on the Information Gathering Function of Research and Development Laboratories Established within Industrial Firms (산업체 부설연구소의 정보기능에 관한 연구)

  • Cho In Sook
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.16
    • /
    • pp.281-327
    • /
    • 1989
  • This dissertation is presented in two major parts. The first part presented in Chapter 3 attempts to verify the major hypothesis of the present study that the research and development laboratories(hereafter referred to R&D laboratories), establishd withine industrial firms to develop new technologies needed for their own industrial activities, may have another but very important functions to bring information on the externally generated technologies to attention of their respective management decision makers, eventually resulting in the transfer of technology; and such information functions of the R&D laboratories may be better performed by well-organised laboratories than by poorly-organised ones. The second part presented in Chapters 4, 5, 6 and 7 discusses, after the preceding hypotheses has been verified, some desirable situations of the R&D laboratories in facilitating the flow of information on new technologies developed in the world into their industrial firms, centering on the organisational positions and the major fields of interest of the person in charge of the R&D centers, services of the library and technological information office supporting the R&D laboratories, and frequencies of direct contacts of research and development workers with experts in the world and of participation in various conferences, seminars, workshops, exhibitions, etc. Now that there is no recognised instrument and method available for direct measurement of volume of technological information transfered into a particular industrial firm, the number of technologies introduced into a given firm is employed in the present study as an analogous parametre indicating volume of technological information transfered into the firm during a particular period of time. A logical attempt to justify the use of the indirect paramentre is made in Chapter two. vidences needed to verify the hypotheses of the present study are collected through the various publications of the Korea Industrial Research Institutes and other agencies and institutions related to industrial research activities, and through responses to the questionnaire posted to a sample of the 66 R&D laboratories on 6 May 1987 and returned by 30 August of the same year. Some findings and conclusions made in the study are summarised as follows: (1) More information on externally developed technologies flows into the industrial firm with a R&D laboratory of its own than into the industrial firm without one, and naturally, more chances of transfer of technologies are given to the former than to the latter (see 3. 2) (2) After establishing an R&D laboratory, more technological information flows into the industrial firm than before establishing one (see 3. 3) (3) More technological information flows into the industrial firm with a well-organised R&D laboraory than into the firm with a poorly-organised one (see 3. 4) (4) More technological information flows into the ndustrial firm where the director of its R&D laboratory has status qualified to participate in the highest managerial decision making processes of the firm than into the industrial firm where the director does not have such status (see 4. 2) (5) More technological information flows into the industrial firm where the director of R&D laboratory does not hold other positions within the firm than into the industrial firm where the director holds other positions (see 4.3) (6) There is evidence showing that quantities of technological information transfered into industriali firms vary with the case that the major background of the director of the R&D laboratory is the same as the main field of R&D activities of his or her laboratery, the case that the director's background is partly related to the field of R&D activities of the laboratory, and the case that the director's major background is different from the field of R&D activities of the laboratory (see 4.4) (7) More technological information flows into the industrial firm with the director of its R&D laboratory appointed from among professional research and development workers than into the industrial firm with the director of its R&D laboratory appointed from among general managers (see 4.5) (8) More technological information flows into the industrial firm with its R&D laboratory which has established a library service unit within its own jurisdiction than into the industrial firm with its R&D laboratory which has established a library service unit within its own jurisdiction than into the industrial firm with its R&D laboratory which uses a library within the firm but outside the laboratory (see 5. 1) (9) More echnological information flows into the industrial firm with a technological information office of its own than into the industrial firm without such an office (see 5. 2) (10) More technological information flows into the industrial firm with a large research and development staff in its R&D laboratory than into the industrial firm with a small staff in its R&D laboratory (see 5. 2) (11) More technological information flows into the industrial firm with its R&D laboratory whose staff members more frequently contact experts in the conferences, seminars, symposiums, and workshops held in foreign countries and novelties in the world's major exhibitions than into the industrial firm with its R&D laboratory whose staff members less frequently contact such experts and novelties (see 6. 2 ; 6. 3)

  • PDF

Real-Time Classification, Visualization, and QoS Control of Elephant Flows in SDN (SDN에서 엘리펀트 플로우의 실시간 분류, 시각화 및 QoS 제어)

  • Muhammad, Afaq;Song, Wang-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.3
    • /
    • pp.612-622
    • /
    • 2017
  • Long-lived flowed termed as elephant flows in data center networks have a tendency to consume a lot of bandwidth, leaving delay-sensitive short-lived flows referred to as mice flows choked behind them. This results in non-trivial delays for mice flows, eventually degrading application performance running on the network. Therefore, a datacenter network should be able to classify, detect, and visualize elephant flows as well as provide QoS guarantees in real-time. In this paper we aim to focus on: 1) a proposed framework for real-time detection and visualization of elephant flows in SDN using sFlow. This allows to examine elephant flows traversing a switch by double-clicking the switch node in the topology visualization UI; 2) an approach to guarantee QoS that is defined and administered by a SDN controller and specifications offered by OpenFlow. In the scope of this paper, we will focus on the use of rate-limiting (traffic-shaping) classification technique within an SDN network.

Packet Output and Input Configuration in a Multicasting Session Using Network Coding

  • Marquez, Jose;Gutierrez, Ismael;Valle, Sebastian;Falco, Melanis
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.686-710
    • /
    • 2019
  • This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.

Mobility Support Algorithm for Heterogeneous Networks Based UID (UID 기반 이기종 망 간 에서의 이동성 제공 알고리즘)

  • Kim, Dong Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.544-547
    • /
    • 2013
  • In this paper defined UID management, profile management, and they are also implemented and tested for interoperability in testbed including heterogeneous wireless networks environment. Also Architecture and roles of UID, Streaming Service Provider, information flows, unified profiles are studied, designed and implemented to be test. The study result include the functional architectures, requirements and main information flows of UID and Streaming Service Provider during roaming to heterogeneous wireless networks.

  • PDF

Agent-based Colored Petri Net Modeling of Grid Information Flows : Modeling of Wide Area Protection System (에이전트 기반 컬러 페트리 넷을 이용한 전력 계통의 정보 흐름 모델링: 광역 보호 시스템에의 적용)

  • Park, Byung-Sung;Hur, Kyeon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.7
    • /
    • pp.1347-1353
    • /
    • 2011
  • While most of the existing protection schemes have been designed with local information around individual components, these local schemes are not considered capable of protecting the modern electric power gird with growing complexity. Recent blackouts in North America and Europe have renewed the emphasis on coordinated protection and control actions to avoid systemwide blackouts, utilizing all of the available grid information. Thus, this paper proposes a new methodology, Agent-based Colored Petri Net (ACPN) modeling for systematically representing, modeling and analyzing information flows and interactions among the entities of the electric power grid. The paper demonstrates its efficacy and accuracy by investigating an ACPN model of a wide area protection system for a typical power grid. The proposed modeling and analysis schemes may further provide a framework to help assure reliability and interoperability of diverse smart grid components.

Advanced Flow Visualization Techniques for Diagnosing Microscale Biofluid Flows (미세 생체유동 해석을 위한 첨단 유동가시화기법)

  • Lee, Sang-Joon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.33 no.1
    • /
    • pp.1-8
    • /
    • 2009
  • Recently microscale biofluid flows have been receiving large attention in various research areas. However, most conventional imaging techniques are unsatisfactory due to difficulties encountered in the visualization of microscale biological flows. Recent advances in optics and digital image processing techniques have made it possible to develop several advanced micro-PIV/PTV techniques. They can be used to get quantitative velocity field information of various biofluid flows from visualized images of tracer particles. In this paper, as new advanced micro-PIV techniques suitable for biofluid flow analysis, the basic principle and typical applications of the time-resolved micro-PIV and X-ray micro-PIV methods are explained. As a 3D velocity field measurement technique for measuring microscale flows, holographic micro-PTV method is introduced. These advanced PIV/PTV techniques can be used to reveal the basic physics of various microscale biological flows and will play an important role in visualizing veiled biofluid flow phenomena, for which conventional methods have many difficulties to analyze.

Visualization of Passenger Flows of the Metropolitan Seoul Subway System (서울 수도권 지하철 교통망 승객 흐름의 시각화)

  • Kim, Ho-Sun;Park, Jong-Soo;Lee, Keum-Sook
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.4
    • /
    • pp.397-405
    • /
    • 2010
  • This study proposes visualization methods of the diurnal passenger flows on the Metropolitan Seoul Subway system (MSSs) and examines the passenger trip behaviors of major central business districts (CBDs). We mine the MSS passenger flow information from a single day T-card passenger trip transaction database. It is practically intractable to analyze such flows, involving huge, complex space-time data, by means of general statistical analysis. On the other hand, dynamic visualizations of the passenger flows make it possible to analyze intuitively and to grasp effectively characteristics of the passenger flows. We thus propose several methods to visualize the passenger flow information. In particular, we visualize dynamic passenger flows of each link on the subway network and analyze the time-space characteristics of passenger ridership for the three major CBDs. As the result, we can ascertain the strong association between CBD and subway line and clarify the distinction among three major CBDs in the diurnal patterns of subway passenger flow.