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

IEEE International Conference on Information, Communication, Instrumentation and Control (ICICIC)

作者： Thakur, Uma K. Dethe, C. G. St Gadge Baba Amravati Univ Amravati Maharashtra India

ISBN: (纸本)9781509063147;9781509063130

Wireless network are of two types, Base station (BS) oriented wireless network and Ad hoc wireless network. Base station oriented is single hop that requires fixed base station having better performance and more reliable, whereas Ad hoc wireless network does not have any centralized administration and mobile host are dependent on each other for communication. But when BS failure causes the problems in the network in base station oriented network and rerouting caused by mobility and disrupted connection causes the problems in ad hoc network. Therefore we use here the Hybrid Wireless Network (HWN), is basically a wireless network consisting of mobile nodes communicate with each other with or without any infrastructure support [2]. In HWN mobile nodes communicate with each other using ad hoc mode when they are in range and use BS to communicate when they are out of range. HWN is more efficient, reliable and flexible with seamless handover. wireless communication gains popularity, significant research has been devoted to supporting real-time transmission with stringent Quality of Service (QoS) requirements for wireless applications. A wireless hybrid network integrates a mobile wireless ad hoc network (MANET) and a wireless infrastructure network has been proven to be a better alternative for the next generation wireless networks.

关键词： Hybrid wireless networks cellular networks routing algorithms quality of service

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for Throughput Maximization in Software-Defined Networks With Consolidated Middleboxes

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2017年第3期14卷 631-645页

作者： Huang, Meitian Liang, Weifa Xu, Zichuan Guo, Song Australian Natl Univ Res Sch Comp Sci Canberra ACT 2601 Australia Dalian Univ Technol Sch Software Dalian 116024 Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

Today's computer networks rely on a wide spectrum of specialized middleboxes to improve network security and performance. A promising emerging technique to implementing traditional middleboxes is the consolidated middlebox technique, which implements the middleboxes as software in virtual machines in software-defined networks (SDNs), offering economical, and simplified management for middleboxes. This however poses a great challenge, that is, how to find a cost-optimal routing path for each user request such that the data traffic of the request will pass through the middleboxes in their orders in the service chain of the request, with the objective to maximize the network throughput, subject to various resource capacity constraints in SDNs. In this paper, we study the network throughput maximization problem in an SDN under two different scenarios: one is the snapshot scenario where a set of requests at one time slot is given, we aim to admit as many requests in the set as possible to maximize the network throughput;another is the online scenario in which requests arrive one by one without the knowledge of future arrivals. Given a finite time horizon consisting of T equal time slots, the system must respond to the arrived requests in the beginning of each time slot, by either admitting or rejecting the requests, depending on the resource availabilities in the network. For the snapshot scenario, we first formulate an integer linear program (ILP) solution, we then devise two heuristics that strive for fine tradeoffs between the quality of a solution and the running time of obtaining the solution. For the online scenario, we show how to extend the proposed algorithms for the snapshot scenario to solve the online scenario. We finally evaluate the performance of the proposed algorithms through experimental simulations, based on both real and synthetic network topologies. Experimental results demonstrate that the proposed algorithms admit more requests than the baseline al

关键词： Software-defined networking network function virtualization consolidated middleboxes throughput maximization routing algorithms online algorithms network resource allocations

来源：评论

学校读者我要写书评

暂无评论

Optimization of sawmill residues collection for bioenergy production

引用

APPLIED ENERGY 2017年 202卷 487-495页

作者： Zamar, David S. Gopaluni, Bhushan Sokhansanj, Shahab Univ British Columbia Dept Chem & Biol Engn Vancouver BC V6T 1Z3 Canada Oak Ridge Natl Lab Resource & Engn Syst Grp Div Environm Sci Oak Ridge TN 37831 USA

