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

Little for more: An Active Discovery Strategy for Content Routing in ICN

China Communications 2016年第S1期13卷 54-64页

作者： PAN Kai LI Hui LIU Weiyang LI Dagang Shenzhen Key Lab of Information Theory & Future Internet Architecture Shenzhen Engineering Lab of Converged Networks TechnologyInstitution of Big Data Technology Peking University SPCCTA Peking University Shenzhen Graduate School

While receiving a certain packet with unknown destination, a router either simply drops it or sends queries around as a *** it sacrifices transmission stability, but sending queries may cause too much *** situation can be seen more frequently in Information-Centric networking(ICN) since it has a larger namespace for routing *** this paper, we propose the neighboring chunk aware discovery(NCAD), an active discovery strategy for content routing. NCAD can reduce the cost of resolving unknown contents, which is not yet considered by the conventional routing mechanism. The idea behind NCAD is to ask the nodes to report back more possession information about the queried content in prediction of later use. To this end, we de-sign NCAD with several different considerations,and balance the tradeoff between effectiveness in conjunction with the overhead to achieve optima on the whole. Extensive experiments are conducted on a small typical topology and a large real-world Internet AS-level *** results show an overall superiority of NCAD in terms of both effectiveness and overhead.

关键词： prevailing approach active discovery strategy neighboring chunk alternative tradeoff

来源：评论

学校读者我要写书评

暂无评论

Fairness-Aware Incentive Mechanism for Multi-Server Federated Learning in Edge-Enabled Wireless Networks with Differential Privacy

引用

IEEE Transactions on Mobile Computing 2025年

作者： Yang, Yu Peng, Kai Wang, Shangguang Xu, Xiaolong Xiao, Peiyun Leung, Victor C.M Huaqiao University College of Engineering Quanzhou362021 China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Nanjing University of Information Science and Technology School of Software Nanjing China Nanjing University State Key Lab. for Novel Software Technology Nanjing210093 China Shenzhen University College of the Computer Science and Software Engineering Shenzhen518060 China University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada

As a distributed machine learning method, federated learning (FL) can collaboratively train a global model with multiple devices without sharing the original data, thus protecting certain privacy. However, due to the strong heterogeneity of edge nodes (ENs) participating in FL, the quality of data uploaded to the parameter server (PS) varies significantly. Without an appropriate incentive mechanism, low-quality contributors may receive disproportionately high rewards, while high-quality contributors may lack sufficient motivation, leading to inefficient participation and suboptimal global model performance. Consequently, it is critical to develop an effective incentive mechanism to promote fairness for the FL process. To address the issues of existing FL incentive mechanisms lacking privacy protection performance analysis, we propose a fairness-aware incentive mechanism for multi-server FL in edge-enabled wireless differential privacy (DP) networks. Specifically, the wireless channel noise is used to provide DP protection for the local model gradients uploaded by ENs. Next, the interaction between the PSs and ENs is modeled as a Stackelberg game. Furthermore, we solve the Stackelberg game process using backward induction and theoretically propose optimal strategies for both the PSs and ENs. Finally, extensive numerical simulations using real datasets demonstrate the superior performance of our theoretical analysis of the proposed scheme. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

The Improved Multi-Attribute Caching: An Efficient Cache Strategy in CCN 9

The Improved Multi-Attribute Caching: An Efficient Cache Str...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Taiji Chen Hui Li Jinchen An Yunmin Wang Jingting Sun Haibin Wang Peking University Shen Zhen Graduate School Shenzhen Eng. Lab of Converged Networking Technology Shenzhen Graduate School Peking University

ISBN: (纸本)9781509038237;9781509038220

The default cache strategy of Content Centric networking(CCN) is storing at each Content Router(CR) along the deliver path. It is high cache redundancy which causes the performance of CCN degradation. Hence, finding an efficient caching mechanisms is necessary in CCN. We agree that the single attribute can not to adapt to the complex network environment. the MAC considers hop count or distance, node degree, content popularity and available storage space. However, the fixed threshold of MAC is also a kind of bottleneck. In this paper, we develop a new strategy which is based on the Multi-Attribute Caching scheme and overcomes the shortcoming of MAC. the Improve Multi-Attribute Caching scheme inherits the four attributes of MAC and use a flexible judgement standard to help CRs. The simulation of IMAC shows that the IMAC reduces the cache load and increasing the cache hit rate.

