Online multicast routing with bandwidth guarantees: A new approach using multicast network flow

2003 ◽  
Vol 11 (4) ◽  
pp. 676-686 ◽  
Author(s):  
M. Kodialam ◽  
T.V. Lakshman ◽  
S. Sengupta
Keyword(s):  
Network Flow ◽  
Multicast Routing ◽  
New Approach ◽  
Bandwidth Guarantees

Domain Constrained Multicast: A New Approach for IP Multicast Routing

2004 ◽  
Vol 27 (2-4) ◽  
pp. 207-227 ◽  
Author(s):  
Norihiro Ishikawa ◽  
Hironori Fujiwara ◽  
Hidetoshi Ueno ◽  
Hideharu Suzuki ◽  
Osamu Takahashi
Keyword(s):  
Multicast Routing ◽  
Ip Multicast ◽  
New Approach

scholarly journals Multi-Criteria Analysis and Prediction of Network Incidents Using Monitoring System

2017 ◽  
Vol 1 (1) ◽  
pp. 29 ◽  
Author(s):  
Lukas Macura ◽  
Miroslav Voznak
Keyword(s):  
Monitoring System ◽  
Network Flow ◽  
Flow Analysis ◽  
Mathematical Methods ◽  
New Approach ◽  
Creative Commons ◽  
Data Flows ◽  
Data Correlations ◽  
Computationally Intensive ◽  
Network Technologies

Today, network technologies can handle throughputs up to 100Gbps, transporting 200 million packets per second on a single link. Such high bandwidths impact network flow analysis and as a result require significantly more powerful hardware. Methods used today concentrate mainly on analyzes of data flows and patterns. It is nearly impossible to actively look for anomalies in network packets and flows for a small amount of change of monitoring patterns could result in big increases in potentially false positive incidents. This paper focuses on multi-criteria analyzes of systems generated data in order to predict incidents. We prove that systems generated monitoring data are an appropriate source to analyze and enable for much more focused and less computationally intensive monitoring operations. By using appropriate mathematical methods to analyze stored data it is possible to obtain useful information. During our work, some interesting anomalies in networks were found by utilizing simple data correlations using monitoring system Zabbix. We concluded that it is possible to declare that deeper analysis is possible due to Zabbix monitoring system and its features like Open-Source core, documented API and SQL backend for data. The result of this work is a new approach to the analysis containing algorithms which allow to identify significant items in monitoring system. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

scholarly journals Understanding socialbot behavior on end hosts

2017 ◽  
Vol 13 (2) ◽  
pp. 155014771769417 ◽  
Author(s):  
Yukun He ◽  
Qiang Li ◽  
Jian Cao ◽  
Yuede Ji ◽  
Dong Guo
Keyword(s):  
Online Social Networks ◽  
Network Flow ◽  
Online Social Network ◽  
New Approach ◽  
Server Side ◽  
System Calls ◽  
Detection Approach ◽  
Flow Through ◽  
Future 2 ◽  
Insight Into

Server-side socialbot detection approaches can identify malicious accounts and spams in online social networks. However, they cannot detect socialbot processes, residing on user hosts, which control these accounts. Therefore, new approaches are needed to detect socialbots on hosts. The fundamental to design host-side detecting approaches is to gain an insight into the behaviors of socialbots on host. In this article, we analyzed a series of representative socialbots in depth and summarized the typical features of socialbot behaviors. We proposed a new approach to defense against socialbots on end host. The contributions of this article are threefold: (1) our analysis approach can be used for reference during analyzing new socialbots in the future; (2) we provide several behavior features of socialbots on hosts, including network flow through which socialbots communicate with botmasters through the online social network, system calls via which socialbots conduct an activity, and process information of socialbots running on hosts. These features can be used by someone to design approaches to identifying socialbots on a host; (3) our proposed detection approach can effectively distinguish between a socialbot and a benign application on end hosts.

A NEW APPROACH FOR CENTRALIZED END-SYSTEM MULTICAST PROTOCOL

2006 ◽  
Vol 03 (01) ◽  
pp. 77-84 ◽  
Author(s):  
AYMAN EL-SAYED
Keyword(s):  
Load Balance ◽  
Multicast Routing ◽  
Group Communication ◽  
Communication Service ◽  
New Approach ◽  
Multicast Protocol ◽  
Group Control ◽  
Application Level Multicast ◽  
Single Host ◽  
Group Members

In this paper we propose a new approach of application-level multicast protocol providing a group communication service. This protocol, called End-System Multicast (ESM), and can be used when native multicast routing is not available. ESM is a centralized protocol where everything is being controlled by a single host called Rendez-vous point (RPL1), connected indirectly to the group members via some hosts called secondary Rendez-vous Point (RPL2). Each RPL2 has some group members that constitute a cluster, and each cluster is controlled by its RPL2. Since the group control is divided among some RPL2 and a main controller (RPL1) manages the relation among RPL2 s and between itself and RPL2 s , we found that the scalability is improved and it also avoids the bottleneck problem near the RPL1, or there is a load balance.

Online multicast routing with bandwidth guarantees

2000 ◽  
Vol 28 (1) ◽  
pp. 296-306 ◽  
Author(s):  
Murali S. Kodialam ◽  
T. V. Lakshman ◽  
Sudipta Sengupta
Keyword(s):  
Multicast Routing ◽  
Bandwidth Guarantees

scholarly journals HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES

2000 ◽  
Vol 10 (03) ◽  
pp. 285-307 ◽  
Author(s):  
MATTHIAS MÜLLER–HANNEMANN
Keyword(s):  
Network Flow ◽  
Local Density ◽  
Dimensional Space ◽  
Linear Equations ◽  
Three Dimensional ◽  
Minimum Cost ◽  
Second Phase ◽  
Mesh Quality ◽  
New Approach ◽  
Flow Techniques

We investigate a purely combinatorial approach to the following mesh refinement problem: Given a coarse mesh of polygons in three-dimensional space, find a decomposition into well-shaped quadrilaterals such that the resulting mesh is conforming and satisfies prescribed local density constraints. We present a new approach based on network flow techniques. In particular, we show that this problem can efficiently be solved by a reduction to a minimum cost bidirected flow problem, if the mesh does not contain branching edges, that is, edges incident to more than two polygons. This approach handles optimization criteria such as density, angles and regularity. In our model we get rid of restrictions on the set of feasible solutions imposed by templates. On the other hand, we still use advantages of general templates with respect to mesh quality for the individual refinement of the mesh polygons. For meshes with branchings, the problem is feasible if and only if a certain system of linear equations over GF(2) has a solution. To enhance the mesh quality for meshes with branchings, we introduce a two-stage approach which first decomposes the whole mesh into components without branchings, and then uses minimum cost bidirected flows on the components in a second phase. We report on our computational results which indicate that this approach usually leads to a very high mesh quality.

Sign in / Sign up

Export Citation Format

Share Document