检索结果-内蒙古大学图书馆

16th International Conference on Transparent Optical Networks (ICTON)

作者： Vilalta, Ricard Munoz, Raul Casellas, Ramon Martinez, Ricardo CTTC Castelldefels 08860 Spain

ISBN: (纸本)9781479956012

We present the virtualization of multi-domain optical networks considered in the STRAUSS project. Novel resource allocation algorithms for virtual network embedding on Elastic Optical Networks (EON) are proposed. The devised algorithms focus on maximizing the link utilization and reducing the Virtual EONs (VEON) blocking rate. The algorithms have been evaluated in terms of three figures of merit, namely, the blocking rate, the link utilization and the processing time.

关键词： optical network virtualization elastic optical network resource allocation algorithms VEON GMPLS multi-domain resource broker

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Novel resource allocation algorithms for Virtual Elastic Optical Networks

Performance Evaluation of Novel Resource Allocation Algorith...

引用

International Conference on Transparent Optical Networks

作者： Ricard Vilalta Raul Munoz Ramon Casellas Ricardo Martinez Centre Tecnologic de Telecomunicacions de Catalunya (CTTC) 08860 Castelldefels Spain

ISBN: (纸本)9781479956029

关键词： optical network virtualization elastic optical network resource allocation algorithms VEON GMPLS multi-domain resource broker

来源：评论

学校读者我要写书评

暂无评论

On Optimizing resource allocation: A Comparative Review of resource allocation Strategies in HetNets

引用

CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES 2025年第3期142卷 2211-2245页

作者： Dobruna, Jeta Fazliu, Zana Limani Humar, Iztok Volk, Mojca Univ Ljubljana Fac Elect Engn Lab Telecommun Kongresni Trg 12 Ljubljana 1000 Slovenia Univ Prishtina Fac Elect & Comp Engn Telecommun Dept Str George Bush 31 Prishtina 10000 Kosovo

resource allocation remains a challenging issue in communication networks, and its complexity is continuously increasing with the densification of the networks. With the evolution of new wireless technologies such as Fifth Generation (5G) and Sixth Generation (6G) mobile networks, the service level requirements have become stricter and more heterogeneous depending on the use case. In this paper, we review a large body of literature on various resource allocation schemes that are used in particular in mobile wireless communication networks and compare the proposed schemes in terms of performance indicators as well as techniques used. Our review shows that among the strategies proposed in the literature, there is a wide variety of optimization targets and combinations thereof, focusing mainly on performance indicators such as energy efficiency, spectral efficiency, and network capacity. In addition, in this paper, selected algorithms for resource allocation are numerically analyzed through simulations to compare and highlight the importance of how the resource algorithms are implemented to achieve efficient usage of the available spectrum. The performance of selected algorithms is evaluated in a multi-cell heterogeneous network and compared to proportional fair and eICIC, a widely-used combination of resource allocation and interference mitigation techniques used by communication networks. The results show that one approach may perform better when looking at the individual average user data rate but worse when looking at the overall spectral or energy efficiency, depending on the category of traffic. The results, therefore, confirm that there may not be a single algorithm that visibly outperforms other candidates in terms of all performance criteria. Instead, their efficiency is always a consequence of a strategic choice of goals, and the targeted parameters are optimized at a price. Thus, the development and implementation of resource allocation algorithms must follo

关键词： resource allocation wireless communication heterogeneous networks resource allocation algorithms

来源：评论

学校读者我要写书评

暂无评论

algorithms for resource allocation in data transfer over EGPRS networks 2

Algorithms for resource allocation in data transfer over EGP...

引用

2nd European Conference on Universal Multiservice Networks

作者： Todinca, D Perry, P Murphy, J Dublin City Univ Sch Elect Engn Dublin 9 Ireland

ISBN: (纸本)0780374223

The third generation (3G) mobile system will be based on the Global System for Mobile communications (GSM) and will begin with the General Packet Radio Service (GPRS). Finally the additional channel capacity offered by the Enhanced Data-rates for Global Evolution (EDGE) will bring 3G services to users of these systems. This final system is often regarded as part of the 3G family and is referred to as Enhanced GPRS (EGPRS). Our goal is to investigate the efficiency of different algorithms used for resource allocation in data transfer over EGPRS networks. We consider a number of users in a cell that want either to send or to receive data and a centralized controller known as the packet control unit (PCU). The PCU is the part of the base station sub-system (BSS) which performs the arbitration mechanism to share the radio resources between users. The users can use nine different channel coding schemes, each one allowing a certain bit rate, but for the purposes of this discussion it is assumed that users can only use coding schemes one and two (CS1 and CS2) as a higher degree of flexibility is unimportant to this investigation. © 2002 IEEE.

