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

6th IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： U-chupala, Pongsakorn Ichikawa, Kohei Iida, Hajimu Kessaraphong, Nawawit Uthayopas, Putchong Date, Susumu Abe, Hirotake Yamanaka, Hiroaki Kawai, Eiji Nara Inst Sci & Technol Nara Japan Kasetsart Univ Bangkok Thailand Osaka Univ Suita Osaka Japan Univ Tsukuba Tsukuba Ibaraki Japan Natl Inst Informat & Commun Technol Tokyo Japan

ISBN: (纸本)9781479940936

Bandwidth and latency are two major factors that contribute the most to network application performance. Between each pair of switches in a network, there may be multiple paths connecting them. Each path has different properties because of multiple factors. Traditional shortest-path routing does not take this knowledge into consideration and may result in sub-optimal performance of applications and underutilization of network. We proposed a concept of "bandwidth and latency aware routing". The idea is that we could improve overall performance of the network by separating application into bandwidth-oriented and latency-oriented application and allocate different route for each type of application accordingly. We also proposed a design of this network system implemented using OpenFlow. Routes are calculated from monitored information using dijkstra algorithm and its variation. To support our design, we show a use case in which our design performs better than traditional routing as well as evaluation results.

关键词： telecommunication network routing dijkstra algorithm OpenFlow network application-oriented bandwidth bandwidth aware routing bandwidth-oriented application latency aware routing latency-oriented application Bandwidth Benchmark testing Control systems Electronic mail Monitoring Routing Virtual machining

来源：评论

学校读者我要写书评

暂无评论

Dynamic Cluster Based Energy Controlled Routing In Wireless Sensor Networks

Dynamic Cluster Based Energy Controlled Routing In Wireless ...

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： Shalma, H. Rajesh, R. Adhiparasakthi Engn Coll Melmaruvathur India

ISBN: (纸本)9781479938346

Fault tolerance has been identified as key challenges in the design and operations of Wireless Sensor Network (WSNs). Failures are inevitable in wireless sensor networks due to inhospitable environment and unattended deployment. Therefore, it is necessary to detect the networks for recovery from the failure to sustain it. WSNs are self-organized using clustering algorithms to conserve energy. The sensor nodes are organized in several small clusters where there are cluster heads in each cluster. These CHs (Cluster Heads) gather data from their local clusters aggregate them & send them to the base station with shortest distance as a forwarding metric using dijkstra algorithm. The proposed scheme is supposed to be an efficient fault detection and recovery mechanism to make the network fault-tolerant and achieve reliability, latency and energy efficiency. Performance analysis and evaluation will be made using several scenarios of wireless sensor networks.

关键词： Energy Efficiency Fault tolerance dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Clustering Optimization for Multi-Channel Cooperative Sensing in CRNs

Multi-Objective Clustering Optimization for Multi-Channel Co...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Celik, Abdulkadir Kamal, Ahmed E. Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

ISBN: (纸本)9781479935123

Cooperative spectrum sensing (CSS) has been extensively studied in the literature to mitigate the weakness of spectrum sensing against hostile propagation phenomenon. Especially for large networks, clustered CSS is preferred to alleviate the energy efficiency, delay and overhead problems. In this study, reporting and sensing channels are first modeled with the consideration of path loss and fading. Then, CSS is divided into three phases: 1) In sensing phase, optimal sensing time is obtained for each local user subject to local detection and false alarm probability thresholds, 2) In reporting phase, adopting dijkstra's algorithm, multi-hop paths with the maximum success rate and cluster head (CH) selection which gives the mimimum total error rate within each cluster is computed, and 3) In decision phase, collecting independent but unidentically distributed (i.u.d.) member decisions, the CH decides on channel occupancy based on an optimal voting rule for i.u.d. reports. Next, following the phases above, a multi-objective clustering optimization (MOCO) is formulated to select SUs into cluster seeking energy and throughput efficiency goals subject to global detection and false alarm probability constraints. Finally, the Non-dominated Sorting Genetic algorithm-II (NSGA-II) is employed to solve MOCO. Results based on our approach are presented and the merits of this approach are demonstrated.

关键词： cognitive radio cooperative communication genetic algorithms probability radio spectrum management CRN CSS dijkstra algorithm MOCO NSGA-II channel occupancy cluster head selection cluster seeking energy cooperative spectrum sensing decision phase false alarm probability thresholds local detection local user maximum success rate multichannel cooperative sensing multiobjective clustering optimization nondominated sorting genetic algorithm-II optimal sensing time optimal voting rule reporting phase sensing phase throughput efficiency Cascading style sheets Clustering algorithms Fading Sensors Signal to noise ratio Throughput Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of shortest path routing algorithms in wide all-optical WDM networks

Performance Evaluation of shortest path routing algorithms i...

引用

International Conference on Multimedia Computing and Systems (ICMCS)

作者： Zyane, Abdellah Guennoun, Zouhair Taous, Omar Cadi Ayyad Univ Dept Comp Sci Natl Sch Appl Sci ENSAS Safi Morocco Mohammadia Sch Engn EMI LEC Elect & Commun Lab Rabat Morocco

ISBN: (纸本)9781479938247

This paper presents the effects of shortest path routing in wavelength-routed optical WDM networks;in particular we evaluated the effect of this routing scheme on the performance of wide all-optical WDM networks. Given a session request and a number of available wavelengths on each optical fiber, the routing and wavelength assignment (RWA) problem is to establish a lightpath (routing subproblem), i.e., to determine a path between two nodes, and also assign a wavelength along this path (wavelength assignment subproblem), so to maximize the number of satisfied requests for connections by taking into account some constraints. This study focuses on the routing subproblem in wavelength-routed all-optical WDM networks. We use dijkstra's shortest path algorithm, to determine the shortest paths in terms of the number of hops (we assume that the links have the same weight, uniform traffic) from the source to other nodes in the network. We evaluate, for the first time, the performance of this algorithm for optical routing and we study the impact on the load distribution over the wide all-optical WDM network links. We also implement a simulation interface to evaluate this algorithm in wide all-optical WDM networks (different optical networks topologies were used in the simulation). This paper describes the inadequacy of the use of standard dijkstra's shortest path routing, as it produces more unbalanced routes over the network links and unnecessary link overload.

