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

IEEE 18th International Conference on Parallel and Distributed Systems (ICPADS)

作者： Penaranda, R. Gomez, C. Gomez, M. E. Lopez, P. Duato, J. Univ Politecn Valencia E-46071 Valencia Spain Univ Castilla Mancha Albacete Albacete Spain

ISBN: (纸本)9781467345651;9780769549033

In large parallel computers routing is a key design point to obtain the maximum possible performance out of the interconnection network. routing can be classified into two categories depending on the number of routing options that a packet can use to go from its source to its destination. If the packet can only use a single predetermined path then the routing is deterministic, whereas if several paths are possible it is adaptive. It is a well-known fact that adaptive routing usually outperforms deterministic routing;but in this paper we take the challenge of developing a HOL-blocking-aware deterministic routing algorithm that can obtain a similar or even better performance than adaptive routing, while decreasing its implementation complexity and providing some inherent advantages to deterministic routing such as in-order delivery of packets. In this large computers regular direct topologies are widely-used, so in this paper we focus on meshes and tori.

关键词： HoL Blocking routing algorithm topology routing algorithms Packet Network routing topology deterministic Self tuning destination

来源：评论

学校读者我要写书评

暂无评论

Cascading Failure Analysis of Power-communication Networks Considering Packets Priorities 5

Cascading Failure Analysis of Power-communication Networks C...

引用

5th IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Li, Xue Wang, Ruijie Fu, Zhiqiang Du, Dajun Shanghai Univ Sch Mechatron Engn & Automat Shanghai Key Lab Power Stn Automat Technol Shanghai 200072 Peoples R China

ISBN: (纸本)9781538660058

This paper is concerned with the cascading failure problem of power -communication networks. Firstly, according to the known branch failure in power grid, the hidden failures in the connected branches and the cascading failures of power grids and communication networks are analyzed. Then, to reduce the effects of communication network congestion induced by these cascading failures, a novel routing algorithm based on the Open Shortest Path First (OSPF) is proposed by considering packets priorities. This is furthermore achieved by using three indicators (i.e., betweenness B, Gmax G and load-rate R) to evaluate packets priorities. Finally, simulation results show that the proposed method can effectively reduce the cumulative probabilities of load loss and scale after the cascading failures.

关键词： Power grid Communication network Cascading failure routing algorithm Packet Priority

来源：评论

学校读者我要写书评

暂无评论

Study on Network-on-Chip Router Buffer Utilization

Study on Network-on-Chip Router Buffer Utilization

引用

2019 International Conference on Informatics, Control and Robotics 2019信息学、控制和机器人学国际会议(ICICR2019)

作者： Ming-hua TANG Jing LIN School of Internet Finance and Information Engineering GuangDong University of Finance School of Information Management Shanghai Lixin University of Accounting and Finance

Since Network-on-Chip(NoC) is proposed to act as the communication infrastructure for many-core architecture, it has become one of the most investigated research topics. The term "saturation" is always used while discussing about performance and power figures exhibited by a NoC. Router buffer utilization is one of the key factors to understand network saturation status. In this paper, we carry out detail study on the router buffer utilization under various traffic load. According to our study, the network packets are classified into three types: destination packets, passing packets, and deterring packets. These packets will make different contribution to the router buffer occupation.

关键词： Network-on-Chip routing algorithm Saturation

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient routing algorithm for WSNs Via Unequal Clustering

Energy Efficient Routing Algorithm for WSNs Via Unequal Clus...

引用

14th IEEE International Conference on High Performance Computing and Communications (HPCC) / IEEE 9th International Conference on Embedded Software and Systems (ICESS)

作者： Zhang, Ruihua Ju, Lei Jia, Zhiping Li, Xin Shandong Univ Sch Comp Sci & Technol Jinan 250101 Peoples R China

ISBN: (纸本)9780769547497

