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

IEEE International Conference on Computational Science and engineering, CSE

作者： Lidu Qin Hui Li Kai Pan Fuxing Chen Wensheng Chen Chaoqi Yu Shenzhen Engineering Lab of Converged Networks Technology Peking University Shenzhen Graduate School Shenzhen China

ISBN: (纸本)9781479979820

The tremendous growth of the Internet application has driven wider efforts to advanced future Internet architecture especially Content-Centric networking. In this paper we propose a Centralized Architecture for ICN (CAN), which efficiently combines Content-Centric networking and network coding (NC). In order to achieve optimal coding performance, we design a global controller which is mainly responsible for calculating entire network routing tables and controlling optimal trade off among cache coding schemes. Specifically, we propose a coding chunk naming scheme and an efficient network coding management approach, which apply to recover the lost native content packets according to NC. Experiment results show that NC in CAN has a great performance for content packet loss recovery. In particular, it can reach nearly 100% recovery in sufferable packet loss rate. Meanwhile, the efficiency and performance of which are superior to the conventional CCN.

关键词： Encoding Routing Packet loss Network coding Decoding Motion pictures

来源：评论

学校读者我要写书评

暂无评论

Work in progress: On the knapsack-based resource allocation for reconfigurable network architecture

Work in progress: On the knapsack-based resource allocation ...

引用

International Conference on Communications and networking in China (CHINACOM)

作者： Kai Pan Weiyang Liu Hui Li Shenzhen Engineering Lab of Converged Networks Technology Peking University Shenzhen Graduate School Shenzhen China

ISBN: (纸本)9781479959716

Though the decades of great success the Internet has experienced, it still confronts with many challenges to achieve QoS of various business types. A consensus has been reached that resource allocation presents a tremendously status in such a network bandwidth poor settings. In this paper, we bring the knapsack problem idea into reconfigurable network architecture (RNA), which is proposed with the intention of achieving QoS of various business types, to study the resource allocation problem. By defining the volume of flows, we argue that a flow with smaller volume should be granted higher priority while it is allocated bandwidth. Compared to the conventional approach, the knapsack based approach is good at maximizing network utility and decreasing overall price under certain conditions. Simulation results show that knapsack based approach retains the soundness of the conventional approach in the scenario of increasing flows network, and outperforms it both in the aspect of overall price and load balance under network with variation of flows.

关键词： Resource management RNA Quality of service Bandwidth Routing Topology Computer architecture

来源：评论

学校读者我要写书评

暂无评论

On the optimal routing for Reconfigurable Network Architecture

On the optimal routing for Reconfigurable Network Architectu...

引用

International Conference on Communications and networking in China (CHINACOM)

作者： Kai Pan Hui Li Weiyang Liu Zhipu Zhu Bing Zhu Shenzhen Engineering Lab of Converged Networks Technology Peking University Shenzhen Graduate School Shenzhen China

ISBN: (纸本)9781479959716

The over 40-year old Internet, which was designed and proposed with the intention to interconnect several computing resources across a geographically distributed user group, is now facing many unprecedented challenges especially from the increasingly abundant demands in future networks. Traditional IP protocol can hardly deal with the challenges due to the single function and low QoS. In this paper, we proposed a unified polymorphic routing method towards the Reconfigurable Network Architecture (RNA) to achieve diverse demands according to different business types. Then, a rough description of specific based routing method is given in conjunction with the stipulated packet header that is compatible with current IP. Moreover, the network business match rate of polymorphic routing for RNA is simulated to validate the effectiveness and feasibility.

关键词： Routing Internet RNA Business IP networks Protocols Computer architecture

来源：评论

学校读者我要写书评

暂无评论

On low repair complexity storage codes via group divisible designs 19

On low repair complexity storage codes via group divisible d...

引用

19th IEEE Symposium on Computers and Communications, ISCC 2014

作者： Zhu, Bing Shum, Kenneth W. Li, Hui Li, Shuo-Yen Robert Shenzhen Eng. Lab of Converged Networks Technology Shenzhen Graduate School Peking University China Institute of Network Coding Chinese University of Hong Kong Hong Kong Department of Information Engineering Chinese University of Hong Kong Hong Kong

ISBN: (纸本)9781479942787

Fractional repetition (FR) codes are a family of storage codes that provide efficient node repair at the minimum bandwidth regenerating point. Specifically, the repair process is exact and uncoded, but table-based. Existing constructions of FR codes are primarily based on combinatorial designs such as Steiner systems, resolvable designs, etc. In this paper, we present a new explicit construction of FR codes, which adopts the theory of uniform group divisible designs, termed GDDFR codes. Our codes achieve the storage capacity of random access and are available for a wide range of parameters. In addition, our techniques allow for constructing FR codes with parameters that are not covered by Steiner systems, which answers an open question put forward in prior work. © 2014 IEEE.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

