检索结果-南通市图书馆

Spray and forward:Efficient routing based on the Markov location prediction model for DTNs

Science China(Information Sciences) 2012年第2期55卷 433-440页

作者： DANG Fei1,YANG XiaoLong1,2 & LONG KePing2 1 Research Center for Optical Internet and Mobile Information Networks(COIMIN),University of Electronic Science and Technology of China,Chengdu 611731,China 2 School of Computer and Communications Engineering,University of Science and Technology Beijing,Beijing 100083,China 1. Research Center for Optical Internet and Mobile Information Networks (COIMIN) University of Electronic Science and Technology of China Chengdu 611731 China2. School of Computer and Communications Engineering University of Science and Technology Beijing Beijing 100083 China

Typical delay tolerant networks(DTNs)often suffer from long and variable delays,frequent connectivity disruptions,and high bit error *** DTNs,the design of an efficient routing algorithm is one of the key *** existing methods improve the accessibility probability of the data transmission by transmitting many copies of the packet to the network,but they may cause a high network *** address the tradeoff between a successful delivery ratio and the network overhead,we propose a DTN routing algorithm based on the Markov location prediction model,called the spray and forward routing algorithm(SFR).Based on historical information of the nodes,the algorithm uses the second-order Markov forecasting mechanism to predict the location of the destination node,and then forwards the data by greedy routing,which reduces the copies of packets by spraying the packets in a particular *** contrast to a fixed mode where a successful-delivery ratio and routing overhead are contradictory,a hybrid strategy with multi-copy forwarding is able to reduce the copies of the packets efficiently and at the same time maintain an acceptable successful-delivery *** simulation results show that the proposed SFR is efficient enough to provide better network performance than the spray and wait routing algorithm,in scenarios with sparse node density and fast mobility of the nodes.

关键词： delay tolerant networks spray and forward Markov position prediction routing algorithm

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Impact of joint resource partitioning and routing on performance of relay enhanced cellular networks

引用

Journal of Harbin Institute of Technology(New Series) 2008年第4期15卷 465-469页

作者：刘涛戎蒙恬史宏逵 Dept.of Electronic Engineering Shanghai Jiaotong University

Radio resource assignment schemes and routing strategies in relay enhanced cellular networks are proposed in this paper. Under the reuse partitioning-based frequency planning framework, the intra-cell resource partitioning between the base station and relay nodes was addressed firstly by introducing a metric of effective reuse factor. Then, coverage-oriented and capacity-oriented rantings, as well as two link bandwidth assignment schemes＂ equal-bandwidth per link＂ and ＂equal-bandwidth per mobile station＂ were developed. These key issues and their impacts on the system performance were analyzed comprehensively and supported by simulations. Results show that the cell capacity and edge user throughput of the proposed network are superior to the traditional non-relay network when an appropriate effective reuse factor is adopted.

关键词： resource partitioning relay enhanced cellular network routing algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

routing on Metacyclic Graphs

引用

计算机科学 2002年第z1期29卷 101-102页

作者： Wenjun Xiao P.O. Box 1003 Xiamen University Xiamen 361005 P.R. China

Wu, Lakshmivarahan and Dhall[5] recently described a deterministic, distributed routing scheme for some special classes of metacyclic graphs. However they have no proof of correctness that the scheme is a shortest pat... 详细信息

关键词： Metacyclic graph routing algorithm Interconnection network

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A Time and Space-based Dynamic IP routing in Broadband Satellite Networks

引用

The Journal of China Universities of Posts and Telecommunications 2003年第2期10卷 1-10页

作者： ZHANG Deng yin, QIAO Li xia, WANG Shao di (Nanjing University of Posts and Telecommunications, Nanjing 210003, P.R. China) Nanjing University of Posts and Telecommunications Nanjing 210003

The topology architecture, characteristics and routing technologies ofbroadband satellite net-works are studied in this paper. The authors propose the routing scheme ofsatellite networks and design a time and space-based distributed routing algorithm whose complexityis O (1). Simulation results aiming at satellite mobility show that the new algorithm can determinethe minimum propagation delay paths effectively.

关键词： satellite networks routing algorithm IP protocol

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Reasonable routing in delay/disruption tolerant networks

引用

Frontiers of Materials Science 2011年第3期5卷 327-334页

作者： Haizheng YU Jianfeng MA Hong BIAN College of Mathematics and System Sciences Xinjiang University Urumqi 830046 China Key Laboratory of Computer Network and Information Security Xidian University Xi＇an 710071 China School of Mathematical Sciences Xinjiang Normal University Urumqi 830054 China

Delay/disruption tolerant networking （DTN） is an approach to networking where intermittent connectivity exists： it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live （TTL） and antipacket methods, in both redundancy and delivery success efficiency.

关键词： delay/disruption tolerant networks (DTN) routing algorithm Markov chain message redundancy

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

HyBar:high efficient barrier synchronization based on a hybrid packet-circuit switching Network-on-Chip

引用

Science China(Information Sciences) 2017年第6期60卷 237-248页

作者： Zhenqi WEI Peilin LIU Rongdi SUN School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University

