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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,982 篇 会议
1,167 篇 期刊文献
19 篇 学位论文
3 册 图书

馆藏范围

3,171 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,607 篇 工学
- 2,043 篇 计算机科学与技术...
- 1,293 篇 信息与通信工程
- 1,229 篇 电气工程
- 727 篇 软件工程
- 119 篇 电子科学与技术（可...
- 68 篇 控制科学与工程
- 40 篇 动力工程及工程热...
- 36 篇 机械工程
- 35 篇 仪器科学与技术
- 30 篇 交通运输工程
- 19 篇 生物工程
- 15 篇 建筑学
- 15 篇 土木工程
- 13 篇 网络空间安全
- 11 篇 材料科学与工程（可...
- 11 篇 航空宇航科学与技...
- 9 篇 光学工程
- 9 篇 安全科学与工程
609 篇 理学
- 540 篇 数学
- 59 篇 物理学
- 35 篇 系统科学
- 32 篇 生物学
- 27 篇 统计学（可授理学、...
- 26 篇 化学
203 篇 管理学
- 181 篇 管理科学与工程(可...
- 98 篇 工商管理
- 29 篇 图书情报与档案管...
36 篇 经济学
- 36 篇 应用经济学
33 篇 法学
- 22 篇 社会学
- 12 篇 法学
3 篇 教育学
3 篇 医学
3 篇 艺术学
2 篇 文学

主题

3,171 篇 network function...
283 篇 cloud computing
278 篇 software defined...
202 篇 service function...
201 篇 resource managem...
190 篇 5g mobile commun...
184 篇 service function...
166 篇 computer archite...
165 篇 servers
139 篇 virtualization
137 篇 quality of servi...
136 篇 hardware
129 篇 optimization
122 篇 delays
121 篇 software
115 篇 software-defined...
113 篇 heuristic algori...
112 篇 routing
107 篇 network slicing
102 篇 conferences

机构

32 篇 beijing univ pos...
19 篇 kyoto univ grad ...
19 篇 kyoto univ grad ...
18 篇 paderborn univ p...
14 篇 georgia state un...
14 篇 state key labora...
14 篇 northeastern uni...
14 篇 northeastern uni...
13 篇 australian natl ...
13 篇 george washingto...
12 篇 northeastern uni...
12 篇 univ calif river...
12 篇 univ elect sci &...
11 篇 tsinghua univ in...
11 篇 univ s florida d...
11 篇 scuola super san...
11 篇 xidian univ stat...
10 篇 fudan univ sch c...
10 篇 univ elect sci &...
10 篇 dalian univ tech...

作者

50 篇 oki eiji
32 篇 taleb tarik
30 篇 he fujun
29 篇 karl holger
23 篇 sato takehiro
22 篇 tornatore massim...
22 篇 cao xiaojun
20 篇 wang xingwei
20 篇 zheng danyang
20 篇 liang weifa
20 篇 boutaba raouf
20 篇 peuster manuel
19 篇 cheng bo
18 篇 wood timothy
18 篇 huang min
17 篇 sun gang
17 篇 xu zichuan
16 篇 yue yi
15 篇 tavernier wouter
15 篇 riggio roberto

语言

3,127 篇 英文
30 篇 其他
11 篇 中文
1 篇 俄文
1 篇 土耳其文

检索条件"主题词=Network Function Virtualization"

共 3171 条记录，以下是111-120 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Towards Making network function virtualization a Cloud Computing Service 14

Towards Making Network Function Virtualization a Cloud Compu...

引用

IFIP/IEEE International Symposium on Integrated network Management (IM)

作者： Rankothge, Windhya Ma, Jiefei Le, Franck Russo, Alessandra Lobo, Jorge Univ Pompeu Fabra Barcelona Spain Imperial Coll London England IBM Res London England Univ Pompeu Fabra ICREA Barcelona Spain

ISBN: (纸本)9783901882760

By allowing network functions to be virtualized and run on commodity hardware, NFV enables new properties (e.g., elastic scaling), and new service models for Service Providers, Enterprises, and Telecommunication Service Providers. However, for NFV to be offered as a service, several research problems still need to be addressed. In this paper, we focus and propose a new service chaining algorithm. Existing solutions suffer two main limitations: First, existing proposals often rely on mixed Integer Linear Programming to optimize VM allocation and network management, but our experiments show that such approach is too slow taking hours to find a solution. Second, although existing proposals have considered the VM placement and network configuration jointly, they frequently assume the network configuration cannot be changed. Instead, we believe that both computing and network resources should be able to be updated concurrently for increased flexibility and to satisfy SLA and Qos requirements. As such, we formulate and propose a Genetic Algorithm based approach to solve the VM allocation and network management problem. We built an experimental NFV platform, and run a set of experiments. The results show that our proposed GA approach can compute configurations to to three orders of magnitude faster than traditional solutions.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

A QoS Assured network Service Chaining Algorithm in network function virtualization Architecture 15

A QoS Assured Network Service Chaining Algorithm in Network ...

引用

2015 15th IEEE ACM International Symposium on Cluster Cloud and Grid Computing (CCGrid 2015)

作者： Kim, Taekhee Kim, Siri Lee, Kwonyong Park, Sungyong Sogang Univ Dept Comp Sci & Engn Seoul South Korea

ISBN: (纸本)9781479980062

In the network function virtualization (NFV) architecture, network Service Chaining (NSC) is consisted in a certain order of network elements so that it can provide flexible network services to users. Due to the complexity of network infrastructure, creating a service chain requires high operation cost especially in carrier-grade network service providers and supporting stringent QoS requirements is also a challenge. Although several vendors provide various solutions for the NSC, there is only few information and the detailed algorithm or implementation logic is hidden. This paper presents an NSC algorithm in NFV that assures QoS from the perspective of service providers. In order to formulate NSC path selection problem, we apply the NP complete genetic algorithm. The evaluation results show that the proposed algorithm minimizes the operation cost of service providers by approximately 10.6% while the requested QoS targets is not violated.

关键词： network function virtualization network service chaining virtual network function genetic algorithm a QoS assured algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Theory of function Placement and Chaining for network function virtualization 18

On the Theory of Function Placement and Chaining for Network...

引用

19th ACM International Symposium on Mobile Ad-Hoc networking and Computing (Mobihoc)

作者： Zhang, Jinbei Wu, Weijie Lui, John C. S. Sun Yat Sen Univ Guangzhou Guangdong Peoples R China Huawei Labs 2012 Shenzhen Guangdong Peoples R China Chinese Univ Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450357708

network function virtualization (NFV) can significantly reduce the operation cost and speed up the deployment for network services to markets. Under NFV, a network service is composed by a chain of ordered virtual functions, or we call a "network function chain." A fundamental question is when given a number of network function chains, on which servers should we place these functions and how should we form a chain on these functions? This is challenging due to the intricate dependency relationship of functions and the intrinsic complex nature of the optimization. In this paper, we formulate the function placement and chaining problem as an integer optimization, where each variable is an indicator whether one service chain can be deployed on a configuration (or a possible function placement of a service chain). While this problem is generally NP-hard, our contribution is to show that it can be mapped to an exponential number of min-cost flow problems. Instead of solving all the min-cost problems, one can select a small number of mapped min-cost problems, which are likely to have a low cost. To achieve this, we relax the integer problem into a fractional linear problem, and theoretically prove that the fractional solutions possess some desirable properties, i.e., the number and the utilization of selected configurations can be upper and lower bounded, respectively. Based on such properties, we determine some "good" configurations selected from the fractional solution and determine the mapped min-cost flow problem, and this helps us to develop efficient algorithms for network function placement and chaining. Via extensive simulations, we show that our algorithms significantly outperform state-of-art algorithms and achieve near-optimal performance.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Gost: Enabling Efficient Spatio-Temporal GPU Sharing for network function virtualization 29

Gost: Enabling Efficient Spatio-Temporal GPU Sharing for Net...

引用

29th IEEE/ACM International Symposium on Quality of Service (IWQOS)

作者： Zhu, Andong Zeng, Deze Gu, Lin Li, Peng Chen, Quan China Univ Geosci Sch Comp Sci Wuhan Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan Peoples R China Univ Aizu Sch Comp Sci & Engn Aizu Wakamatsu Fukushima Japan Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China

ISBN: (纸本)9781665414944

network function virtualization (NFV) enables network functions to run on general-purpose servers, thus alleviates the reliance on dedicated hardware and significantly improves the scalability and flexibility in networking service provisioning. Meanwhile, it is recognized that Virtualized network functions (VNFs) suffer from serious performance problem. Graphics Processing Unit (GPU), with massive processing cores, has been advocated as a potential accelerator for improving the performance efficiency of VNFs. However, the special architecture of GPU makes existing CPU-oriented task scheduling strategies fail to be applied, limiting the acceleration potential of GPUs. To this end, we propose a GPU-oriented spatio-temporal sharing framework as Gost to improve the performance of GPU-accelerated VNFs. We also study how to minimize the end-to-end latency of VNF flows via careful scheduling on the execution order and the GPU resource allocation (i.e., the number of threads). We first formally describe the problem as a non-linear integer programming problem, which is then equivalently transformed into an integer linear programming (ILP) form. Considering the high computation complexity of solving ILP, we further propose a customized list scheduling based spatio-temporal GPU sharing strategy (LSSTG). We have practically implemented a prototype of Gost, based on which we also verify the high efficiency of LSSTG by extensive experiments.

关键词： network function virtualization GPU Acceleration Spatio-Temporal Sharing Task Scheduling

来源：评论

学校读者我要写书评

暂无评论

Leveraging OPC-UA Discovery by Software-defined networking and network function virtualization 14

Leveraging OPC-UA Discovery by Software-defined Networking a...

引用

14th IEEE International Workshop on Factory Communication Systems (WFCS)

作者： Henneke, Dominik Brozmann, Alex Wisniewski, Lukasz Jasperneite, Juergen Owl Univ Appl Sci InIT Inst Ind IT D-32657 Lemgo Germany Fraunhofer IOSB INA Applicat Ctr Ind Automat D-32657 Lemgo Germany

ISBN: (纸本)9781538610664

The discovery process of OPC Unified Architecture (OPC-UA) is well defined but lacks flexibility when implemented in large networks. While the standard provides concepts for local and global discovery services, the core assumption is that all clients and servers are aware of the discovery server(s) in the network. This dependency is a barrier for Plug-and-Play installations and is overcome by self announces via the multicast Domain Name System (mDNS), however, this scales badly with an increasing number of network nodes and deployed servers. We propose a discovery approach based on Software-Defined networking (SDN) and network function virtualization (NFV), that installs a plug-and-play mechanism for global OPC-UA discovery in modern virtualized networks.

关键词： Servers Protocols network function virtualization Production Process control Standards Prototypes

来源：评论

学校读者我要写书评

暂无评论

Stochastic Scheduling towards Cost Efficient network function virtualization in Edge Cloud 15

Stochastic Scheduling towards Cost Efficient Network Functio...

引用

15th IEEE Annual International Conference on Sensing, Communication, and networking (SECON)

作者： Zeng, Deze Zhang, Jie Gu, Lin Guo, Song China Univ Geosci Sch Comp Sci Wuhan Hubei Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan Hubei Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

ISBN: (纸本)9781538642818

network function virtualization (NFV) emerges as a promising technology to increase the network flexibility, customizability and efficiency by softwarizing traditional dedicated hardware based functions to virtualized network functions. The prosperous potential of edge cloud makes it an ideal platform to host the network functions. From the perspective of network service providers, an inevitable concern is how to reduce the overall cost for renting various resources from infrastructure providers. In this paper, unlike existing related studies assuming a preknown network traffic demand, we alternatively consider a practical case without any prior knowledge. We investigate how to dynamically minimize the overall operational cost with joint consideration of packet scheduling, network function management and resource allocation. The tradeoff between the queue backlog and overall cost is analyzed using a Lyapunov optimization framework. A backpressure based online scheduling algorithm is proposed and its efficiency is extensively evaluated by trace-driven simulations.

关键词： Servers Scheduling algorithms Cloud computing Scheduling network function virtualization Resource management Runtime

来源：评论

学校读者我要写书评

暂无评论

Optimization of Migration Cost for network function virtualization Replacement 21

Optimization of Migration Cost for Network Function Virtuali...

引用

21st International Arab Conference on Information Technology (ACIT)

作者： Shoura, Fadia Gharaibeh, Ammar Alouneh, Sahel German Jordanian Univ Dept Comp Engn Amman Jordan Al Ain Univ Coll Engn Abu Dhabi U Arab Emirates

ISBN: (纸本)9781728188553

Today's networks are concerned about making the control of communication flexible and improving the existing management systems in such a manner that reduces the Capital expenditures (CAPEX) and operating expenses (OPEX), through reducing equipment costs and energy efficiency. Along with the benefits of decreasing the time to promote new services to the clients, service providers' attention has gradually moved to network function virtualization (NFV), which is a potential technology decoupling network functionalities from hardware and is a promise of high performance service provision with optimizing resource utilization across various infrastructures. However, to simultaneously achieve these goals, sometimes it is necessary to instantiate a new function depending on the traffic pattern of high-bandwidth characteristics and Quality of Service (QoS) measures. Due to the limited resources at the node, other functions in the node may need to be migrated to other nodes in order to provide resources for the new functions. Existing works related to the Virtual network function (VNF) deployment and migration usually focus on proposing new deployment strategies and migration mechanisms. However, reducing migration cost restricted to memory, CPU, and bandwidth capacities is not considered in those studies. In this work, the problem of virtual network functions migration is formulated as an Integer Linear Program (ILP) with the objective of minimizing the migration cost while satisfying computing and network resource capacities constraints and selecting the minimum cost path from the source to the destination node. Since the ILP is NP-complete, we propose a greedy minimum migration cost (GMMC) algorithm. Simulation results show that the proposed GMMC algorithm can reduce the total migration cost by up to 61% and the number of migrations by up to 52% when compared to the state-of-the-art schemes.

关键词： Integer Linear Programming Migration Cost network function virtualization Optimization

来源：评论

学校读者我要写书评

暂无评论

Coded Computation Against Straggling Decoders for network function virtualization

Coded Computation Against Straggling Decoders for Network Fu...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Aliasgari, Malihe Kliewer, Jorg Simeone, Osvaldo New Jersey Inst Technol Helen & John C Hartmann Dept Elect & Comp Engn Newark NJ 07102 USA Kings Coll London Dept Informat London England

ISBN: (纸本)9781538647813

The uplink of a cloud radio access network architecture is studied in which decoding at the cloud takes place via network function virtualization (NFV) on commercial off-the-shelf (COTS) servers. In order to mitigate the impact of straggling decoders in the cloud computing platform, a novel coding strategy is proposed, whereby the cloud re-encodes the received frames via a linear code before distributing them to the decoding processors. Upper bounds on the resulting frame unavailability probability (FUP) as a function of the decoding latency are derived by assuming a binary symmetric channel for uplink communications. The bounds leverage large deviation results for correlated variables, and depend on the properties of both the uplink linear channel code adopted at the user and the NFV linear code applied at the cloud. Numerical examples demonstrate that the bounds are useful tools for code design, and that coding is instrumental in obtaining a desirable trade-off between FUP and decoding latency.

关键词： Coded computation network function virtualization C-RAN large deviation

来源：评论

学校读者我要写书评

暂无评论

Availability evaluation of the virtualized infrastructure manager in network function virtualization environments 26th

Availability evaluation of the virtualized infrastructure ma...

引用

26th European Safety and Reliability Conference, ESREL 2016

作者： Di Mauro, M. Longo, M. Postiglione, F. Restaino, R. Tambasco, M. University of Salerno FiscianoSA Italy Università degli Studi di di Salerno FiscianoSA Italy

ISBN: (纸本)9781138029972

The network function virtualization (NFV) initiative was launched in 2012 by the European Telecommunications Standard Institute (ETSI) and group of telecom companies and IT vendors to serve the network operators in deliver the network services in a more reliable, secure and fleixble way. Infact, just as a physical machine (equipped with operating system, CPU, memory etc.) can be virtualized by exploiting some virtualization platform, a network function (e.g. Firewall, Intrusion Detection System, Load Balancer etc.) can be virtualized and implemented by leveraging standard hardware resources. © 2017 Taylor & Francis Group, London.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Detection of Signaling System 7 Attack in network function virtualization using Machine Learning 15

Detection of Signaling System 7 Attack in Network Function V...

引用

15th International Bhurban Conference on Applied Sciences and Technology (IBCAST)

作者： Qasim, Tooba Durad, M. Hanif Khan, Asifullah Nazir, Farhan Qasim, Tehreem PIEAS Islamabad Pakistan Xflow Res Islamabad Pakistan Quaid I Azam Univ Islamabad Pakistan

ISBN: (纸本)9781538635643

The mass popularization of telecommunication services has led to a heavily loaded Signaling System No. 7 (SS7) network. SS7 was originally well protected because the communication networks were controlled by trusted state-owned telecom operators. Switching to the IP technology and deregulation has made it fairly easy for third parties to gain access to the once protected SS7 network. For many vendors, Signaling Transfer Points (STPs) have already evolved from TDM (Time Division Multiplexing) proprietary hardware to an IP proprietary hardware solution. So the next step is moving to a virtualized solution such as network function virtualization (NFV). The intersection of SS7 and NFV has also introduced several new security challenges. In this work, we present the vulnerabilities of SS7 messages to cyber-attacks in a virtualized environment. A network simulation model under SS7 attack is developed. In order to mitigate these attacks machine learning techniques are applied to the gathered network traffic.

关键词： SS7 Security network function virtualization Cyber security Machine Learning Mobile System Security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共318页 << < 8 9 10 11 12 13 14 15 16 17 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：