关键词： wireless mobile GPRS enhanced GPRS resource allocation algorithms

来源：评论

学校读者我要写书评

暂无评论

Virtual Optical Network resource allocation Using PCE Global Concurrent Optimization for Dynamic Deployment of Virtual GMPLS-Controlled WSON

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING 2013年第12期5卷 1373-1381页

作者： Vilalta, Ricard Munoz, Raul Casellas, Ramon Martinez, Ricardo CTTC Castelldefels 08860 Spain

We present dynamic virtual optical network resource allocation (VON RA) algorithms for on-demand deployment of virtual wavelength switched optical networks (WSONs), which is handled by a resource broker with a virtual network topology manager (VNTM). The resource broker with VNTM dynamically configures and deploys independent instances of virtual WSONs over the same physical optical infrastructure and their own independent virtual generalized multiprotocol label switching control plane. The VON RA is computed by a path computation element using global concurrent optimization, which assigns the resources for the virtual optical links (e.g., wavelengths) and nodes. The experimental assessment and performance evaluation have been carried out in the ADRENALINE testbed. We discuss the obtained results on a National Science Foundation Network topology in terms of the VON request blocking rate and VON setup delay, which are used to compare the different proposed algorithms.

关键词： GMPLS/PCE Optical network virtualization resource allocation algorithms WSON

来源：评论

学校读者我要写书评

暂无评论

DIAMOND: a distributed algorithm for vertex coloring problems and resource allocation

引用

IET NETWORKS 2019年第6期8卷 381-389页

作者： Miri, Mohammadhasan Mohamedpour, Kamal Darmani, Yousef Sarkar, Mahasweta KN Toosi Univ Technol Dept ECE Tehran Iran San Diego State Univ Dept ECE San Diego CA 92182 USA

The vertex colouring problem (VCP) and its generalisations have myriad applications in computer networks. To solve the VCP with $\Delta + 1$Delta+1 colours, numerous distributed algorithms based on LOCAL model have been proposed to reduce time complexity (the number of rounds), where $\Delta $Delta is the maximum vertex degree in the graph. In this paper, the authors present a distributed algorithm based on modified LOCAL model (DIAMOND) that reduces the number of rounds to one. It greedily solves the VCP with at most $\Delta + 1$Delta+1 colours. Computational results on Geometry (GEOM) graphs show that the number of used colours to colour each instance using DIAMOND is about $\left({\Delta + 1} \right)/2$mml:mfenced close=")" open="("Delta+1/2. DIAMOND is easily extended to solve greedily generalised VCPs in only one round. Moreover, they present two efficient resource allocation algorithms using DIAMOND. They allocate more resource to the graph compared with $\lpar \Delta + 1\rpar $(Delta+1)-colouring and even to $\lpar \bar d + 1\rpar $(d over bar +1)-colouring algorithms, where $\bar d$d over bar is the average vertex degree of the graph. They run in two and $\Delta $Delta rounds.

关键词： graph colouring resource allocation distributed algorithms modified LOCAL model DIAMOND GEOM graphs vertex colouring problem myriad applications computer networks maximum vertex degree distributed algorithm resource allocation algorithms distributed algorithms greedily generalised VCP

来源：评论

学校读者我要写书评

暂无评论

Downlink resource allocation for Evolved UTRAN and WiMAX Cellular Systems

Downlink Resource Allocation for Evolved UTRAN and WiMAX Cel...

引用

19th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

作者： Jorguseski, L. Le, T. M. H. Fledderus, E. R. Prasad, R.

ISBN: (纸本)9781424426430

The future broadband wireless cellular systems Evolved UTRAN (E-UTRAN) and WiMAX are receiving a lot of interest in recent years. Both systems deploy Orthogonal Frequency Division Multiplex (OFDM) physical layer consisting of large number of mutually orthogonal sub-carriers. This physical layer provides high robustness against multi-path effects, high flexibility in allocation of the physical resources, high bandwidth scalability and relatively easy combination with Multiple-Input-Multiple-Output (MIMO) transmission and reception. In this study we investigate several algorithms for allocation of the downlink resources for E-UTRAN and WiMAX cellular systems. The goal of the study is to see the differences in downlink sector and user throughput, and user throughput versus distance from the reference base station for the resource allocation algorithms: Reuse-one, Reuse-three, Soft re-use, Reuse partitioning, Proportional Fair and Maximum C/I. Additionally, we observe the difference in performance between E-UTRAN and WiMAX under the conditions selected in this study. The evaluations are done via MATLAB simulations of a cellular system with one central three-sectored site surrounded with two tiers of interfering three-sector sites.

