• Complex
  • Title
  • Author
  • Keyword
  • Abstract
  • Scholars
Export Sort by:
Default
  • Default
  • Title
  • Year
  • WOS Cited Count
  • Impact factor
  • Ascending
  • Descending
< Page ,Total 4 >
Hierarchical resource distribution network based on mobile edge computing EI Scopus
会议论文 | 2018 , 2017-December , 57-64 | 23rd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2017
Abstract&Keyword Cite

Abstract :

Mobile edge computing (MEC) is an emerging paradigm to support the proliferation of smart phones and recent outstanding mobile data traffic growth. The network edge devices with computation, communication and storage capabilities can be applied to cache popular resource in close proximity to end uses and directly distribute resource to them, which is a promising solution to provide enhanced service. Firstly, in order to respond to the users' access requests at the edge of network, the distributed resource distribution network (DRDN) is constructed to realize the quick query, positioning and distribution of resource. It mainly consists of network elements: NEF (Network Exposure Function) node for global management and MEC nodes for distribution service. Secondly, on the basis of DRDN, two kinds of MEC's service models of distributing resource are defined and classified, the total energy consumption and average service delay for distributing resource to end users are analyzed. Finally, for the heavy access load and high latency of root caching MEC node, a hierarchical caching scheme (HCS) is designed and a caching node selection algorithm based on fuzzy C-means clustering is proposed according to the location characteristics of end users. The simulation results show that the HCS can save a lot of energy and reduce the average service delay. Additionally, for the different total arrival rate of users' access requests, the change of average service delay is stable with good adaptability in the HCS. © 2017 IEEE.

Keyword :

Caching resource Distributed resources Distribution services Fuzzy C means clustering Mobile Edge Computing Node selection algorithms Service delays Total energy consumption

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Ren, Dewang , Gui, Xiaolin , Dai, Huijun et al. Hierarchical resource distribution network based on mobile edge computing [C] . 2018 : 57-64 .
MLA Ren, Dewang et al. "Hierarchical resource distribution network based on mobile edge computing" . (2018) : 57-64 .
APA Ren, Dewang , Gui, Xiaolin , Dai, Huijun , An, Jian , Liang, Xin , Lu, Wei et al. Hierarchical resource distribution network based on mobile edge computing . (2018) : 57-64 .
Export to NoteExpress RIS BibTex
Cross-VM Cache Side Channel Attacks in Cloud: A Survey EI Scopus CSCD PKU
期刊论文 | 2017 , 40 (2) , 317-336 | Jisuanji Xuebao/Chinese Journal of Computers
Abstract&Keyword Cite

Abstract :

In cloud-computing, virtual machines(VMs)of different tenants might be scheduled to run on the same physical machine, namely VMs co-residency. Co-resident VMs would share the underlying computing resources of the physical machine, relying on the virtual machine monitor to allocate and schedule system resources. Cross-domain sharing of underlying computing resources, albeit improving the utilization efficiency of available resources extremely, poses a serious threat to users' privacy concerns. A malicious VM could break the isolation mechanism and extract private information from other co-resident VMs, simply by probing the responses of shared resources and establishing a special leakage model. This attack pattern described above is usually called side-channel attacks. This paper deeply studied the mechanism and implementation of cross-VM cache side-channel attacks, and summarized its research status and advances. First, the essential cause of cache-based side-channel information leakage is analyzed and summarized. Next, the origin and research progress of cross-VM cache side-channel attacks are reviewed, the differences and relations between classic cache side-channel attacks and cross-VM cache side-channel attacks are discussed, followed by presentation of the universal model of access-driven cross-VM cache side-channel attacks. Then, the related issues of VMs co-residency and the latest mainstream methods for cross-VM cache-based side-channel information probing are categorized and expounded in detail. Finally, the current problems existing in the research and the future research directions of this field are presented. © 2017, Science Press. All right reserved.

Keyword :

