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

Community discovery optimization algorithm in social network

Metallurgical and Mining Industry 2015年第9期7卷 704-713页

作者： Tu, Xionggang Chen, Jun Zhang, Changjiang School of Design and Arts Zhejiang Industry Polytechnic College Shaoxing China College of Mathematics Physics and Information Engineering Zhejiang Normal University Jinhua China

As for the present community discovery and compression algorithm ignoring the issue of network community structures, this paper proposes a community discovery GS algorithm and community compression SNC algorithm. On the basis of proposing the theorems and corollaries related to the importance of the nodes in community discovered by topological method. GS algorithm discoveries the important nodes on different levels in community, and then through social networks compresses SNC algorithm and according the importance of the node compresses the community. Experimental results show that: the proposed algorithm can maintain the relationship between the communities during the compression process. It has a good community compression, in which the ratio can up to 0.95, and at the same time it can retain the important nodes in the community or community basic structures.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Improvement of Energy-Aware MANET routing Algorithm using Load-Balancing 17

Performance Improvement of Energy-Aware MANET Routing Algori...

引用

IEEE 17th International Conference on Computational Science and Engineering (CSE)

作者： Zhang, Xiaoying Anpalagan, Alagan Guo, Lei Northeastern Univ Shenyang Peoples R China Ryerson Univ Toronto ON Canada Ryerson Univ WINCORE Lab Toronto ON Canada Northeastern Univ Sch Informat Sci & Engn Shenyang Peoples R China

ISBN: (纸本)9781479979813

Most research on energy-aware routings in mobile ad hoc networks (MANETs) only focuses on minimizing the total energy consumption from the source node to the destination node, regardless of the performance degradation caused by the heavy traffic load in the network. In this paper, we propose an energy-aware load-balanced routing (EALB) algorithm. Simulation results demonstrate that the proposed routing algorithm significantly increases the packet delivery ratio, reduces the delay and prolongs the network lifetime in heavy load networks. EALB can also provide better performance when nodes have very low energy levels.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Mobility Enhancement of Patients Body Monitoring based on WBAN with Multipath routing 2

Mobility Enhancement of Patients Body Monitoring based on WB...

引用

2nd International Conference on Information and Communication Technology (ICoICT)

作者： Birgani, Yasna Ghanbari Javan, Nastooh Taheri Tourani, Mohsen Tarbiat Modares Univ Dept Ind Engn Tehran Iran Amirkabir Univ Technol Dept Comp Engn Tehran Iran KN Toosi Univ Technol Dept Sci Tehran Iran

ISBN: (纸本)9781479935802

One of the promising applications of wireless sensor networks (WSNs) is monitoring of the human body for health concerns. For this purpose, a large number of small sensors are implanted in the human body. These sensors altogether provide a network of wireless sensors (WBANs) and monitor the vital signs and signals of the human body;these sensors will then send this information to the doctor. The most important application of the WBAN is the implementation of the monitoring network for patient safety in the hospital environment. In this case, supporting patients' mobility is one of the basic needs, which has been underestimated in recent studies. The problem that involves providing the required energy for the units used in this type of network is challenging;for this reason, sent/ received units with very low power consumption and with a very small radius are used in order to save energy. The resulting small sending range, leads to the lack of support for patients' mobility. In this paper, the AD HOC mode is suggested for use to establish a network and a multi-path routing algorithm, for the purpose of importing patients' mobility in hospital setting. The results of the simulation show that in addition to supporting patients' mobility, the use of the proposed idea instead of previously presented protocols, reduces delays in data transmission and energy consumption;and it also increases the delivery rate depending on the destination and the lifetime of the network, while on the other hand, it increases routing overhead.

关键词： WBAN Health Monitoring Patient Mobolity routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving Hamiltonian-based routing Methods for On-chip Networks: A Turn Model Approach

Improving Hamiltonian-based Routing Methods for On-chip Netw...

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Bahrebar, Poona Stroobandt, Dirk Univ Ghent Dept Elect & Informat Syst ELIS B-9000 Ghent Belgium

ISBN: (纸本)9783981537024

