• Title/Summary/Keyword: network flows

Search Result 515, Processing Time 0.021 seconds

A Machine Learning-based Real-time Monitoring System for Classification of Elephant Flows on KOREN

  • Akbar, Waleed;Rivera, Javier J.D.;Ahmed, Khan T.;Muhammad, Afaq;Song, Wang-Cheol
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2801-2815
    • /
    • 2022
  • With the advent and realization of Software Defined Network (SDN) architecture, many organizations are now shifting towards this paradigm. SDN brings more control, higher scalability, and serene elasticity. The SDN spontaneously changes the network configuration according to the dynamic network requirements inside the constrained environments. Therefore, a monitoring system that can monitor the physical and virtual entities is needed to operate this type of network technology with high efficiency and proficiency. In this manuscript, we propose a real-time monitoring system for data collection and visualization that includes the Prometheus, node exporter, and Grafana. A node exporter is configured on the physical devices to collect the physical and virtual entities resources utilization logs. A real-time Prometheus database is configured to collect and store the data from all the exporters. Furthermore, the Grafana is affixed with Prometheus to visualize the current network status and device provisioning. A monitoring system is deployed on the physical infrastructure of the KOREN topology. Data collected by the monitoring system is further pre-processed and restructured into a dataset. A monitoring system is further enhanced by including machine learning techniques applied on the formatted datasets to identify the elephant flows. Additionally, a Random Forest is trained on our generated labeled datasets, and the classification models' performance are verified using accuracy metrics.

A Queue Management Algorithm for Improving Fairness in a Private Network (사설 망의 공정성을 향상시키기 위한 큐 관리 알고리즘)

  • Kang, Tae-Hyung;Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.524-532
    • /
    • 2002
  • With the recent rapid progress of Internet, the higher speed network is needed to support the exploration of ambient information from text-based to multimedia-based information. Also, demands for additional Layer 3 routing technique, such as Network Address Translator (NAT) and Firewall, are required to solve a limitation of a current Internet address space and to protect the interior network from the exterior network. However, current router-based algorithms do not provide mechanisms to solve the congestion and fairness problems, while supporting the multimedia services and satisfying the user requirements. In this paper, to solve these problems, a new active queue management, called MFRED (Multiple Fairness RED) algorithm, is proposed. This algorithm can efficiently reduce the congestion in a router or gateway based on the Layer 3 routing technique, such as NAT. This algorithm can improve the fairness among TCP-like flows and unresponsive flows. It also works well in fairly protecting congestion-sensitive flows, i.e. fragile TCP, from congestion-insensitive or congestion-causing flows, i.e. robust TCP.

Analysis of Indeterminate Truss Structures by Element-Focused Network Approach (요소 중심의 네트워크 접근법을 이용한 부정정 트러스 구조 해석)

  • Han, Yicheol
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.58 no.3
    • /
    • pp.13-19
    • /
    • 2016
  • Element-focused network analysis method for truss structure is proposed. The propagation process of loads from external loads to connected other elements is similar to that of connections between nodes in accordance with attachment rule in a network. Here nodes indicate elements in a truss structure and edges represent propagated loads. Therefore, the flows of loads in a truss structure can be calculated using the network analysis method, and consequently the structure can also be analyzed. As a first step to analyze a truss structure as a network, we propose a local load transfer rule in accordance with the topology of elements, and then analyze the loads of the truss elements. Application of this method reveal that the internal loads and reactions caused by external loads can be accurately estimated. Consequently, truss structures can be considered as networks and network analysis method can be applied to further complex truss structures.

Cluster-based Cooperative Data Forwarding with Multi-radio Multi-channel for Multi-flow Wireless Networks

  • Aung, Cherry Ye;Ali, G.G. Md. Nawaz;Chong, Peter Han Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5149-5173
    • /
    • 2016
  • Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

Analysis of Regional Centrality by Investigating Direct and Indirect Flows of Commuters (통근통행에 의한 직·간접 흐름을 이용한 지역의 중심성 분석)

  • Lee, Jong-Sang;Seo, Ducksu
    • Journal of Agricultural Extension & Community Development
    • /
    • v.27 no.3
    • /
    • pp.125-134
    • /
    • 2020
  • The regional centrality plays a very important role in national and regional planning and it is measured by data such as people, goods, and information flows among regions. The inter-regional flows are usually considered by only direct flows, yet indirect flows, which are generated accordingly from direct flows, are not critically considered. Most centrality studies have also hardly reflected the indirect flow in the network analysis. This study demonstrates the significance of the indirect flows to enhance accuracy of the regional centrality. The nationwide dataset of inter-regional commuter traffic matrix is used in this study and analysed into two groups; one to consider only direct flow and the other both direct and indirect flows. The results indicate remarkable differences of centrality raking between two groups such as Yeongam of Jeonnam Province(+60th), Eumseong of Chungbuk Province(+57th), Gwacheon of Gyeonggi Province (-35th), and Nowon of Seoul (-32nd). It clearly shows the significant influence of indirect flow for regional centrality study. This also reveals regional centrality ranking in Korea by considering direct and indirect flows of commuters. Jung, Gangnam, and Jongno of Seoul are categorized in the highest rank group and Ulleung of Gyeongbuk, Ongjin of Incheon, and Jindo of Jeonnam are in the lowest group. The top group includes seven districts of Seoul, two of Busan, and one of Gyeonggi Province. The bottom group includes mostly island and costal areas. As this study shows an accurate method of centrality measurement, it has a significant implication to lead an effective regional planning.