Cache Computing resource Future research directions Private information Side-channel information Utilization efficiency Virtual machine monitors VMs co-residency

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Liang, Xin , Gui, Xiao-Lin , Dai, Hui-Jun et al. Cross-VM Cache Side Channel Attacks in Cloud: A Survey [J]. | Jisuanji Xuebao/Chinese Journal of Computers , 2017 , 40 (2) : 317-336 .
MLA Liang, Xin et al. "Cross-VM Cache Side Channel Attacks in Cloud: A Survey" . | Jisuanji Xuebao/Chinese Journal of Computers 40 . 2 (2017) : 317-336 .
APA Liang, Xin , Gui, Xiao-Lin , Dai, Hui-Jun , Zhang, Chen . Cross-VM Cache Side Channel Attacks in Cloud: A Survey . | Jisuanji Xuebao/Chinese Journal of Computers , 2017 , 40 (2) , 317-336 .
Export to NoteExpress RIS BibTex
RT-Vivaldi: A Symmetric & Equality RTT Prediction Algorithm in Networks EI Scopus
会议论文 | 2017 , 129-133 | 21st International Conference on Control Systems and Computer Science, CSCS 2017
Abstract&Keyword Cite

Abstract :

Predicting network round-trip times (RTT) between nodes is difficult because of the asymmetric and unequal network features. The phenomenon of Triangle Inequality Violation (TIV) can seriously affect the results in prediction. The traditional Vivaldi algorithm has a low accuracy and an unsteady convergence rate. In this paper, a novel Restrained TIV Vivaldi (RT-Vivaldi) algorithm is proposed. Firstly, the TIV is analyzed to set a triangle detection and suppression coefficient. The coefficient is defined to correct the asymmetric and unequal influence on the TIV. Multiple reference neighbor nodes are set based on the distances between them and then dynamically update the parameters to eliminate the effects of the links with the various lengths. Finally, simulations have proven that the proposed RT-Vivaldi algorithm has a higher accuracy and a greater stability than those traditional algorithms. © 2017 IEEE.

Keyword :

Coefficient Convergence rates Multiple references Network features Prediction algorithms Triangle detections Triangle inequality violations Vivaldi

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Dai, Huijun , Dai, Zhaosheng , Gui, Xiaolin et al. RT-Vivaldi: A Symmetric & Equality RTT Prediction Algorithm in Networks [C] . 2017 : 129-133 .
MLA Dai, Huijun et al. "RT-Vivaldi: A Symmetric & Equality RTT Prediction Algorithm in Networks" . (2017) : 129-133 .
APA Dai, Huijun , Dai, Zhaosheng , Gui, Xiaolin , Zhu, Min , Zhong, Kuncai , Liu, Shuming . RT-Vivaldi: A Symmetric & Equality RTT Prediction Algorithm in Networks . (2017) : 129-133 .
Export to NoteExpress RIS BibTex
Intimacy Relationship Quantification Method among Nodes Based on Social Attributes in Crowd Sensing EI Scopus CSCD PKU
期刊论文 | 2017 , 51 (6) , 73-78 | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University
Abstract&Keyword Cite

Abstract :

A new method, called social-based nodes intimacy quantification method (SNIQ), is proposed to solve the problem of unclear hierarchy and rough associated attribute description in nodes social relationships quantification. A formal representation of social attributes is presented by means of static semantic hierarchy tree and spatial index coding to analyze multi-dimension factors that influence nodes social relationship. The asymmetry of social relations of nodes is reasonably evaluated by introducing the interactive information entropy. Furthermore, analytic hierarchy process (AHP) is used to achieve two-level judgment and effective aggregation of node dynamic attributes, and a fusion degree of nodes is introduced to dynamically modify intimacy relationships of nodes. Experimental results show that SNIQ is better than the traditional algorithms in accuracy and recall rate in the process of getting nodes intimacy relationships, and effectively improves the success rate of nodes selection in crowd sensing. Comparisons with the existing algorithms show that the proposed SNIQ achieves 14.67% improvement in prediction accuracy. © 2017, Editorial Office of Journal of Xi'an Jiaotong University. All right reserved.

Keyword :

Crowd sensing Intimacy relationships Node fusion degree Social attributes Social relationships

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Wendong , Gui, Xiaolin , Cai, Ningchao et al. Intimacy Relationship Quantification Method among Nodes Based on Social Attributes in Crowd Sensing [J]. | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University , 2017 , 51 (6) : 73-78 .
MLA Zhang, Wendong et al. "Intimacy Relationship Quantification Method among Nodes Based on Social Attributes in Crowd Sensing" . | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University 51 . 6 (2017) : 73-78 .
APA Zhang, Wendong , Gui, Xiaolin , Cai, Ningchao , An, Jian . Intimacy Relationship Quantification Method among Nodes Based on Social Attributes in Crowd Sensing . | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University , 2017 , 51 (6) , 73-78 .
Export to NoteExpress RIS BibTex
群智感知中采用节点社会属性的亲密度量化方法 CSCD PKU
期刊论文 | 2017 , (6) , 73-78 | 西安交通大学学报
Abstract&Keyword Cite