The overall performance of Multi-Processor System-on-Chip (MPSoC) platforms depends highly on the efficient communication among their cores in the Network-on-Chip (NoC). routing algorithms are responsible for the on-chip communication and traffic distribution through the network. Hence, designing efficient and high-performance routing algorithms is of significant importance. In this paper, a deadlock-free and highly adaptive path-based routing method is proposed without using virtual channels. This method strives to exploit the maximum number of minimal paths between any source and destination pair. The simulation results in terms of performance and power consumption demonstrate that the proposed method significantly outperforms the other adaptive and non-adaptive schemes. This efficiency is achieved by reducing the number of hotspots and smoothly distributing the traffic across the network.

关键词： multiprocessor interconnection networks network routing network-on-chip Hamiltonian-based routing methods MPSoC platforms NoC deadlock-free routing method highly adaptive path-based routing method multiprocessor system-on-chip platforms network-on-chip on-chip communication on-chip networks power consumption routing algorithms traffic distribution turn model approach Algorithm design and analysis DH-HEMTs Power demand routing Solids System recovery Unicast

来源：评论

学校读者我要写书评

暂无评论

UI-Route: An Ultra-Fast Incremental Maze routing Algorithm 14

UI-Route: An Ultra-Fast Incremental Maze Routing Algorithm

引用

ACM/IEEE International Workshop on System Level Interconnect Prediction (SLIP)

作者： Huang, Tsung-Wei Wu, Pei-Ci Wong, Martin D. F. Univ Illinois Dept Elect & Comp Engn Urbana IL USA

ISBN: (纸本)9781450330534

Grid-based maze routing is a fundamental problem in electronic-design-automation (EDA) domain. A core primitive deals with a large query set about route connectivity subject to incremental changes on grid graph. Existing approaches pertain to batch processing, where each route query is independently and repeatedly solved by a routing procedure. Few researches so far discuss an efficient utilization of search knowledge in incremental fashion, which could dramatically speed up the search. Unfortunately, existing algorithms nearly rely on irregular and highly divergent search space, imposing acceleration challenges on refitting them to incremental version. Consequently, in this paper we present UI-Route, an ultra-fast incremental maze routing algorithm in grid environment. UI-Route is unique in breaking route equivalence, proving that a huge amount of equivalent search efforts can be optimally and incrementally eliminated. Equivalence breaking enables regularized search space, delivering well-tabulated search knowledge through the incremental processing. Moreover III-Route is largely orthogonal to many applications built upon maze routing and therefore can seamlessly substitute for speedup. Experimental results on a set of modern circuit benchmarks demonstrate that UI-Route achieves prominent speedup over existing algorithms.

关键词： Incremental Mazes Refitting routing algorithms Batch processing Speeding Network routing

来源：评论

学校读者我要写书评

暂无评论

Highly Adaptive and Congestion-aware routing for 3D NoCs 14

Highly Adaptive and Congestion-aware Routing for 3D NoCs

引用

GLSVLSI'14: Proceedings of the 2014 Great Lakes Symposium on VLSI

作者： Kumar, Manoj Laxmi, Vijay Gaur, Manoj Daneshtalab, Masoud Ko, Seok-Bum Zwolinski, Mark Malaviya Natl Inst Technol Jaipur Rajasthan India Univ Turku Turku Finland Univ Saskatchewan Saskatoon SK Canada

ISBN: (纸本)9781450328166

In this paper, we propose a novel highly adaptive and congestion aware routing algorithm 3D meshes which is equally applicable to 2D meshes as well. The proposed algorithm allows cyclic dependencies in channel dependency graph (CDG) providing higher degree of adaptiveness. The algorithm uses congestion-aware channel selection strategy that results balanced distribution of traffic flows across the network. A packet follows non-minimal paths only when minimal paths are congested at the neighboring channels. The deadlock avoidance methodology adopted by our algorithm remains cost-efficient as it uses one extra virtual channel along each of Y and Z dimensions to achieve deadlock freedom.

关键词： On-chip Networks congestion deadlock-freedom routing algorithms non-minimal routes

来源：评论

学校读者我要写书评

暂无评论

Alternative routing and Zone-Based Spectrum Assignment Algorithm for Flexgrid Optical Networks

Alternative Routing and Zone-Based Spectrum Assignment Algor...

引用

IEEE International Conference on Communications (ICC)

