• 제목/요약/키워드: network flows

검색결과 513건 처리시간 0.026초

Congestion Aware Fast Link Failure Recovery of SDN Network Based on Source Routing

  • Huang, Liaoruo;Shen, Qingguo;Shao, Wenjuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5200-5222
    • /
    • 2017
  • The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

수송공정을 고려한 다분기 공정-저장조 망구조의 최적설계 (Optimal Design of Multiperiod Process-Inventory Network Considering Transportation Processes)

  • 서근학;이경범
    • 제어로봇시스템학회논문지
    • /
    • 제18권9호
    • /
    • pp.854-862
    • /
    • 2012
  • The optimal design of batch-storage network by using periodic square wave model provides analytical lot sizing equations for a complex supply chain network characterized as multi-supplier, multi-product, multi-stage, non-serial, multi-customer, cyclic system including recycling and/or remanufacturing. The network structure includes multiple currency flows as well as material flows. The processes are represented by multiple feedstock/product materials with fixed composition which are very suitable for production processes. In this study, transportation processes that carry multiple materials with unknown composition are added and the time frame is changed from single period into multiple periods in order to represent nonperiodic parameter variations. The objective function of the optimization involves minimizing the opportunity costs of annualized capital investments and currency/material inventories minus the benefit to stockholders in the numeraire currency. The expressions for the Kuhn-Tucker conditions of the optimization problem are reduced to a multiperiod subproblem for average flow rates and analytical lot-sizing equations. The multiperiod lot sizing equations are different from single period ones. The effects of corporate income taxes, interest rates and exchange rates are incorporated.

철도화물서비스를 위한 Hub-and-spoke 운송전략의 적용과 평가: 유럽 사례를 중심으로 (An Application and Evaluation of Hub-and-spoke Strategy for Rail Freight Service in European Networks)

  • 정승주
    • 한국철도학회논문집
    • /
    • 제7권3호
    • /
    • pp.264-270
    • /
    • 2004
  • The hub-and-spoke strategy is widely used in the field of transportation. At the field of rail transportation, however, it is difficult that we find an application case of this strategy because of modal characteristics. According to the fast growth of containerization and the development of transshipment technology, presently, the hub-and-spoke strategy is introduced by operators on actual European rail freight transportation. However, it is hardly to find empirical studies evaluating the applicability of transportation strategy. In this context, this study analyzed the applicabilities of hub-and-spoke strategy in the actual network of European rail freight. For the application and evaluation of the characteristics of hub-and-spoke strategy, it utilized a service network design model for rail freight. Utilizing this model, it analyzed the efficiency of furnished rail freight services, the potential locations of hubs, the characteristics of O-D flows by the types of trains and service links, and the types of paths of O-D flows. Finally, it proposed some implications and the further study topics.

Fiber network with superhydrophilic Si-DLC coating

  • 김성진;문명운;이광렬;김호영
    • 한국진공학회:학술대회논문집
    • /
    • 한국진공학회 2009년도 제38회 동계학술대회 초록집
    • /
    • pp.363-363
    • /
    • 2010
  • The high capillarity of a plastic fiber network having superhydrophilic Si-DLC coating is studied. Although the superhydrophilic surface maximize wetting ability on the flat surface, there remains a requirement for the more wettable surface for various applications such as air-filters or liquid-filters. In this research, the PET non-woven fabric surface was realized by superhydrophilic coating. PTE non-woven fabric network was chosen due to its micro-pore structure, cheap price, and productivity. Superhydrophobic fiber network was prepared with a coating of oxgyen plasma treated Si-DLC films using plasma-enhanced chemical vapor deposition (PECVD). We first fabricated superhydrophilic fabric structure by using a polyethylene terephthalate (PET) non-woven fabric (NWF) coated with a nanostructured films of the Si-incorporated diamond-like carbon (Si-DLC) followed by the plasma dry etching with oxygen. The Si-DLC with oxygen plasma etching becomes a superhydrophilic and the Si-DLC coating have several advantages of easy coating procedure at room temperature, strong mechanical performance, and long-lasting property in superhydrophilicity. It was found that the superhydrophobic fiber network shows better wicking ability through micro-pores and enables water to have much faster spreading speed than merely superhydrophilic surface. Here, capillarity on superhydrophilic fabric structure is investigated from the spreading pattern of water flowing on the vertical surface in a gravitational field. As water flows on vertical flat solid surface always fall down in gravitational direction (i.e. gravity dominant flow), while water flows on vertical superhydrophilic fabric surface showed the capillary dominant spreading.

  • PDF

스텍앙상블과 인접 넷플로우를 활용한 침입 탐지 시스템 (Intrusion Detection System Utilizing Stack Ensemble and Adjacent Netflow)

  • 성지현;이권용;이상원;석민재;김세린;조학수
    • 정보보호학회논문지
    • /
    • 제33권6호
    • /
    • pp.1033-1042
    • /
    • 2023
  • 본 논문은 네트워크에서 침입 행위를 하는 플로우를 탐지하는 네트워크 침입 탐지 시스템을 제안한다. 대다수 연구에 활용되는 데이터세트는 시계열 정보를 포함하고 있지 않으며, 공격 사례가 적은 공격은 샘플 데이터 수가 부족해 탐지율 향상이 어렵다. 하지만 탐지 방안에 대해 연구 결과가 부족한 상황이다. 본 연구에서는 ANN(Artificial Neural Network) 모델과 스택 앙상블 기법을 활용한 선행 연구를 토대로 하였다. 앞서 언급한 문제점을 해결하기 위해 인접 플로우를 활용하여 시계열 정보를 추가하고 희소 공격의 샘플을 강화하여 학습하여 탐지율을 보강하였다.