Clustering and multi-hop forwarding improve the energy efficiency of wireless sensor networks (WSNs). However, when cluster heads transmit their data to a sink via multi-hop communication, nodes around the sink are burdened with heavy relay traffic and tend to die early, which results in the energy hole and network partition problems. In this paper, we propose an energy efficient Unequal-Clustering routing algorithm (UCRA) for WSNs, which consists of an Unequal-Clustering algorithm (UCA) and a multi-hop routing algorithm. Our UCA takes into consideration residual energy and degree of a sensor node when grouping the sensor nodes into unequal clusters. We adopt the Minimum Energy Consumption (MEC) multi-hop routing algorithm for inter-cluster communication. It exploits sensor nodes' location information to determine a MEC routing path. Simulation results show that our UCRA balances the energy consumption among sensor nodes and achieve a substantial improvement on the network lifetime.

关键词： wireless sensor networks energy efficiency unequal clustering routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on BA Scale-free Networks Congestion and Control 18

Research on BA Scale-free Networks Congestion and Control

引用

2nd International Conference on Computer Science and Application Engineering (CSAE)

作者： Wen, Hong Jin, Ru Hunan Univ Sci & Technol Xiangtan Peoples R China

ISBN: (纸本)9781450365123

The congestion problems(1) of BA scale-free networks, such as the reasons and diffusion patterns of network congestion, how to design congestion control methods and so on, are worth studying in depth. In this paper, the theoretical and experimental researches on the congestion and control of typical BA scale-free networks under dynamic local routing algorithm are carried out. By exploring the mechanism of congestion under different parameters, and analyzing the propagation mode of congestion, a certain theoretical basis is provided for designing the BA scalefree network congestion control method effectively.

关键词： BA scale-free networks routing algorithm congestion diffusion congestion control

来源：评论

学校读者我要写书评

暂无评论

Predicting Potential Responders in Twitter: A Query routing algorithm

Predicting Potential Responders in Twitter: A Query Routing ...

引用

12th International Conference on Computational Science and Its Applications (ICCSA)

作者： de Souza, Cleyton Caetano de Magalhaes, Jonathas Jose de Costa, Evandro Barros Fechine, Joseana Macedo Univ Fed Campina Grande Dept Syst & Comp Campina Grande PB Brazil Univ Fed Alagoas Comp Inst Maceio AL Brazil

ISBN: (纸本)9783642311369;9783642311376

A phenomenon not so recent is the substantial increase in popularity and use of online social networks. With that has emerged a new way to find information online: the social query, which consists of posting a question in a social network and wait for responses from close friends. Usually, a question is posted to be visible to everyone, but we believe that this is not the best way: there will be the possibility of receiving several responses (including wrong), keep receiving answers where there is no need, do not receive answers, etc. The query router problem consists of finding the most able individual in the personal social network of the questioner. This work presents an algorithm to routing Questions in Twitter. The model was validated through its predict capacity and the results shows that its recommendations match in half cases only when combined with a technique to enrich the information present in the question.

关键词： Social Query routing algorithm Social Network Twitter

来源：评论

学校读者我要写书评

暂无评论

A Performance Study of Color-Based Cooperative Caching in Telco-CDNs by Using Real Datasets 18

A Performance Study of Color-Based Cooperative Caching in Te...

引用

9th International Symposium on Information and Communication Technology (SoICT)

作者： Anh-Tu Ngoc Tran Minh-Tri Nguyen Thanh-Dang Diep Nakajima, Takuma Thoai, Nam HCMC Univ Technol VNUHCM High Performance Comp Lab Fac Comp Sci & Engn Ho Chi Minh City Vietnam Univ Electrocommun Grad Sch Informat Syst Chofu Tokyo Japan

ISBN: (纸本)9781450365390

Content Delivery Networks managed by Telecommunications companies (Telco-CDNs) can be considered as a solution to significantly reduce traffic by deploying content servers deeper inside the network of Internet Service Provider (ISP), which helps network operators meet the rapid growth of Video-on-Demand (VoD) services. The recent color-based strategy has proven its impressive performance in utilizing simple color tags to effectively distribute contents across such a network. In previous studies, the color-based caching algorithm was proven to be the most practicable technique to reduce traffic in Telco-CDNs. However, all of the experiments were performed on a simulated dataset generated from the gamma distribution. Therefore, the reliability of the results is not high. This work verifies the feasibility of the color-based approach by reproducing the experiments on traces of real accesses at our server. The empirical results on our dataset show that the color-based caching using 4 colors coupled with its routing strategy gives the best performance in most of our cases, among some other variants and the LFU caching approach. As inserting 455 new contents, the hybrid feature helps the color-based approach to improve 8.1% hit rate compared to the single cache area.