关键词： OFDM OFDMA E-UTRAN WiMAX downlink resource allocation resource allocation algorithms sector throughput user throughput user throughput versus distance

来源：评论

学校读者我要写书评

暂无评论

resource allocation and Computation Offloading in Cloud-Assisted Wireless Networks

Resource Allocation and Computation Offloading in Cloud-Assi...

引用

作者： Younis, Ayman Nasih Salman Rutgers The State University of New Jersey School of Graduate Studies

学位级别：Ph.D., Doctor of Philosophy

The next radio generations of mobile networks, Fifth Generation (5G) and beyond, are expected to speed up the transition from monolithic and inflexible networks to agile and distributed networking elements that rely on "virtualization", "softwarization", openness, intelligent and yet fully interoperable Radio Access Network (RAN) components. At the same time, the increasing popularity of computation-intensive applications on mobile devices has contributed to the overwhelming mobile traffic volume that is pushing against the boundary of the current communication networks' capacity. Besides, mobile platforms are becoming the predominant medium of access to Internet services due to a tremendous increase in their computation and communication capabilities. In light of this, cloud-assisted wireless networks are promising solutions that unite wireless networks and cloud computing to deliver cloud services directly from the network edges. The three emerging paradigms for cloud-assisted wireless networks are: Cloud Radio Access Network (C-RAN), in which the baseband resources are pooled at a Base Band Unit (BBU) based on the fundamentals of centralization and virtualization; Mobile-Edge Computing (MEC), which provides cloud computing and storage capabilities to enable rich services and applications in close proximity to the end-users; and Next Generation RAN (NG-RAN), in which the functional splitting technique is utilized to flexibly balance the radio and computation processes at Central Units (CUs) and Distributed Units (DUs). These paradigms are complementary and have unique justifications within the 5G and beyond ecosystem. The centralized nature of C-RAN provides a higher degree of cooperation in the network to address the capacity fluctuation and to increase the spectral and energy efficiency, whereas the MEC paradigm is useful in reducing service latency and improving localized user experience; on the other hand, NG-RAN provides flexible distribution of computation a

关键词： 5G Cloud radio access network Computation offloading Next generation radio access network resource allocation algorithms Wireless communications

来源：评论

学校读者我要写书评

暂无评论

Dynamic Multi-Domain Virtual Optical Network Deployment With Heterogeneous Control Domains

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING 2015年第1期7卷 135-141页

作者： Vilalta, Ricard Munoz, Raul Casellas, Ramon Martinez, Ricardo Peng, Shuping Channegowda, Mayur Vlachogiannis, Tasos Nejabati, Reza Simeonidou, Dimitra Cao, Xiaoyuan Tsuritani, Takehiro Morita, Itsuro CTTC Castelldefels 08860 Spain Univ Bristol High Performance Networks Grp Bristol BS8 1TH Avon England KDDI R&D Labs Inc Fujimino Saitama 3568502 Japan

We propose a multi-domain resource broker to dynamically provision multi-domain virtual optical networks across heterogeneous control domains (i.e., GMPLS and OpenFlow) and transport (i.e., optical packet switching and elastic optical networks) technologies. We have designed, implemented, and experimentally evaluated the multi-domain resource broker in an international test-bed across Spain, the UK, and Japan.

关键词： EON GMPLS/PCE OpenFlow OPS Optical network virtualization resource allocation algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast time-dependent evaluation of multi-service networks

引用

COMPUTER NETWORKS AND ISDN SYSTEMS 1998年第17-18期29卷 1999-2019页

作者： Matta, I Shankar, AU Northeastern Univ Coll Comp Sci Boston MA 02115 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA

We present a numerical-analytical method to evaluate multi-service networks with adaptive routing, scheduling and admission controls. We apply our method to connection-oriented networks supporting different types of real-time connections. The network dynamics is described by difference equations which can be solved for both transient and steady-state performances. Results indicate that our method is computationally much cheaper than discrete-event simulation, and yields accurate performance measures. Connection routing algorithms are usually evaluated individually in terms of steady-state performance measures. In this paper, we also use our time-dependent evaluation method to compare several connection routing schemes in terms of instantaneous measures. Our results show that a routing scheme which defines the cost of a path as the sum of measured link utilizations yields more stable behavior and lower connection blocking probability over a wide range of workload parameters and network configurations than other traditional schemes. (C) 1998 Elsevier Science B.V.

关键词： multi-service networks transient performance dynamic flow models queueing models resource allocation algorithms routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：