Keyword :

群智感知 亲密度 社会关系量化 社会属性 节点融合度

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 张文东 , 桂小林 , 蔡宁超 et al. 群智感知中采用节点社会属性的亲密度量化方法 [J]. | 西安交通大学学报 , 2017 , (6) : 73-78 .
MLA 张文东 et al. "群智感知中采用节点社会属性的亲密度量化方法" . | 西安交通大学学报 6 (2017) : 73-78 .
APA 张文东 , 桂小林 , 蔡宁超 , 安健 . 群智感知中采用节点社会属性的亲密度量化方法 . | 西安交通大学学报 , 2017 , (6) , 73-78 .
Export to NoteExpress RIS BibTex
支持轨迹隐私保护的两阶段用户兴趣区构建方法 CSCD PKU
期刊论文 | 2017 , (12) | 计算机学报
Abstract&Keyword Cite

Keyword :

用户兴趣区 空间数据 数据聚类 时间序列 轨迹隐私

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 冀亚丽 , 桂小林 , 戴慧珺 et al. 支持轨迹隐私保护的两阶段用户兴趣区构建方法 [J]. | 计算机学报 , 2017 , (12) .
MLA 冀亚丽 et al. "支持轨迹隐私保护的两阶段用户兴趣区构建方法" . | 计算机学报 12 (2017) .
APA 冀亚丽 , 桂小林 , 戴慧珺 , 彭振龙 . 支持轨迹隐私保护的两阶段用户兴趣区构建方法 . | 计算机学报 , 2017 , (12) .
Export to NoteExpress RIS BibTex
基于伸展树的文件数据缓存管理策略研究 CSCD PKU
期刊论文 | 2016 , (9) , 131-134 | 计算机科学
Abstract&Keyword Cite

Abstract :

针对企业内部网络存储,研究并提出了一种基于伸展树的缓存管理策略,以对网络缓存空间进行组织和管理.在内部网络存储缓存链的基础上,引入并改进了伸展树结构和操作,将改进后的伸展树作为缓存节点数据组织和管理的索引结构,分析并设计了基于伸展树的文件数据缓存管理策略.实验结果表明,基于伸展树算法的缓存管理策略提高了缓存空间利用率和用户访问数据的效率,有较好的实时性.

Keyword :

缓存链 伸展树 缓存管理 替换价值度

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 姚智海 , 徐宏喆 , 李文 et al. 基于伸展树的文件数据缓存管理策略研究 [J]. | 计算机科学 , 2016 , (9) : 131-134 .
MLA 姚智海 et al. "基于伸展树的文件数据缓存管理策略研究" . | 计算机科学 9 (2016) : 131-134 .
APA 姚智海 , 徐宏喆 , 李文 , 吴夏 . 基于伸展树的文件数据缓存管理策略研究 . | 计算机科学 , 2016 , (9) , 131-134 .
Export to NoteExpress RIS BibTex
群智感知中基于反拍卖模型的众包激励方法 CSCD PKU
期刊论文 | 2016 , (7) | 计算机应用
Abstract&Keyword Cite

Keyword :

群智感知 激励机制 Vickrey拍卖 反拍卖 众包

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 朱旋 , 杨麦顺 , 安健 et al. 群智感知中基于反拍卖模型的众包激励方法 [J]. | 计算机应用 , 2016 , (7) .
MLA 朱旋 et al. "群智感知中基于反拍卖模型的众包激励方法" . | 计算机应用 7 (2016) .
APA 朱旋 , 杨麦顺 , 安健 , 向乐乐 , 杨蔷薇 . 群智感知中基于反拍卖模型的众包激励方法 . | 计算机应用 , 2016 , (7) .
Export to NoteExpress RIS BibTex
Overlapping community detection algorithm based on fuzzy hierarchical clustering in social network EI Scopus CSCD PKU
期刊论文 | 2015 , 49 (2) , 6-13 | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University
Abstract&Keyword Cite

Abstract :