作者： Scaraficci, Rafael A. da Fonseca, Nelson L. S. Univ Estadual Campinas Inst Comp Campinas SP Brazil CPqD Telecommun Res & Dev Ctr Campinas SP Brazil

ISBN: (纸本)9781479920037

In optical flexgrid networks, the optical spectrum can be allocated at a much finer granularity than it can be in fixed-grid WDM networks and variable spectrum widths can be assigned to the lightpaths according to the transmission rates, leading to more efficient spectrum usage. However, the dynamic establishment and tear down of lightpaths yields to the fragmentation of the spectrum with increase in blocking of connections, mainly connections demanding large spectrum widths. This paper proposes a novel algorithm that introduces a zone-based assignment policy together with an alternative path routing mechanism based on the maximum capacity available. Results derived via simulation using different topologies and considering connections requests from 40Gbps to 1000Gbps, show that the proposed algorithm leads to blocking ratio consistently lower than those given by traditional approaches. It also reduces the blocking ratio of high rates connections, in some cases, by a factor of six.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Moving Source routing Solution for High-Speed Railway Communication in Optical Core Transport Networks

A Moving Source Routing Solution for High-Speed Railway Comm...

引用

Optical Fiber Communications Conference and Exhibition (OFC)

作者： Hua, Nan Zheng, Xiaoping Tsinghua Univ Dept Elect Engn Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

We consider the routing problem that one terminal of a connection moves along a determinate path. By avoiding frequent connection re-establishment, our proposed moving source routing solution can reduce handover laten... 详细信息

ISBN: (纸本)9781557529930

关键词： algorithms Augmented reality Network topology Optical networks routing algorithms Switching Networks (060.4250) Networks, assignment and routing algorithms (060.4251)

来源：评论

学校读者我要写书评

暂无评论

Achieving Balanced Buffer Utilization with a Proper Co-Design of Flow Control and routing Algorithm 8

Achieving Balanced Buffer Utilization with a Proper Co-Desig...

引用

Eighth IEEE/ACM International Symposium on Networks-on-Chip (NoCS)

作者： Gorgues, Miguel Xiang, Dong Flich, Jose Yu, Zhigang Duato, Jose Univ Politecn Valencia E-46022 Valencia Spain Tsinghua Univ Sch Software Beijing Peoples R China

ISBN: (纸本)9781479953479

Buffer resource minimization plays an important role to achieve power-efficient NoC designs. At the same time, advanced switching mechanisms like virtual cut-through (VCT) are appealing due to their inherited benefits (less network contention, higher throughput, and simpler broadcast implementations). Moreover, adaptive routing algorithms exploit the inherited bandwidth of the network providing higher throughput. In this paper, we propose a novel flow control mechanism, referred to as type-based flow control (TBFC), and a new adaptive routing algorithm for NoCs. First, the reduced flow control strategy allows using minimum buffer resources, while still allowing VCT. Then, on top of TBFC we implement the safe/unsafe routing algorithm (SUR). This algorithm allows higher performance than previous proposals as it achieves a proper balanced utilization of input port buffers. Results show the same performance of fully adaptive routing algorithms but using less resources. When resources are matched, SUR achieves up to 20% throughput improvement.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Low-Cost Fault-Tolerant routing for Regular Topology NoCs 21

Low-Cost Fault-Tolerant Routing for Regular Topology NoCs

引用

2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS)

作者： Tatas, K. Savva, S. Kyriacou, C. Frederick Univ Dept Comp Sci & Engn Nicosia Cyprus

ISBN: (纸本)9781479942428

This paper presents a novel low-cost routing algorithm for regular (mesh) topology networks-on-chip. While deterministic NoC routing algorithms such as XY routing are still widely used, they can fail when a link or router in the NoC fails temporarily or permanently, because they provide no adaptivity. However, switching to a topology-agnostic routing algorithm can be a very costly approach in terms of performance and/or area. Instead, we propose switching the dimension order to YX instead of XY routing and back accordingly. Preliminary experimental results show that this approach maintains the simplicity of dimension-order routing and, therefore, its hardware efficiency, while greatly improving reachability. This approach can be combined with topology-agnostic approaches to reduce packet loss during algorithm reconfiguration time.

关键词： Networks-on-Chip routing algorithms fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：