关键词： MAC The Improved Multi-Attribute Caching An Efficient Cache Strategy in CCN Cache

来源：评论

学校读者我要写书评

暂无评论

An improved collaborative filtering recommendation algorithm combining item clustering and slope one scheme

An improved collaborative filtering recommendation algorithm...

引用

International MultiConference of Engineers and Computer Scientists 2015, IMECS 2015

作者： You, Haipeng Li, Hui Wang, Yunmin Zhao, Qingzhuang ShenZhen Engineering Lab. of Converged Networks Technology Shenzhen Graduate School Peking University Shenzhen518055 China

ISBN: (纸本)9789881925329

With the development of electronic commerce, a lot of recommendation systems have been developed. Collaborative filtering is one of widely-used algorithm in making rating prediction for recommendation systems. However, traditional collaborative filtering suffers sparisity, scalability and cold start problems, which result in poor quality in recommendation systems. To solve these problems, we propose a recommendation algorithm combining item clustering method and weighted slope one scheme. In our algorithm we use item clustering algorithm to partition items to several clusters and apply weighted slope one scheme in each cluster to predict ratings for unknown items to target user. We make experiments on the Movielens dataset and compare our algorithm with several recommendation algorithm. The results show that our algorithm can improve the accuracy of the collaborative filtering recommendation system.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A novel centralized control implementation for identity-location-separated network architecture

A novel centralized control implementation for identity-loca...

引用

International MultiConference of Engineers and Computer Scientists 2015, IMECS 2015

作者： Yu, Chaoqi Li, Hui Liu, Huiling Pan, Kai Liu, Weiyang Shenzhen Engineering Lab. of Converged Networks Technology Shenzhen Eng. Lab. of Converged Networks Technology Inst. of Big Data Technology Shenzhen Graduate School Peking University Shenzhen Guangdong518055 China

ISBN: (纸本)9789881925398

We describe a generic polymorphic networking architecture with identity-based routing mechanism and centralized control fashion called Centralized Identity-based Network (CIN) that combine the ideas of separating control plane and forwarding plane and separating identity and location. In this networking architecture, host identity can be a globally unique name of terminal is a key idea to support mobility. When the terminal moves, database updated the identity and location mapping system in real time. Controllers issue the flow-tables dynamically according the analysis of mapping system. Switches' routing policy has been changed, which keeps the communication connected. At last, we introduce CIN based on Open vSwitch OpenFlow switches and RYU controllers. The result of experiment shows CIN is a scalable networking architecture.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Semi-centralized name routing mechanism for reconfigurable network 9

Semi-centralized name routing mechanism for reconfigurable n...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Chen, Fuxing Liu, Weiyang Li, Hui Zhu, Zhipu Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

Dedicated to overcoming weakness of current Internet architecture, some novel internet architectures have been proposed recently. Examples of these architectures contain Information Centric networking (ICN), Name Data networking (NDN), reconfigurable networking etc. As far as we know, the most efficient name based routing mechanism which suites the new architectures has not been found yet. This paper proposed a Semi-Centralized Name Routing (SCNR) protocol for reconfigurable network to enhance the routing efficiency. Results of this paper show that SCNR has good performance in ICN, which can be regarded as one of the many sub-networks in reconfigurable network. © Institute for Computer Sciences, Social Informatics and Telecommunications engineering 2014.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Prologue: Unified polymorphic routing towards flexible architecture of reconfigurable infrastructure 9

Prologue: Unified polymorphic routing towards flexible archi...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Pan, Kai Li, Hui Liu, Weiyang Zhu, Zhipu Chen, Fuxing Zhu, Bing Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

