2019
DOI: 10.12783/dtcse/iteee2019/28732
|View full text |Cite
|
Sign up to set email alerts
|

Model of Distributing Heterogeneous Traffic Flows in a Software-Defined Network

Abstract: The article suggests transporting packets of heterogeneous traffic in a multi-service network on the basis of a Software Defined Networks (SDN). The optimization problem of transmitting flows of heterogeneous traffic at the level of the SDN infrastructure in case of its load is formulated. The criterion used is the total delay time of the threads. Development of algorithms for search and analysis of traffic flows.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Moreover, self-similarity conventions constructing these models assume some degrees of relative homogeneity associated with traffic distributed in a network. This assumption may generally not be valid in the majority of networks involving structural and/or data heterogeneity, including computer [5], social [6], ad-hoc [7], and software [8] ones. Machine learning techniques have also been explored to identify various traffic-driven aspects of networks [9], [10].…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, self-similarity conventions constructing these models assume some degrees of relative homogeneity associated with traffic distributed in a network. This assumption may generally not be valid in the majority of networks involving structural and/or data heterogeneity, including computer [5], social [6], ad-hoc [7], and software [8] ones. Machine learning techniques have also been explored to identify various traffic-driven aspects of networks [9], [10].…”
Section: A Related Workmentioning
confidence: 99%
“…According to Theorem 1, differential traffic divergence dynamics (8), in particular the case n = 1, may be rearranged as below for u and v and their adjacent nodes in N u and N v .…”
Section: Appendix D the Proof Of Theoremmentioning
confidence: 99%