Performance analysis and comparison of PoW,PoS and DAG based blockchains

引用

Digital Communications and Networks 2020年第4期6卷 480-485页

作者： Bin Cao Zhenghui Zhang Daquan Feng Shengli Zhang Lei Zhang Mugen Peng Yun Li The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing100876China The State Key Laboratory of Integrated Services Networks(Xidian University) Xian710000China School of Communications and Information Engineering and Chongqing Key Lab of Mobile Communications Technology Chongqing University of Posts and TelecommunicationsChongqing400065China The Guangdong Key Laboratory of Intelligent Information Processing College of Electronic and Information EngineeringShenzhen UniversityShenzhen518060China College of Information Engineering Shenzhen UniversityShenzhen518060China School of Engineering University of GlasgowGlasgowG128QQUK

In the blockchain,the consensus mechanism plays a key role in maintaining the security and legitimation of contents recorded in the *** blockchain consensus mechanisms have been ***,there is no technical analysis and comparison as a guideline to determine which type of consensus mechanism should be adopted in a specific scenario/*** this end,this work investigates three mainstream consensus mechanisms in the blockchain,namely,Proof of Work(PoW),Proof of Stake(PoS),and Direct Acyclic Graph(DAG),and identifies their performances in terms of the average time to generate a new block,the confirmation delay,the Transaction Per Second(TPS)and the confirmation failure *** results show that the consensus process is affected by both network resource(computation power/coin age,buffer size)and network load *** addition,it shows that PoW and PoS are more sensitive to the change of network resource while DAG is more sensitive to network load conditions.

关键词： Blockchain Proof of work Proof of stake Direct acyclic graph Performance comparison

来源：评论

学校读者我要写书评

暂无评论

A multi-path forwarding strategy for content-centric networking

A multi-path forwarding strategy for content-centric network...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Guanghui Zhang Hui Li Tingting Zhang Dagang Li Li Xu School of Electronic & Computer Engineering Peking University Shenzhen China Engineering Lab of Converged Networks Technology Shenzhen China Communication Engineering Research Center Harbin Institute of Technology Shenzhen China

Content-Centric networking (CCN) is a new networking paradigm to resolve the data traffic explosive problem of the Internet caused by a rapid increase in file sharing and video streaming traffic. Instead of seeking a single best path in the IP network, CCN is able to employ multipath to deliver packets. The conventionally adopted CCN forwarding strategies, such as taking advantage of replication of Interests or the shortest path do not offer satisfying performance under high-bandwidth requirements. In this paper, we present a Luby Transform (LT) code aided multipath forwarding strategy (LTCA-MF), which aims at reducing data downloading time and improving load balance in forwarding by transmitting LT coded contents on multiple disjoint paths. Tested by a large-scale network simulation scenario, our LTCA-MF strategy achieves excellent performance with desirable reliability and feasibility in comparison to others.

关键词： Servers Routing Greedy algorithms IP networks Complexity theory Decoding Encoding

来源：评论

学校读者我要写书评

暂无评论

Fast Repair for Single Failure in Erasure Coding-Based Distributed Storage Systems

Fast Repair for Single Failure in Erasure Coding-Based Distr...

引用

Reliable Distributed Systems

作者： Huayu Zhang Hui Li Bing Zhu Jun Chen Shenzhen Engineering Lab of Converged Networks Technology Peking University China Peking University Beijing Beijing CN

In order to guarantee data reliability in distributed storage systems, erasure codes are widely used for the desirable storage properties. Nevertheless, the codes have one drawback that overmuch data are needed to repair a failure, resulting in both large bandwidth consuming in the network and high calculation pressure on the replacement node. For repair bandwidth problem, researchers derive the tradeoffs between storage and repair traffic from network coding and propose regenerating codes. However, the constructions of regenerating codes complicate the systems as well as recovery calculation. Hence, this paper proposes a distributed repair method based on general erasure codes to mitigate the burden of both recovery computation and network traffic. We observe that distributing recovery computation among helpers can distract the whole calculation procedure and accelerate repair speed in practical systems. Furthermore, by combining this technique with network topology, we introduce a novel repair tree to minimize repair traffic. Repair tree is also derived from network coding. The performance of the repair tree is preliminarily analyzed and evaluated, which infers that the storage-bandwidth bound of regenerating codes can be broken under this model.

关键词： Maintenance engineering Bandwidth Strips Vectors Silicon Computational modeling Servers

来源：评论

学校读者我要写书评

暂无评论

NPM: An Anti-attacking Analysis Model of the MTD system Based on Martingale Theory

NPM: An Anti-attacking Analysis Model of the MTD system Base...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Xin Yang Hui Li Han Wang Shenzhen Key Lab of Information Theory & Future Network Arch Future Network PKU Lab of National Major Research Infrastructure PKU Inst.of Big Data Technology Shenzhen Engineering Lab of Converged Networking Technology Huawei & PKU Jointly Engineering Lab of Future Network Based on SDN School of Electronic and Computer Engineering Peking University Shenzhen China

Moving target defense (MTD) techniques are effective solutions to improve the network security by continuously reconfiguring the system setting. On the other hand, continuously transforming also increase the cost of defenders, so it is important to analyze the effectiveness of MTDs compared with their cost. Current researches lack of analyzing the effectiveness by mathematical theory compared with analyzing by experiment. Motivated by the above, we propose a novel three-dimension model named NPM jointly use N-version programming, Poisson process, Markov chain and martingale theory to analyze the effectiveness of the proposed MTD model. Our analysis points out the difficulty for a successful adversary to defeat the MTD system, which is related to the system configuration, such as the number of executors and the judgment criterion in every node, the transforming period and rang of system MTD transformation. Finally, we give advices on the design of the system in the daily defense and the attacked defense, with the goal of guaranteeing security with minimal cost.

关键词： Security Analytical models Programming Markov processes Mathematical model Computers Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A velocity based HMM framework for indoor localization 24

A velocity based HMM framework for indoor localization

引用

24th Asia-Pacific Conference on Communications, APCC 2018

作者： Chen, Hao Tao, Xiaofeng Zhang, Yifan Li, Wei Zhang, Ping National Engineering Lab for Mobile Network Technologies Beijing University of Posts and Telecommunications China Beijing University of Posts and Telecommunications Research Institute Shenzhen China Department of Electrical and Computer Engineering University of Victoria Australia State Key Lab of Networking and Switching Technology Beijing University of Posts and Telecommunications China

ISBN: (纸本)9781538669280

Indoor fingerprint location is widely used in passenger flow analysis, location based service, and security monitoring. RSS is usually used as signal fingerprint. However, in these applications the acquisition process relies on the uplink data transmission of the target device. These signals are often non-normally distributed and fluctuate greatly when the target moves. In order to cope with the above difficulties, this paper proposes a hidden markov model (HMM) framework based on targets maximum speed. It combines the speed parameters with path constraints to improve the calculation of state transition matrix. The kernel density estimation method based on the Wiener process is also used to solve the confusion matrix of HMM, which improves the accuracy of estimating the RSS distribution of the uplink signal. The performance of the algorithm are compared with the traditional HMM and NB methods in an actual indoor scenario. The influence of the target moving speed and the length of the observation sequence on the positioning accuracy is also analyzed. © 2018 IEEE.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Joint Participation Incentive and Network Pricing Design for Federated Learning 42

Joint Participation Incentive and Network Pricing Design for...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Ding, Ningning Gao, Lin Huang, Jianwei Northwestern University Department of Electrical and Computer Engineering EvanstonIL60208 United States Shenzhen Research Institute of Big Data Shenzhen518172 China Harbin Institute of Technology Sch. of Electronics and Info. Eng. and the Guangdong Prov. Key Lab. of Aerosp. Commun. and Networking Technol. Shenzhen China The Chinese University of Hong Kong Shenzhen School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

ISBN: (纸本)9798350334142

Federated learning protects users' data privacy though sharing users' local model parameters (instead of raw data) with a server. However, when massive users train a large machine learning model through federated learning, the dynamically varying and often heavy communication overhead can put significant pressure on the network operator. The operator may choose to dynamically change the network prices in response, which will eventually affect the payoffs of the server and users. This paper considers the under-explored yet important issue of the joint design of participation incentives (for encouraging users' contribution to federated learning) and network pricing (for managing network resources). Due to heterogeneous users' private information and multi-dimensional decisions, the optimization problems in Stage I of multi-stage games are non-convex. Nevertheless, we are able to analytically derive the corresponding optimal contract and pricing mechanism through proper transformations of constraints, variables, and functions, under both vertical and horizontal interaction structures of the participants. We show that the vertical structure is better than the horizontal one, as it avoids the interests misalignment between the server and the network operator. Numerical results based on real-world datasets show that our proposed mechanisms decrease server's cost by up to 24.87% comparing with the state-of-the-art benchmarks. © 2023 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：