A Global TraHlc Conool Architecture For Isolating Network Attacts h Highspeed Intemet Backbone Networle (인터넷 백본망상에서 네트워크 공격 고립을 위한 전역 트래픽 제어 구조)

  • 노병희
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5B
    • /
    • pp.491-497
    • /
    • 2004
  • In this Paper, we W a Hovel global traffic control architecture to isolate malicious network attacks and protect network infrastructure in Internet backbone networks. Unlike existing methods based on individual packets or flows, since the proposed detection and control methods are operated on the aggregate traffic level, the computational complexity can k significantly reduced, and they are applicable to develop a global defense architecture against network attack. Experimental results show that the proposed scheme can detect the network attack symptoms very exactly and quickly and protect the network resources as well as the normal traffic flows very efficiently.

A Study on the semantic network system of the line of flow appearing on the residential space of super high-rise apartments (초고층아파트 주거공간에 나타난 동선의 의미적 네트워크 체계에 관한 연구)

  • Yoon, Jae-Eun;Kim, Joo-Hee
    • Korean Institute of Interior Design Journal
    • /
    • v.16 no.3 s.62
    • /
    • pp.58-65
    • /
    • 2007
  • The residential space of super high-rise buildings, having a form of a huge three-dimensional vertical city, affect the residents psychologically and qualitatively according to the line of flow. Because of these affects, the system of the line of flows is a very important factor. In this study, we recognize the super high-rise apartment's line of flow as a semantic network system based on case studies. And we also understand the mutual relationship by analyzing each space to recognize what effect it does on the residential environment. Furthermore, to bring up a better semantic network system for super high-rise apartment's line of flows is our goal. According to the case studies, the semantic network of the line of flow consists of 3 parts: the functional network, economical network and unit network. The functional network is composed of the 'need' and 'has', while the economical network includes variable walls that can be changed following the user's taste and eccentric positioned living rooms that protect personal privacy. Therefore the economical network started to appear while the personal value changed according to the improvement of the social condition. Finally, the unit network is a network that effects each unit that has ambiguous boundaries due to the appropriate arrangement between transitional spaces. And the unit network is based on the functional network.

Relationships between Topological Structures of Traffic Flows on the Subway Networks and Land Use Patterns in the Metropolitan Seoul (수도권 지하철망 상 통행흐름의 위상학적 구조와 토지이용의 관계)

  • Lee, Keum-Sook;Hong, Ji-Yeon;Min, Hee-Hwa;Park, Jong-Soo
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.10 no.4
    • /
    • pp.427-443
    • /
    • 2007
  • The purpose of this study is to investigate spacio-temporal structures of traffic flows on the subway network in the Metropolitan Seoul, and the relationships between topological structures of traffic flows and land use patterns. In particular we analyze in the topological structures of traffic flows on the subway network in time dimension as well as in spatial dimension. For the purpose, this study utilizes data mining techniques to the one day T-card transaction data of the last four years, which has developed for exploring the characteristics of traffic flows from large scale trip-transaction databases. The topological structures of traffic flows on the subway network has changed considerably during the last four years. The volumes of traffic flows, the travel time and stops per trip have increased until 2006 and decreased again in 2007. The results are visualized by utilizing GIS and analyzed, and thus the spatial patterns of traffic flows are analyzed. The spatial distribution patterns of trip origins and destinations show substantial differences among time zones during a day. We analyze the relationships between traffic flows at subway stops and the geographical variables reflecting land use around them. We obtain 6 log-linear functions from stepwise multiple regression analysis. We test multicollinearity among the variables and autocollelation for the residuals.

  • PDF

Big Data Based Dynamic Flow Aggregation over 5G Network Slicing

  • Sun, Guolin;Mareri, Bruce;Liu, Guisong;Fang, Xiufen;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4717-4737
    • /
    • 2017
  • Today, smart grids, smart homes, smart water networks, and intelligent transportation, are infrastructure systems that connect our world more than we ever thought possible and are associated with a single concept, the Internet of Things (IoT). The number of devices connected to the IoT and hence the number of traffic flow increases continuously, as well as the emergence of new applications. Although cutting-edge hardware technology can be employed to achieve a fast implementation to handle this huge data streams, there will always be a limit on size of traffic supported by a given architecture. However, recent cloud-based big data technologies fortunately offer an ideal environment to handle this issue. Moreover, the ever-increasing high volume of traffic created on demand presents great challenges for flow management. As a solution, flow aggregation decreases the number of flows needed to be processed by the network. The previous works in the literature prove that most of aggregation strategies designed for smart grids aim at optimizing system operation performance. They consider a common identifier to aggregate traffic on each device, having its independent static aggregation policy. In this paper, we propose a dynamic approach to aggregate flows based on traffic characteristics and device preferences. Our algorithm runs on a big data platform to provide an end-to-end network visibility of flows, which performs high-speed and high-volume computations to identify the clusters of similar flows and aggregate massive number of mice flows into a few meta-flows. Compared with existing solutions, our approach dynamically aggregates large number of such small flows into fewer flows, based on traffic characteristics and access node preferences. Using this approach, we alleviate the problem of processing a large amount of micro flows, and also significantly improve the accuracy of meeting the access node QoS demands. We conducted experiments, using a dataset of up to 100,000 flows, and studied the performance of our algorithm analytically. The experimental results are presented to show the promising effectiveness and scalability of our proposed approach.

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