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

IET International Conference on Information Science and Control Engineering 2012 (ICISCE 2012)

作者： Menwang Xie Min Yin Sha Li Yao Li University of Science and Technology of China Hefei China

ISBN: (纸本)9781629939254

Three-dimensional networks-on-chip (NoC) is proposed to achieve better communication performance, higher device density and lower power consumption. However, thermal issues resulted by stacked high power density architecture are significant challenges for design of 3D NoC architectural systems. In this paper, we explore the thermal impacts of routing algorithms for 3D mesh-based NoC architecture. The thermal impacts of routing algorithms are analyzed, and distinct temperature distributions caused by routing algorithms are discussed. The 3D Odd-Even routing algorithm with random selection scheme is compared with 3D Odd-Even routing algorithm with thermal-aware selection scheme. The experimental results show that 3D Odd-Even routing algorithm with thermal-aware selection scheme achieves higher throughput by 19% under 95°C temperature limits.

关键词： Thermal impact 3D network-on-chip Mesh routing algorithm routing algorithms Mesh Mesh Thermal Network routing algorithms Randomisation Three Dimensions

来源：评论

学校读者我要写书评

暂无评论

Low-Carbon routing algorithms For Cloud Computing Services in IP-over-WDM Networks

Low-Carbon Routing Algorithms For Cloud Computing Services i...

引用

IEEE International Conference on Communications

作者： Mirko Gattulli Massimo Tornatore Riccardo Fiandra Achille Pattavina Department of Electronics and Information Politecnico di Milano Fastweb S.p.A

ISBN: (纸本)9781457720529

Energy consumption in telecommunication networks keeps growing rapidly, mainly due to emergence of new Cloud Computing (CC) services that need to be supported by large data centers that consume a huge amount of energy and, in turn, cause the emission of enormous quantity of CO_2. Given the decreasing availability of fossil fuels and the raising concern about global warming, research is now focusing on novel "low-carbon" telecom solutions. E.g., based on today telecom technologies, data centers can be located near renewable energy plants and data can then be effectively transferred to these locations via reconfigurable optical networks, based on the principle that data can be moved more efficiently than electricity. This paper focuses on how to dynamically route on-demand optical circuits that are established to transfer energy-intensive data processing towards data centers powered with renewable energy. Our main contribution consists in devising two routing algorithms for connections supporting CC services, aimed at minimizing the CO_2 emissions of data centers by following the current availability of renewable energy (Sun and Wind). The trade-off with energy consumption for the transport equipments is also considered. The results show that relevant reductions, up to about 30% in CO_2 emissions can be achieved using our approaches compared to baseline shortest-path-based routing strategies, paying off only a marginal increase in terms of network blocking probability.

关键词： data center Fossil Fuels routing algorithms low-carbon Renewable energy energy capacity energy consumption Cloud Computing wavelength division multiplexing network Telecommunication Networks fuel crops Legal Services Fiber optic networks Emissions Telecommunications

来源：评论

学校读者我要写书评

暂无评论

Dynamic Route Selection for Vehicular Store-Carry-Forward Networks and Misbehaviour Vehicles Analysis

Dynamic Route Selection for Vehicular Store-Carry-Forward Ne...

引用

IEEE Vehicular Technology Conference

作者： Hu Yuan Carsten Maple Kevin Ghirardello Cyber Security Centre Univ. of Warwick Coventry UK

ISBN: (纸本)9781538663592;9781538663585

In this paper, we present realistic urban simulation results for store-carry-forward (SCF) relay communications within a cellular network. We describe two dynamic routing algorithms, minimising outage and minimising data packet travel time, which feature enhancements to increase the routing flexibility. It is shown that these enhancements to increase flexibility in re-routing the data leads to a dramatic decrease in the outage probability while only increasing packet travel time slightly. A misbehaviour model is analysed in this paper, in which misbehaving vehicles fail to follow the rules of the SCF routing algorithms. There are various reasons for a rogue vehicle to fail to obey the routing algorithm, including an intention to modify the message before onward transmission. Misbehaviour is detected by considering expected traffic density distributions. A Hidden Markov Model (HMM) is used to detect misbehaviour based on how data is passed by vehicles. Results show that the probability that misbehaviour is detected is 87% using this approach.

