Heterogeneous network capacity distribution among service flows

Lavriv, Orest; Buhyl, Bohdan; Huskov, Pavlo; Bak, Roman

doi:10.1109/cadsm.2017.7916107

Cited by 1 publication

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors of the current paper previously have proposed the method of service-oriented resource planning [8], the concept of service assurance in heterogeneous service-oriented systems [9] and methodological basis of heterogeneous network capacity distribution among service flows [10]. Based on the mentioned papers we performed a detail numerical analysis of the network resources allocation to the service flows using the representation of the problem as linear programming problem.…”

Section: Introductionmentioning

confidence: 99%

Maximization of Service Flows Rates as a Solution of Network Capacity Allocation Problem

Luntovskyy¹,

Bak

Huskov

et al. 2018

IoTEA

Self Cite

View full text Add to dashboard Cite

Abstract:The problem of network capacity allocation is a well-known problem in information and telecommunication area. Emerging set of new services such as cloud-based services, internet of things services, health care services, delivery support services are the key motivators of network capacity growth. In general, network capacity allocation is the static solution for general resources balancing dynamic problem. As far as user demands to change rapidly the network should be capable to support all traffic in accordance with service quality indicators. The solution of the formulated problem is the set of maximum rates of the corresponding service flows that compete with other service flows. This information is essential for the implementation of the service-oriented resource planning, as it enables to calculate the customers' audience if the values of services popularity and subscriber's distribution in the access network are predefined.

show abstract

Section: Introductionmentioning

confidence: 99%