랩온어칩 내부 미세유동 제어를 위한 새로운 장치의 개발 및 적용 (Development of A New Device for Controlling Infinitesimal Flows inside a Lab-On-A-Chip and Its Practical Application)

  • 김보람;김국배;이상준
    • 유체기계공업학회:학술대회논문집
    • /
    • 유체기계공업학회 2006년 제4회 한국유체공학학술대회 논문집
    • /
    • pp.305-308
    • /
    • 2006
  • For controlling micro-flows inside a LOC (lab-on-a-chip) a syringe pump or an electronic device for EOF(electro-osmotic flow) have been used in general. However, these devices are so large and heavy that they are burdensome in the development of a portable micro-TAS (total analysis system). In this study, a new flow control system employing pressure chambers, digital switches and speed controllers was developed. This system could effectively control the micro-scale flows inside a LOC without any mechanical actuators or electronic devices We also checked the feasibility of this new control system by applying it to a LOC of micro-mixer type. Performance tests show that the developed control system has very good performance. Because the flow rate in LOC is controlled easily by throttling the speed controller, the flows in complicate microchannels network can be also controlled precisely.

  • PDF

분산분해와 뎁트랭크를 활용한 정보흐름에 기반으로 시스템 위험 측정에 관한 실증연구 (An Empirical Study on Measuring Systemic Risk Based on Information Flows using Variance Decomposition and DebtRank)

  • 박아영;김호용;오갑진
    • 한국경영과학회지
    • /
    • 제40권4호
    • /
    • pp.35-48
    • /
    • 2015
  • We analyze the systemic risk based on the information flows using the variance decomposition, DebtRank methods, and the Industry Sector Indices during 2001. 01 to 2015. 08. Using the KOSPI stock market as our setting, we find that (i) the systemic risk calculated by information flows of variance decompositions method shows strong positive relations with the market volatility, (ii) the magnitude of systemic risk measured from the information flows network by DebtRank method increases after the subprime financial crisis.

차별화서비스 네트워크에서 흐름 관리를 위한 트래픽 제어 에이전트 (A traffic control agent to manage flow usage in Differentiated Service Network)

  • 이명섭;박창현
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 I
    • /
    • pp.69-72
    • /
    • 2003
  • This paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network.

  • PDF

Pickup Point 최적입지선정을 위한 Greedy Heuristic Algorithm 개발 및 적용: 서울 대도시권 지하철 시스템을 대상으로 (Greedy Heuristic Algorithm for the Optimal Location Allocation of Pickup Points: Application to the Metropolitan Seoul Subway System)

  • 박종수;이금숙
    • 한국경제지리학회지
    • /
    • 제14권2호
    • /
    • pp.116-128
    • /
    • 2011
  • 서울 수도권 지하철 승객이 인터넷으로 구매한 채소 등의 신선 식품을 퇴근하는 도중에 이동 경로상의 지하철역 구내의 서비스 시설물에서 배달 받는다고 가정하면, 제기되는 문제는 어떤 지하철역에 서비스 시설물을 설치하면 얼마나 많은 승객들이 이용하는 가를 파악하는 것이다. 이러한 문제는 픽업 문제로 알려져 있고, 픽업 문제를 풀려면 교통 흐름을 설명하는 교통 네트워크가 있어야 되고 각 교통 흐름의 이동 경로도 알 수 있어야 된다. 서울 수도권 교통카드 시스템의 교통카드 트랜잭션 데이터베이스로부터 지하철 승객의 출발역에서 도착역까지 움직이는 이동 경로인 승객 흐름을 구할 수 있으므로, 서울 수도권 지하철 교통 시스템에서 픽업 문제는 승객 흐름을 최대한 많이 포착하는 서비스 시설물들을 설치할 지하철역들을 선정하는 것이다. 본 논문에서 서울 수도권 지하철 시스템과 지하철 승객들의 흐름을 픽업 문제의 모델에 맞추어 수식화하였고, 이를 기반으로 하여 지하철 승객들의 흐름을 기종점 통행 행렬을 만들어 단계별로 가장 많은 통과 승객수를 갖는 픽업 역을 계산해내는 빠른 휴리스틱 알고리즘을 제안하였다. 대용량 교통 네트워크와 교통 흐름에 해당되는 약 400여 개의 지하철역을 가진 서울 수도권 지하철 네트워크와 약 500만 명의 지하철 교통카드 트랜잭션들을 입력으로 하여 제안된 알고리즘으로 선정된 픽업 역들을 빠른 시간 내에 얻었고, 그 중에서 상위 10개 픽업 역들을 지하철 안내 지도에 표시하여 설명하였다. 그리고, 그 결과가 거의 최적해와 같음을 추가 실험을 통하여 검증하였다.

  • PDF