关键词： hidden Markov models mobile radio relay networks (telecommunication) telecommunication network reliability telecommunication network routing telecommunication traffic Disruptive Behavior Hidden Markov models telecommunication network reliability telecommunication network routing Mobile radios telecommunication traffic Route choice vehicle routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2017年第6期25卷 3670-3682页

作者： Shafiee, Mehrnoosh Ghaderi, Javad Columbia Univ Dept Elect Engn New York NY 10027 USA

We study the problem of load balancing in datacenter networks, namely, assigning the end-to-end data flows among the available paths in order to efficiently balance the load in the network. The solutions used today rely typically on an equal-cost multi path (ECMP) mechanism, which essentially attempts to balance the load in the network by hashing the flows to the available shortest paths. However, it is well-known that the ECMP performs poorly when there is asymmetry either in the network topology or the flow sizes, and thus, there has been much interest recently in alternative mechanisms to address these shortcomings. In this paper, we consider a general network topology where each link has a cost, which is a convex function of the link congestions. Flows among the various source-destination pairs are generated dynamically over time, each with a size (bandwidth requirement) and a duration. Once a flow is assigned to a path in the network, it consumes bandwidth equal to its size from all the links along its path for its duration. We consider low-complexity congestion-aware algorithms that assign the flows to the available paths in an online fashion and without splitting. Specifically, we propose a myopic algorithm that assigns every arriving flow to an available path with the minimum marginal cost (i.e., the path which yields the minimum increase in the network cost after assignment) and prove that it asymptotically minimizes the total network cost. Extensive simulation results are presented to verify the performance of the myopic algorithm under a wide range of traffic conditions and under different datacenter architectures. Furthermore, we propose randomized versions of our myopic algorithm, which have much lower complexity and empirically show that they can still perform very well in symmetric network topologies.

关键词： Markov chains load balancing online algorithms routing algorithms datacenter network

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Next-Generation information Highways Leveraging Universal OTN Switching and Flexible-Rate

Cost-Effective Next-Generation information Highways Leveragi...

引用

Optical Fiber Communications Conference and Exhibition (OFC)

作者： Gangopadhyay, Bodhisattwa Pedro, Joao Spaelter, Stefan Coriant Portugal R Irmaos Siemens 1-1A P-2720093 Amadora Portugal Inst Super Tecn Inst Telecomunicacoes Av Rovisco Pais P-1049001 Lisbon Portugal Coriant GmbH Sankt Martin Str 76 D-81541 Munich Germany

Current trend of data growth and revenue pattern make multi-layer network technology and architecture selection critical. This paper highlights how combining universal OTN switching and flexi-rate line interfaces can ... 详细信息

ISBN: (纸本)9781943580231

关键词： Modulation techniques Optical networks Packet switching routing algorithms Signal processing Switching

来源：评论

学校读者我要写书评

暂无评论

The Social Relationship Based Adaptive Multi-Spray-and-Wait routing Algorithm for Disruption Tolerant Network

引用

MOBILE INFORMATION SYSTEMS 2017年第1期2017卷

作者： Guan, Jianfeng Chu, Qi You, Ilsun Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China George Washington Univ Washington DC USA Soonchunhyang Univ Dept Informat Secur Engn Asan South Korea

The existing spray-based routing algorithms in DTN cannot dynamically adjust the number of message copies based on actual conditions, which results in a waste of resource and a reduction of the message delivery rate. Besides, the existing spray-based routing protocols may result in blind spots or dead end problems due to the limitation of various given metrics. Therefore, this paper proposes a social relationship based adaptive multiple spray-and-wait routing algorithm(called SRAMSW) which retransmits the message copies based on their residence times in the node via buffer management and selects forwarders based on the social relationship. By these means, the proposed algorithm can remove the plight of the message congestion in the buffer and improve the probability of replicas to reach their destinations. The simulation results under different scenarios show that the SRAMSW algorithm can improve the message delivery rate and reduce the messages' dwell time in the cache and further improve the buffer effectively.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Cubical layered Path Planning Algorithm (EECPPA) for Acoustic UWSNs

