期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Optimising Energy Consumption in SD-DCN Networks (Software Defined-Data Center Network)
1
作者 Narcisse Tahi Etienne Soro +1 位作者 pacôme brou Olivier Asseu 《Open Journal of Applied Sciences》 2024年第8期2223-2235,共13页
Over the last decade, the rapid growth in traffic and the number of network devices has implicitly led to an increase in network energy consumption. In this context, a new paradigm has emerged, Software-Defined Networ... Over the last decade, the rapid growth in traffic and the number of network devices has implicitly led to an increase in network energy consumption. In this context, a new paradigm has emerged, Software-Defined Networking (SDN), which is an emerging technique that separates the control plane and the data plane of the deployed network, enabling centralized control of the network, while offering flexibility in data center network management. Some research work is moving in the direction of optimizing the energy consumption of SD-DCN, but still does not guarantee good performance and quality of service for SDN networks. To solve this problem, we propose a new mathematical model based on the principle of combinatorial optimization to dynamically solve the problem of activating and deactivating switches and unused links that consume energy in SDN networks while guaranteeing quality of service (QoS) and ensuring load balancing in the network. 展开更多
关键词 DCN Optimisation Energy Consumption QOS SDN
下载PDF
Dynamic Spectrum Access Protocol for the Digital Dividend
2
作者 Raoul Zamblé Raymond Gbégbé +2 位作者 Jean-Marie Kadjo Olivier Asseu pacôme brou 《Circuits and Systems》 2016年第13期4124-4144,共22页
It is not more and more, easy to satisfy the important and growing spectrum demands in the context of the static conventional policy spectrum allocation. Therefore, to find a suitable solution to this problem, we are ... It is not more and more, easy to satisfy the important and growing spectrum demands in the context of the static conventional policy spectrum allocation. Therefore, to find a suitable solution to this problem, we are to days observing the apparition of flexible dynamic spectrum allocation methods. These methods that ought to improve more significantly the spectrum use have gained much interest. In fact, the digital dividend due to the change-over from the analog television to the digital terrestrial television must be efficiently used. So the Dynamic Spectrum Access (DSA) can potentially play a key role in shaping the future digital dividend use. In the DSA, two kinds of users or networks coexist on different channels. The first one, known as the primary user, accesses to a channel with high priority;and the second one, known as secondary user has a low priority. This paper presents a dynamic spectrum access protocol based on an auction framework. Our protocol is an interesting tool that allows the networks to bid and obtain on the available spectrum, the rights to be primary and secondary users according their valuations and traffic needs. Based on certain offers, our protocol selects primary and secondary users for each idle channel in order to realize the maximum economic for the regulator or social benefits. We deal with the case in which the offers of the networks are independent one another even if they will share the same channels. We design an algorithm in accordance with our dynamic spectrum access protocol. The algorithm is used here to find an optimal solution to the access allocation problem, specifically to digital dividend. Finally, the results in the numeric section, regarding the three suggested scenarios, show that the proposed dynamic spectrum access protocol is viable. The algorithm is able to eliminate all non-compliant bidders for the available spectrum sharing. We notice that the revenue or social benefits of the regulator is maximized when we have on each channel, one primary user and the maximum number of secondary users. 展开更多
关键词 Dynamic Spectrum Access Protocol Centralized Spectrum Sharing Spectrum Auctions Digital Dividend
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部