Today’s Internet architecture was designed and proposed in the 60s and 70s with the intention to interconnect several computing resources across a geographically distributed user group. With the advent of substantially various Internet businesses, traditional Internet is increasingly powerless to satisfy the unprecedented demands. This paper probed the polymorphic routing prototype based on proposed Flexible Architecture of Reconfigurable Infrastructure (FARI) which attempts to emerge as a clean-slate revolution of future Internet and resorts to centralized control manner. Routers in FARI were reconfigurable to adapt to different businesses in terms of identifier type. Moreover, a preliminary framework of FARI is proposed in the end of the article. © Institute for Computer Sciences, Social Informatics and Telecommunications engineering 2014.

关键词： Reconfigurable architectures

来源：评论

学校读者我要写书评

暂无评论

Optimization-based atomic capability routing model for flexible architecture of reconfigurable infrastructure 9

Optimization-based atomic capability routing model for flexi...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Liu, Weiyang Li, Hui Chen, Fuxing Pan, Kai Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

There are more and more emerging problems in today’s Internet, indicating today’s Internet architecture can not meet the quality requirement of various applications and service. With conventional Internet under mounting pressure, a new future Internet architecture named as Flexible Architecture of Reconfigurable Infrastructure (FARI) has been developed and implemented in China. Aiming at designing a routing mechanism which is one of the most essential issue in any Internet architecture, this paper explores to establish an optimization-based atomic capability routing model that is able to optimally select or generate a routing protocol based on the current network quality of service (QoS) requirement. In experiments, the feasibility of this routing model is verified and results of complexity analysis are satisfying. ©Institute for Computer Sciences, Social Informatics and Telecommunications engineering 2014.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

A practical study of exact-BASIC codes at the MSR point in distributed storage systems

A practical study of exact-BASIC codes at the MSR point in d...

引用

International MultiConference of Engineers and Computer Scientists 2015, IMECS 2015

作者： Zhang, Yumeng Li, Hui Zhou, Tai Chen, Jun Hou, Hanxu ShenZhen Engineering Lab. of Converged Networks Technology Shenzhen Graduate School Peking University Shenzhen Guangdong518055 China

ISBN: (纸本)9789881925329

Regenerating codes have been proven a class of optimal distributed storage codes in the tradeoff between storage capacity and repair bandwidth. However, existing regenerating codes rely on expensive computations such as finite field multiplication. The high coding complexity makes regenerating codes unsuitable for practical distributed storage systems. BASIC codes, standing for Binary Addition and Shift Implementable Convolutional codes, are proposed to reduce the computational complexity, as well as to keep the benefits of regenerating codes. In this paper, we implement an exact-repair BASIC code at the minimum-storage (MSR) point in a practical distributed storage system and compare it to Cauchy Reed-Solomon (CRS) code atop a cluster testbed with 20 storage nodes. The results show that minimum-storage BASIC code outperforms CRS code in terms of computational complexity and achieves a significant reduction both of repair bandwidth and disk I/O.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Exploit collision: Network coding in switch based on VOQ scheduling algorithm

Exploit collision: Network coding in switch based on VOQ sch...

引用

International MultiConference of Engineers and Computer Scientists 2015, IMECS 2015

作者： Ma, Li Li, Hui Lv, Shijie Zhang, Guanghui Chen, Fuxing Shenzhen Engineering Lab. of Converged Networks Technology Inst. of Big Data Technology Shenzhen Graduate School Peking University Shenzhen Guangdong518055 China

ISBN: (纸本)9789881925398

To improve the performance of network and reduce implementation cost, many switching fabrics have been proposed, among which Shared Bus, Shared Memory, Crossbar and Multipath Self-routing Switching Structure (MSSS) are especially noteworthy. The first three are not suitable for large-scale expansion because of bandwidth bottleneck or inefficient ability to schedule I/O match. MSSS is featured by the properties of high modularity, self-routing, low component complexity with no internal buffer and no buffer delay and jitter. However, it may incur internal collision, thus improvement is needed for practical application. In this paper we exploit collision by contacting Network Coding (NC) with MSSS, thus achieving the increase throughput in network when the traffic load is relatively heavy. On this basis, to solve the head of line blocking (HOL) problem, we add virtual output queue (VOQ) scheduling algorithm to allow NC play better results. We implement this design on FPGA, and the results indicate that this structure has effectively reduced the packet loss rate.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：