关键词： All-Optical Networks Shortest path Performance Evaluation Optical routing dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A minimal encirclement algorithm for blockade problem with its application 33

A minimal encirclement algorithm for blockade problem with i...

引用

33rd Chinese Control Conference (CCC)

作者： Ding, Zhaozhen Cai, Chenxiao Xu, Wenkang Nanjing Univ Sci & Technol Sch Automat Nanjing Peoples R China

ISBN: (纸本)9789881563842

In this paper, it is studied a blockade problem about suspect escape with using graph theory. A minimum encirclement generation algorithm is proposed to convert this problem into a matching problem. Then the specific blockade plan is obtained. As the algorithm is a sort of polynomial time algorithm, it can obtain the global optimum in a relative shorter time compared with other algorithms. A series of evaluation criterion and numerical example are finally simulated to measure the effectiveness of proposed the blockade plan.

关键词： Blockade Problem Encirclement Generation algorithm Time Complexity dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Incentive Based Multi-Objective Optimization in Electric Vehicle Navigation including Battery Charging

引用

IFAC Proceedings Volumes 2014年第3期47卷 6332-6337页

作者： Tomohisa Hayakawa Kyohei Ishikawa Jun-ichi Imura Hideaki Tanaka Masumi Toyoshima Akihito Iwai Tokyo Institute of Technology Tokyo Japan DENSO CORPORATION Aichi Japan DENSO International America Inc. Southfield USA

This paper proposes a framework for a navigation system of electric vehicles (EVs) that minimizes the expectation of the energy consumption of the entire users while enhancing the Quality of Life (QoL), i.e., reducing the travel time and cost in our context, of individual users. To this end, we provide users optional flexibility of selecting a preferable route based on the individual travel time and cost among the multiple candidates indicated by the system, while use an incentive approach to make users select a route that requires as low energy consumption as possible. We show by numerical simulations on Chukyo Area in Japan that the proposed method is effective.

关键词： Electric vehicles Incentive Smart charge Navigation Quality of Life dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An algorithm to Find K Shortest Path

引用

International English Education Research 2014年第10期 54-57页

作者： Gangming Sun Pin Wang Department of Mathematics and Computer Science Guangxi College of Education Guangxi Nannmg China 530023

In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2 n ＋ kw log 2 k）. If the request path does not contain the loop, the time complexity of the algorithm O（kn（w ＋ n log2 n）＋ kw log2 k）. The algorithm utilizes a simple extension of the dijkstra algorithm determined the end of the length of the shortest path to the other vertices, and then, based on these data, branch and bound method to identify the required path. Experimental results show that the actual running time has relations with the structure of FIG.

关键词： Branch and Bound Shortest Path dijkstra algorithm Fibonacei Heap

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of distribution routing optimization for warehousing logistics based on GIS

Design and implementation of distribution routing optimizati...

引用

2014 International Conference on Remote Sensing and Smart City(RSSC2014)

作者： Z.C.Zhang School of Management Science and Engineering Guangxi University of Finance and Economics

ISBN: (纸本)9781784660291

To improve the logistics service level and reduce the cost of logistics distribution, this paper focuses on the optimization problem of logistics distribution route. Firstly, common Vehicle Routing Problem(VRP) solving methods are analyzed. Then, by means of the powerful spatial geographic information and data processing ability of Geographic Information System(GIS) technology, dijkstra algorithm is implemented and its result is taken as the initial value to implement C-W saving mileage algorithm in GIS environment. Logistics distribution route optimization scheme is designed, and the optimization of distribution route is directly output in the electronic map. The visual output control for warehousing and distribution management is thus realized.

关键词： vehicle routing problem geographic information system distribution routing optimization dijkstra algorithm C-W saving mileage algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on Optimization of Water Supply Network Topology

Study on Optimization of Water Supply Network Topology

引用

2014 3rd International Conference on Micro Nano Devices,Structure and Computing Systems(MNDSCS 2014)

作者： Wei-zhuo Wang Ting-yu Zhang Architecture Engineering College Northeast Dianli University

optimization design of Water supply network is based on alignment. This research is done by analysis of cost per water quantity of cubic meter for supplying, and takes expenses as weights of pipe *** is designed according to dijkstra's algorithm, and the scheme which cost least is chosen at this section, so it can get the optimization quickly.

关键词： Alignment topology dijkstra algorithm Weights

来源：评论

学校读者我要写书评

暂无评论

A NEW MINIMAL PATH SELECTION algorithm FOR AUTOMATIC CRACK DETECTION ON PAVEMENT IMAGES

A NEW MINIMAL PATH SELECTION ALGORITHM FOR AUTOMATIC CRACK D...

引用

IEEE International Conference on Image Processing

作者： Rabih Amhaz Sylvie Chambon Jerome Idier Vincent Baltazart L'UNAM Universite IFSTTAR - IRIT INP-ENSEEIHT IFSTTAR - IRIT L'UNAM Universite IRCCyN

This paper proposes a new algorithm for crack detection based on the selection of minimal paths. It takes account of both photometric and geometric characteristics and requires few information a priori. It is validate... 详细信息

ISBN: (纸本)9781479957521

关键词： Crack detection Minimal path dijkstra algorithm Non destructive control Pavement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：