The collection of sawmill residues is an important logistic activity for the pulp and paper industry, which uses the biomass as a source of energy. We study a vehicle routing problem for a network composed of a single depot and several sawmills. The sawmills serve as potential suppliers of biomass residues to the depot, which in turn processes and distributes the residues to the pulp and paper mills. This problem consists of identifying the best daily routing schedule for a fixed number of trucks. The objective is to maximize the ratio of energy returned on energy invested, while satisfying a minimum daily amount of dried biomass residues. There are several random components in the problem, including the availability and moisture content of the biomass residues. We use a combination of scenario analysis and heuristics to solve this stochastic vehicle routing problem. A performance comparison of the proposed method reveals an estimated daily energy savings of 6 GJ over the benchmark method. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Renewable energy systems routing algorithms Robust estimation Uncertainty Stochastic approximation Logistics modeling

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Optimization of Energy Consumption and Delay Performance for Green Communication in Internet of Things

引用

MOBILE INFORMATION SYSTEMS 2017年第Pt.2期2017卷 3206160.1-3206160.1页

作者： Wang, Jiaze Hu, Chunhua Liu, Anfeng Cent South Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Hunan Univ Commerce Key Lab Hunan Prov Mobile Business Intelligence Changsha 410205 Hunan Peoples R China Hunan Univ Commerce Mobile E Business Collaborat Innovat Ctr Hunan Pr Changsha 410205 Hunan Peoples R China

Energy efficiency as well as fast data transmission is vital to green communications-based applications for Internet of Things (IoT). Wireless sensors, which constitute one of the important parts of IoT, adopt duty cycle operating mode to save energy. Although duty cycle operating mode will decrease the energy consumption of sensor nodes, it leads to a larger communication delay. In this paper, a utility-based adaptive duty cycle (UADC) routing algorithm is proposed to increase energy efficiency, reduce transmission delay, and keep long lifetime at the same time. First, UADC routing algorithm adopts a comprehensive performance evaluation function to evaluate the utility of choosing different relay nodes. Then it selects the node which maximizes the utility of the system to perform data relay. The utility function synthesizes comprehensive indexes like the reliability, energy consumption, and delay of the node. UADC routing algorithm adopts a high-duty cycle operating mode in the areas which have more remaining energy to decrease the delay. And a low-duty cycle operating mode in the energy-strained areas is adopted to ensure a long lifetime. The simulation results also prove the significant performances of our proposed algorithms.

关键词： energy consumption Utility functions Transport delay delay Internet of things routing algorithms Performance Evaluation data transmission operation mode Thing Internets DUTY CYCLE Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Determining an Optimal Set of Work Zones on Large Infrastructure Networks in a GIS Framework

引用

JOURNAL OF INFRASTRUCTURE SYSTEMS 2018年第1期24卷 04017048-04017048页

作者： Lethanh, Nam Adey, Bryan T. Burkhalter, Marcel POMPLUS Consulting Ltd P2001B C1 TowerECOPK Hung Yen Vietnam Swiss Fed Inst Technol Zurich Infrastruct Management Inst Construct & Infrastruct Management HIL F 24-3Stefano Franscini Pl 5 CH-8093 Zurich Switzerland Swiss Fed Inst Technol Zurich Infrastruct Management Grp Inst Construct & Infrastruct Management HIL F 24-1Stefano Franscini Pl 5 CH-8093 Zurich Switzerland

A road network consists of multiple objects that deteriorate over time with different speeds of deterioration. In order to provide an adequate level of service over time, these objects will eventually require interventions. As road managers are trying, in general, to maximize the benefit obtained from the road network, it is in their interest to determine intervention programs, which consist of the grouping of interventions in work zones. The determination of optimal intervention programs is relatively complicated when considering single objects, but it becomes even more so when considering multiple objects embedded within a network. The objects to be included in the work zones at each time interval depend on many factors, such as the interventions to be executed on the objects, the maximum allowable length of the work zones, the traffic configurations to be used in the work zones and the available financial resources. Although some initial research in this area has been conducted, none has determined the optimal set of work zones on large infrastructure networks in a geographical information system (GIS) framework, which is necessary in the world of modern infrastructure management. In the work presented in this paper, a GIS-based program was developed to determine optimal intervention programs for large infrastructure networks using a linear optimization model, which can be linked directly to a GIS. The model includes constraints on the amount of available resources, on the length of the work zone, and on the distance between two work zones. A constraint-constructing algorithm is used in order to set up the latter two constraints. The program is illustrated by determining the optimal set of work zones for an example road network similar to the one in the canton of Wallis, Switzerland, including more than 2,000 bridges, tunnels, and road sections. (c) 2017 American Society of Civil Engineers.