关键词： co-operative caching sub-optimal content placement hybrid caching routing algorithm dynamic content popularity

来源：评论

学校读者我要写书评

暂无评论

Design of Trusted Security routing in Wireless Sensor Networks Based on Quantum Ant Colony algorithm

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2017年第7期13卷 4-13页

作者： Shu, Xiao-bin Liu, Cai-hong Jiao, Chun-xia Wang, Qin Yin, Hongfeng Luohe Vocat Coll Food Dept Comp Sci Luohe 462300 Peoples R China Beijing JiaoTong Univ Haibin Coll Dept Comp Sci Huanghua 061199 Peoples R China

To design an effective secure routing of trusted nodes in wireless sensor networks, quantum ant colony algorithm is applied to the design of large-scale wireless sensor network routing. The trustworthy network is used as the pheromone distribution strategy. Then, the pheromone is encoded by the quantum bit. The pheromone is updated by the quantum revolving door, and the energy consumption prediction is carried out to select the path. Finally, the trusted security routing algorithm of the wireless sensor network based on the global energy balance is realized. The quantum ant colony algorithm is superior to the traditional ant colony algorithm in algorithm convergence speed and global optimization. It can balance the energy consumption of the network node and can effectively resist the attacks such as Wormholes. It is very promising to apply the quantum ant colony algorithm to the routing algorithm of large scale wireless sensor networks.

关键词： wireless sensor network quantum ant colony algorithm safe and reliable routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2018年第5期14卷 1-16页

作者： Ticona-Zegarra, Edson Schouery, Rafael C. S. Villas, Leandro A. Miyazawa, Flavio K. Univ Estadual Campinas Av Albert Einstein 1251Cidade Univ BR-13083872 Campinas SP Brazil

Wireless sensor networks consist of hundreds or thousands of nodes with limited energy resources, and thus, efficient use of energy is necessary for these networks. Given that transmissions are the most energy-demanding operation, routing algorithms should consider efficient use of transmissions in their designs in order to extend the network lifetime. To tackle these challenges, a centralized algorithm is proposed, called improved continuous enhancement routing (ICER), for computing routing trees of refined quality, based on data aggregation while being aware of the battery energy state. Comparisons between ICER and other known solutions in the literature are performed. Our experiments show that ICER is able to ensure, on average, the survival of 99.6% and the connectivity of 99.3% of the network nodes compared to 90.2% and 72.4% in relation to the best-compared algorithm. The obtained results show that ICER significantly extends the network lifetime while maintaining the quality of the routing tree.

关键词： Genetic algorithm in-network aggregation wireless sensor networks routing algorithm Steiner tree problem network lifetime

来源：评论

学校读者我要写书评

暂无评论

Two-Level Community-Based routing in Delay Tolerant Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第4期96卷 5687-5704页

作者： Xia, Maojin Wang, Qingshan Wang, Qi Cao, Cheng Wang, Lifang Guo, Hao Hefei Univ Technol Sch Math Hefei Anhui Peoples R China Nanjing Univ Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China

Delay tolerant networks can not maintain end-to-end connectivity. Thus the routing is one of the critical issues. As we known, the two-level community model including the small community and the big community is proposed for the first time. In the same small community, any two member nodes are friends with each other. And in the same big community which is constructed of some small communities, any two communities have some pairs of friend nodes between them. Based on this model, a two-level community-based routing (TLCR) algorithm is presented in delay tolerant networks. In TLCR, according to the location of packet holder including inside the small community of destination node, inside of the big community and outside of the small community of destination node, and outside of the big community of destination node, the different packet forwarding strategies are investigated. The number of relay nodes selected by a packet holder is decreasing with the holder's location from inside of the small community of destination node to outside of the big community of destination node. The probability of the source node successfully delivers the packet to the destination node and the copies number corresponding with the above three locations are analyzed, respectively. The simulation results show that TLCR not only improves the delivery ratio but also greatly reduces the resource cost.

关键词： Two-level community model Relay node routing algorithm Probability Delay tolerant networks (DTNs)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：