A detection algorithm for overlapping communities based on fuzzy hierarchical clustering, CDHC, is proposed to detect the overlapping communities and to solve the fuzzy and hierarchical relationships among communities in social networks. The algorithm first utilizes the distance weighting factors to calculate the similarity among communities, and the communities with similarity larger than a given threshold are then merged together. The membership grade of each node for the merged community is computed and nodes with membership grades less than a given threshold are removed from the community to form a structure of the final overlapping community. The algorithm can not only detect the overlapping communities, but also detect the isolated nodes. The effectiveness of the proposed algorithm is tested through comparing it with two existing overlapping community detection algorithms, CMP and LFM, on the Lancichinetti synthetic network and real network datasets. Results show that the size of network and size of communities have little effect on accuracy of detecting communities, and the main factor to affect the accuracy is the mixed degree among communities. The detection accuracy of the CDHC on social networks with small communities is higher than that of LFM, and it is better than CMP on networks with large communities. The CDHC algorithm improves the detection accuracy while its stability is good. Therefore, it can be concluded that the CDHC is an effective overlapping community detection algorithm for social networks. ©, 2015, Xi'an Jiaotong University. All right reserved.

Keyword :

Detection accuracy Detection algorithm Distance-weighting Hier-archical clustering Overlapping communities Overlapping community detections Similarity Synthetic networks

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Li, Liuqiang , Gui, Xiaolin , An, Jian et al. Overlapping community detection algorithm based on fuzzy hierarchical clustering in social network [J]. | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University , 2015 , 49 (2) : 6-13 .
MLA Li, Liuqiang et al. "Overlapping community detection algorithm based on fuzzy hierarchical clustering in social network" . | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University 49 . 2 (2015) : 6-13 .
APA Li, Liuqiang , Gui, Xiaolin , An, Jian , Sun, Yu . Overlapping community detection algorithm based on fuzzy hierarchical clustering in social network . | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University , 2015 , 49 (2) , 6-13 .
Export to NoteExpress RIS BibTex
Privacy preservation for location-based services: a survey EI Scopus CSCD PKU
期刊论文 | 2015 , 26 (9) , 2373-2395 | Ruan Jian Xue Bao/Journal of Software
Abstract&Keyword Cite

Abstract :

Location-based service (LBS) has recently become popular in almost all social and business fields due to the boom of location-aware mobile electronic devices. LBS, albeit providing enormous benefits to individuals and society, poses a serious threat to users' privacy as they are enticed to disclose their locations and query attributes to untrusted LBS providers via their LBS queries. Moreover, the contextual information attached to these locations and service attributes can reveal users' personal interests, life styles, health conditions, etc. How to preserve users' privacy against potentially malicious LBS providers is of vital importance to the well-being of LBS ecosystem, and as such, it attracts great attentions from many researchers. This paper provides a review of the state-of-the-art of privacy preserving for LBS. First, the concept and threat model of LBS privacy are presented. Then, the existing schemes for preserving users' LBS privacy are described in detail from the aspects of architecture, metric and technology. Next, a pointed discussion is placed on the latest mainstream technology, with emphasis on the distortion-based technology. Further, following a comprehensive comparison and analysis of the performance and defects of various technologies, the problems and possible solutions for LBS privacy preserving are pointed out. Finally, some future research directions are provided. © Copyright 2015, Institute of Software, the Chinese Academy of Sciences. All right reserved.

Keyword :

Comprehensive comparisons Contextual information Future research directions Location privacy Privacy preservation Privacy quantification Query privacy Various technologies

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Xue-Jun , Gui, Xiao-Lin , Wu, Zhong-Dong . Privacy preservation for location-based services: a survey [J]. | Ruan Jian Xue Bao/Journal of Software , 2015 , 26 (9) : 2373-2395 .
MLA Zhang, Xue-Jun et al. "Privacy preservation for location-based services: a survey" . | Ruan Jian Xue Bao/Journal of Software 26 . 9 (2015) : 2373-2395 .
APA Zhang, Xue-Jun , Gui, Xiao-Lin , Wu, Zhong-Dong . Privacy preservation for location-based services: a survey . | Ruan Jian Xue Bao/Journal of Software , 2015 , 26 (9) , 2373-2395 .
Export to NoteExpress RIS BibTex
10| 20| 50 per page
< Page ,Total 4 >

Export

Results:

Selected

to

Format:
FAQ| About| Online/Total:5156/48176169
Address:XI'AN JIAOTONG UNIVERSITY LIBRARY(No.28, Xianning West Road, Xi'an, Shaanxi Post Code:710049) Contact Us:029-82667865
Copyright:XI'AN JIAOTONG UNIVERSITY LIBRARY Technical Support:Beijing Aegean Software Co., Ltd.