关键词： Infrastructure management Work zones Geographic information systems routing algorithms Roads

来源：评论

学校读者我要写书评

暂无评论

Efficient network isolation and load balancing in multi-tenant HPC clusters

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2017年 72卷 145-162页

作者： Zahid, Feroz Gran, Ernst Gunnar Bogdanski, Bartosz Johnsen, Bjorn Dag Skeie, Tor Simula Res Lab Martin Linges Vei 25 N-1364 Fornebu Norway Univ Oslo Oslo Norway Oracle Corp Lysaker Norway

Multi-tenancy promises high utilization of available system resources and helps maintaining cost-effective operations for service providers. However, multi-tenant high-performance computing (HPC) infrastructures, like dynamic HPC clouds, bring unique challenges, both associated with providing performance isolation to the tenants, and achieving efficient load-balancing across the network fabric. Each tenant should experience predictable network performance, unaffected by the workload of other tenants. At the same time, it is equally important that the network links are balanced, avoiding network saturation. The network saturation can lead to unpredictable application performance, and a potential loss of profit for the cloud service providers. In this paper, we present two significant extensions to our previously proposed partition-aware fat-tree routing algorithm, pFTree, for InfiniBand-based HPC systems. First, we extend pFTree to incorporate provider defined partition-wise policies that govern how the nodes in different partitions are allowed to share network resources with each other. Second, we present a weighted version of the pFTree routing algorithm, that besides partitions, also takes node traffic characteristics into account to balance load across the network links more evenly. A comprehensive evaluation comprising both real-world experiments and simulations confirms the correctness and feasibility of the proposed extensions. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Interconnection networks routing algorithms Performance isolation Load balancing InfiniBand Virtual channels

来源：评论

学校读者我要写书评

暂无评论

Compact Automatic Metal routing Algorithm in DSM technologies

Compact Automatic Metal Routing Algorithm in DSM technologie...

引用

2017 International Conference on Computing, Communication, Control and Automation, ICCUBEA 2017

作者： Khurge, Deepti Prashant Kulkarni, Pratik Sharma, Vinay Pimpri Chinchwad College of Engineering E and TC Department Akurdi Pune India Pimpri Chinchwad College of Engineering Akurdi Pune India Ni Logic Pvt. Ltd. Kothrud Pune India

ISBN: (纸本)9781538640081

Today's miniaturisation of devices and many of foundries are fabricating the IC's in 20nm and 14nm technology like INTEL, TSMC. 20nm and 14nm is a drastic shrinking in silicon size called deep submicron technology (DSM) which are driving most of the today's products like mobile phones, laptops. With the introduction of DSM technologies there is a huge impact on routing because of increased numbers of transistor and eventually space of routing. There are various CMOS design tools which can convert a design into a layout and efficient routing. One of such program is MICROWIND which has inbuilt placement and routing tool and algorithms to place and interconnect transistors using various metal layers in DSM technologies. To increase the performance for such routing, higher number of metal layers can be used in physical design layout and such features should be introduced in a EDA tool in accordance with technology rules. This paper focuses on optimizing routing algorithm used by MICROWIND to efficiently perform routing, reducing load on routing space. By using this feature we can reduce the delays, interconnect length, routing pitch and area on chip. © 2017 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy efficient routing algorithm for wireless sensor networks: A distributed approach

Energy efficient routing algorithm for wireless sensor netwo...

引用

International Conference on Communication and Computing Systems, ICCCS 2016