Realizing barrier synchronization in multi-/many-core processors with high efficiency becomes more and more challenging as the number of cores integrated in a single chip keeps growing. Quite a few barrier solutions have been proposed, while they provide limited improvements for synchronizing large amounts of cores or incur unfavorable restrictions on performing concurrent barriers. This paper presents Hy Bar, a hardware barrier based on a hybrid switching No C which adopts packet switching and circuit switching methods in two sub-networks respectively. Dedicated channels in the circuit-switching sub-network are dynamically built and removed when barrier requests traverse the packet-switching sub-network according to a modified dimensionorder routing algorithm. The efficiency of inter-core communication for concurrent barriers is improved by merging barrier arrival requests and broadcasting release requests along the circuit channels. The execution time of synthetic cases, benchmark kernels and parallel applications using various barrier solutions are evaluated in an RTL-based simulation platform. Experimental results show that our proposal provides about 15%–50%performance improvement compared to previous solutions, while the hardware overhead is marginal under SMIC40 nm technology. Moreover, Hy Bar introduces a minor efficiency loss for concurrent barriers with no limitation on their layouts of participating cores in the on-chip network.

关键词： NoC barrier synchronization packet-circuit switching concurrent barriers routing algorithm

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Stealth-ACK: stealth transmissions of No C acknowledgements

引用

Science China(Information Sciences) 2017年第9期60卷 21-35页

作者： Jinhua TAO Shi QIU Shaoli LIU Tianshi CHEN Rui MAO Institute of Computing Technology Chinese Academy of Sciences College of Computer Science and Software Engineering Shenzhen University

Network-on-Chip(No C) is a promising replacement of bus architecture due to its better *** state-of-the-art No Cs, each packet contains several fixed-length flits, which facilitates allocations of network resources but brings in many unused bits. In this paper, we propose a novel technique called Stealth-ACK to effectively address the above problem. Stealth-ACK leverages unused bits in head flits of non-ACK packets to carry and stealthily transmit ACK information. Such stealth transmissions of ACK information effectively reduce not only the amount of dedicated ACK packets on No C, but also the number of unused bits in head flits of non-ACK packets, which significantly reduces wastes on No C bandwidth. Experimental results show that Stealth-ACK averagely increases the throughput of 16 × 16 2-D mesh No C by 11.9%, and averagely reduces the No C latency by 34.8% on application traces of SPLASH-2. Moreover, Stealth-ACK only requires trivial hardware modification to basic router architectures, which incurs negligible power consumption and area cost.

关键词： networks-on-chip acknowledgement packet router architecture optimisation routing algorithm

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Reliability assessment of networks-on-chip based on analytical models

引用

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2009年第12期10卷 1801-1814页

作者： Mojtaba VALINATAJ Siamak MOHAMMADI Saeed SAFARI School of Electrical and Computer Engineering College of Engineering University of Tehran

As technology scales down, the reliability issues are becoming more crucial, especially for networks-on-chip (NoCs) that provide the communication requirements of multi-processor systems-on-chip. Reliability evaluation based on analytical models is a precise method for dependability analysis before and after designing the fault-tolerant systems. In this paper, we accurately formulate the inherent reliability and vulnerability of some popular NoC architectures against permanent faults, also depending on the employed routing algorithm and traffic model. Based on this analysis, effects of failures in the links, switches and network interfaces on the packet delivery of NoCs are determined. Besides, some extensions to evaluate a fault-tolerant method and some routing algorithms are described. The analyses are validated through appropriate simulations. The results thus obtained are exactly the same as or very close to the analytical ones.

关键词： Networks-on-chip (NoCs) Traffic model routing algorithm Reliability assessment Permanent fault

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Research on Next-Generation Scalable Routers Implemented with H-Torus Topology

引用

Journal of Computer Science & Technology 2008年第4期23卷 684-692,F0003页

作者：赵有健乐祖晖吴建平 Department of Computer Science Tsinghua University

The exponential growth of user traffic has been driving routers to run at higher capacity. In a traditional router, the centralized switching fabric is becoming the bottleneck for its limited number of ports and complicated scheduling algorithms. Direct networks, such as 3-D Torus topology, have been successfully applied to the design of scalable routers. They show good scalability and fault tolerance. Unfortunately, its scalability is limited in practice. In this paper, we introduce another type of direct network, called H-Torus. This network shows excellent topological properties. On its basis, the designs of line card and routing algorithms are introduced. Extensive simulations show that the routing algorithm is very important in such a system and results in low latency with high throughput.

关键词： router switch fabric direct network H-Torus routing algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Efficient Realization of Frequently Used Bijections on Cube-Connected Cycles

引用

Journal of Computer Science & Technology 1995年第4期10卷 298-309页

作者：刘群刘志勇张祥 InstituteofComputingTechnology TheChineseAcademyofSciencesBeijing100080

CCC has lower hardware complexity than hypercube and is suited for current VLSI technology LC-permutations are a large set of important permutations frequently used in various parallel computations. Existing routing algorithms for CCC cannot realize LC-permutations without network conflict. Wepresent an algorithm to realize LC-permutations on CCC. The algorithm consists of two periods of inter-cycle transmissions and one period of inner-cycletransmissions. In the inter-cycle transmissions the dimensional links of CCCare used in a 'pipeline' manner and in the innercycle transmissions the datapackets are sorted by a part of its destination address. The algorithm is fast(O(log2 N)) and no conflict will occur.

关键词： Hypercube cube-connected cycles linear complement permutation routing algorithm conflict complexity

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：