Energy Efficient Cubical layered Path Planning Algorithm (EE...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Aslam, Muhammad Wang, Fan Lv, Zefeng Asad, Muhammad Zafar, Samra Munir, Ehsan Ullah Hu, Xiaopeng Dalian Univ Technol Sch Comp Sci & Technol Dalian Peoples R China COMSATS Inst Informat Technol Dept Comp Sci Wah Cantt Pakistan

ISBN: (纸本)9781538607008

In this paper, we purpose Energy Efficient logical Cubical layered Path Planning Algorithm (EECPPA) and Multiple Sink EECPPA (MSEECPPA) for acoustic 3D Under Water Sensor Networks (UWSNs). EECPPA and MSEECPPA algorithms are completely distributed and highly adoptive in their execution in logical divided 3D networks into multiple cubes. Proposed models are flexible during location variations of sensors and have excellent ability to reconfigure the size of the logical cubes within 3D cubical UWSNs. These multiple logical cubes play vital role in selection of multiple group leading nodes, called Cluster Heads (CHs). The iterative executional operation of EECPPA and MSEECPPAA is divided into three phases called;Network Dimensional Phase (NDP), Network Settling Phase (NSP) and Network Transmission Phase (NTP). In first phase, multiple cubical layers are constructed, in second leading nodes are selected near the reference point of logical cube's boundaries and in NTP actual communications of the nodes take place. MSEECPPA algorithm selects the suitable relaying nodes called multiple sinks to utilize the multi-hoping mechanism to increase the lifetime of longer distance nodes from the Base Station (BS). Extensive simulation experiments provide the encouraging findings that proposed models outperform the DBR routing protocol in successful packet delivery, less propagational delay and better network lifetime.

关键词： Clustering Energy Efficient routing algorithms Heterogeneous Underwater Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

Analysis, design and simulation of Internet of Things routing algorithm based on ant colony optimization

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2017年第8期30卷 1-1页

作者： Said, Omar Menoufia Univ Math & Comp Sci Dept Coll Sci Menoufia 32511 Egypt

In this paper, a routing algorithm to optimize the selection of the best path for the transmitted data within the Internet of Things (IoT) system is proposed. The algorithm controls the use of ant colony ideas in the IoT system to obtain the best routing benefit. It divides the IoT environment into categorized areas depending on network types. Then, it applies the most suitable ant colony algorithm to the concerned network within each area. Furthermore, the algorithm considers routing problem in intersected areas that may arise in case of IoT system. Finally, Network Simulator 2 is used to evaluate the proposed algorithm performance. Simulation results demonstrate the effectiveness of the proposed routing algorithm in terms of end-to-end delay, packet loss ratio, bandwidth consumption, throughput, overhead of control bits, and energy consumption ratio. Copyright (C) 2016 John Wiley & Sons, Ltd.

关键词： IoT ant colony optimization routing algorithms internetworking

来源：评论

学校读者我要写书评

暂无评论

A Heuristic for Multi-modal Route Planning 13th

A Heuristic for Multi-modal Route Planning

引用

13th Location-Based Services (LBS) Conference

作者： Bucher, Dominik Jonietz, David Raubal, Martin Swiss Fed Inst Technol Inst Cartog & Geoinformat Stefano Franscini Pl 5 CH-8093 Zurich Switzerland

ISBN: (纸本)9783319472898;9783319472881

Current popular multi-modal routing systems often do not move beyond combining regularly scheduled public transportation with walking, cycling or car driving. Seldom included are other travel options such as carpooling, carsharing, or bikesharing, as well as the possibility to compute personalized results tailored to the specific needs and preferences of the individual user. Partially, this is due to the fact that the inclusion of various modes of transportation and user requirements quickly leads to complex, semantically enriched graph structures, which to a certain degree impede downstream procedures such as dynamic graph updates or route queries. In this paper, we aim to reduce the computational effort and specification complexity of personalized multi-modal routing by use of a preceding heuristic, which, based on information stored in a user profile, derives a set of feasible candidate travel options, which can then be evaluated by a traditional routing algorithm. We demonstrate the applicability of the proposed system with two practical examples.

关键词： Multi-modal routing routing algorithms Personalization

来源：评论

学校读者我要写书评

暂无评论

routing Protocols for VANETs: An Approach based on Genetic algorithms

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2016年第2期10卷 542-558页

作者： Wille, Emilio C. G. Del Monego, Hermes I. Coutinho, Bruno V. Basilio, Giovanna G. Univ Tecnol Fed Parana CPGEI Ave Sete Setembro 3165 Curitiba Parana Brazil

Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source routing Protocol (DSR) and on the use of Genetic algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

关键词： VANETs Mobility Simulation routing algorithms AODV DSR Genetic algorithms Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：