作者： Gupta, Suneet Kumar Kuila, Pratyay Jana, Prasanta K. Department of Information Technology ABES Engineering College GhaziabadUttar Pradesh India Department of Computer Science and Engineering National Institute of Technology SikkimGangtok India Department of Computer Science and Engineering Indian School of Mines DhanbadJharkhand India

ISBN: (纸本)9781138029521

In this article, we present an energy efficient routing algorithm for Wireless Sensor Networks (WSNs). Proposed algorithm finds the next hop in each round which is based on the residual energy. The proposed algorithm selects the next hop based on residual energy in each round. The parameters residual energy and distance make the algorithm energy efficient and other parameters i.e. number of predecessor and successor also improve the chances that each node equally act as the next hop. Experimentally, it is demonstrated that the performance of proposed algorithm is better than existing algorithms in terms of inactive relay nodes, data packet send to BS and consumption of energy in each round. © 2017 Taylor & Francis Group, London.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An end-to-end qos routing on software defined network based on hierarchical token bucket queuing discipline 17

An end-to-end qos routing on software defined network based ...

引用

2017 International Conference on Data Mining, Communications and Information Technology, DMCIT 2017

作者： Ren, Shuangyin Feng, Quanyou Dou, Wenhua School of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450352185

Software Defined Network is a network architecture where network control is decoupled from forwarding plane and is directly programmable. Control plane monitors data plane's behavior and retrieves an integrated view of data plane. Comparing with classic RSVP based Integrated Services, Decoupled control plane provides a new access to End-to-End guarantee QoS routing. An End-to-End QoS routing algorithm is realized in Mininet with Open vSwitch as forwarding switch and Ryu as remote controller. Open vSwitch here utilizes Hierarchical Token Bucket queuing discipline to manage bandwidth. routing algorithms are realized in Ryu controller based on graphs for Best Effort and QoS data flows respectively. Shortest path routing runs for Best Effort flow based on distance graph of switches. Shortest QoS path routing runs for QoS flow based on resource residual graph. System verification and simulation shows that routing algorithms work with different kinds of tests, and routing algorithm could also work if some failure are introduced. © 2017 Association for Computing Machinery.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Color-based cooperative cache and its routing scheme for telco-CDNs

Color-based cooperative cache and its routing scheme for tel...

引用

作者： Nakajima, Takuma Yoshimi, Masato Wu, Celimuge Yoshinaga, Tsutomu University of Electro-Communications Chofu-shi182–8585 Japan

Cooperative caching is a key technique to reduce rapid growing video-on-demand’s traffic by aggregating multiple cache storages. Existing strategies periodically calculate a sub-optimal allocation of the content caches in the network. Although such technique could reduce the generated traffic between servers, it comes with the cost of a large computational overhead. This overhead will be the cause of preventing these caches from following the rapid change in the access pattern. In this paper, we propose a light-weight scheme for cooperative caching by grouping contents and servers with color tags. In our proposal, we associate servers and caches through a color tag, with the aim to increase the effective cache capacity by storing different contents among servers. In addition to the color tags, we propose a novel hybrid caching scheme that divides its storage area into colored LFU (Least Frequently Used) and no-color LRU (Least Recently Used) areas. The colored LFU area stores color-matching contents to increase cache hit rate and no-color LRU area follows rapid changes in access patterns by storing popular contents regardless of their tags. On the top of the proposed architecture, we also present a new routing algorithm that takes benefit of the color tags information to reduce the traffic by fetching cached contents from the nearest server. Evaluation results, using a backbone network topology, showed that our color-tag based caching scheme could achieve a performance close to the sub-optimal one obtained with a genetic algorithm calculation, with only a few seconds of computational overhead. Furthermore, the proposed hybrid caching could limit the degradation of hit rate from 13.9% in conventional non-colored LFU, to only 2.3%, which proves the capability of our scheme to follow rapid insertions of new popular contents. Finally, the color-based routing scheme could reduce the traffic by up to 31.9% when compared with the shortest-path routing. Copyright © 2017 The

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：