Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: matching theory

Sortuj według:

Ogranicz wyniki do:

Matching-Based Virtual Network Function Embedding for SDN-Enabled Power Distribution IoT

Li Xiaoyue, Chen Xiankai, Zhou Chaoqun, Liang Zilong, Liu Shubo, Yu Qiao

International Journal of Electronics and Telecommunications

2021

Vol. 67, No. 4

647--653

The power distribution internet of things (PD-IoT) has the complex network architecture, various emerging services, and the enormous number of terminal devices, which poses rigid requirements on substrate network infrastructure. However, the traditional PD-IoT has the characteristics of single network function, management and maintenance difficulties, and poor service flexibility, which makes it hard to meet the differentiated quality of service (QoS) requirements of different services. In this paper, we propose the software-defined networking (SDN)- enabled PD-IoT framework to improve network compatibility and flexibility, and investigate the virtual network function (VNF) embedding problem of service orchestration in PD-IoT. To solve the preference conflicts among different VNFs towards the network function node (NFV) and provide differentiated service for services in various priorities, a matching-based priority-aware VNF embedding (MPVE) algorithm is proposed to reduce energy consumption while minimizing the total task processing delay. Simulation results demonstrate that MPVE significantly outperforms existing matching algorithm and random matching algorithm in terms of delay and energy consumption while ensuring the task processing requirements of high-priority services.

Spaced Seed Design Using Perfect Rulers

Egidi L., Manzini G.

Fundamenta Informaticae

2014

Vol. 131, nr 2

187--203

A widely used class of approximate pattern matching algorithms work in two stages, the first being a filtering stage that uses spaced seeds to quickly discards regions where a match is not likely to occur. The design of effective spaced seeds is known to be a hard problem. In this setting, we propose a family of lossless spaced seeds for matching with up to two errors based on mathematical objects known as perfect rulers. We analyze these seeds with respect to the tradeoff they offer between seed weight and the minimum length of the pattern to be matched. We identify a specific property of rulers, namely their skewness, which is closely related to the minimum pattern length of the derived seeds. In this context, we study in depth the specific case of Wichmann rulers and investigate the generalization of our approach to the larger class of unrestricted rulers. Although our analysis is mainly of theoretical interest, we show that for pattern lengths of practical relevance our seeds have a larger weight, hence a better filtration efficiency, than the ones known in the literature.