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

9th Annual International Conference on Combinatorial Optimization and Applications (COCOA)

作者： Erickson, Alejandro Kiasari, Abbas Eslami Navaridas, Javier Stewart, Iain A. Univ Durham Sci Labs Sch Engn & Comp Sci South Rd Durham DH1 3LE England Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England

ISBN: (纸本)9783319266268;9783319266251

DPillar has recently been proposed as a server-centric data centre network and is combinatorially related to the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving a symmetry property of DPillar. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k log(n)), where k parameterizes the dimension of DPillar and n the number of ports in its switches. Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. A secondary and important effect of our work is that it emphasises that data centre networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance.

关键词： Data centre networks routing algorithms Shortest paths

来源：评论

学校读者我要写书评

暂无评论

An integrated routing and offset-time adaptation scheme for OBS network 15

An integrated routing and offset-time adaptation scheme for ...

引用

16th International Conference on Distributed Computing and Networking

作者： Choudhury, S. Nair, V. Howlader, J. Choudhury, B. Mal, A. K. Natl Inst Technol Durgapur Dept Informat Technol Durgapur W Bengal India

ISBN: (纸本)9781450329286

Optical burst switching (OBS) is considered as one of the most potential technology for implementation of transparent optical Internet in near future. In this paper we propose an integrated scheme for loss reduction and efficient resource utilization in OBS. We develop a framework for computation of estimated space-time loss surface in space-time plane for a burst over the network and utilise it to determine the most appropriate route and corresponding offset-time for the burst. The integrated routing and offset-time adaptation scheme proposed here, can simultaneously offer significantly lower burst loss rate and higher network-wide resource utilisation.

关键词： burst-switch scheduling routing algorithms

来源：评论

学校读者我要写书评

暂无评论

3D Elastic Optical Networking in the Temporal, Spectral, and Spatial Domains

引用

IEEE COMMUNICATIONS MAGAZINE 2015年第2期53卷 79-87页

作者： Proietti, Roberto Liu, Lei Scott, Ryan P. Guan, Binbin Qin, Chuan Su, Tiehui Giannone, Francesco Yoo, S. J. B. Univ Calif Davis Davis CA 95616 USA Altran Italia SpA Turin Italy

Conventional elastic optical networking, EON, uses elasticity in two domains, time and frequency, to optimize utilization of optical network resources in the presence of fluctuating traffic demand and link quality. Currently, networking exploiting a third domain, space, is the focus of significant research efforts since space-division multiplexing, SDM, has the potential to substantially improve future network capacity and spectral efficiency. This article extends 2D-EON to include elasticity in all three domains: time, frequency, and space. We introduce enabling technologies, architectures, and algorithms for 3D-EONs. Based on sample network topologies, we investigate algorithms for routing, spectrum, spatial mode, and modulation format assignment - RSSMA. In particular, we investigate fragmentation-aware RSSMA and how the constraints in the formation of super-channels in MIMO-based SDM systems can impact the network performance in terms of blocking probability.

关键词： OPTICAL communications -- Research MULTIPLEXING (Telecommunication) -- Research routing algorithms RESEARCH ELECTRIC network topology algorithms -- Research

来源：评论

学校读者我要写书评

暂无评论

routing Algorithm to Optimize Loss and IPDR for Rearrangeably Non-Blocking Integrated Optical Switches

Routing Algorithm to Optimize Loss and IPDR for Rearrangeabl...

引用

Conference on Lasers and Electro-Optics (CLEO)

作者： Ding, M. Cheng, Q. Wonfor, A. Penty, R. V. White, I. H. Univ Cambridge Ctr Photon Syst 9 JJ Thomson Ave Cambridge CB3 0FA England

A practical path-selection algorithm is proposed to optimize the worst-case path loss and IPDR for large-scale integrated switches. The modeling of an 8x8 Clos-tree switch shows an improvement of up to 2.7dB/1.9dB in ... 详细信息

ISBN: (纸本)9781557529688

关键词： algorithms Amplified spontaneous emission Optical amplification Optical signal to noise ratio Optical signals routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Spectrum Continuity based routing Algorithm for Flexible Grid Optical Networks

Spectrum Continuity based Routing Algorithm for Flexible Gri...

引用

Microwave and Optoelectronics Conference (IMOC), 2015 SBMO/IEEE MTT-S International

作者： Xavier, A. V. S. Almeida, R. C., Jr. Chaves, D. A. R. Bastos-Filho, C. J. A. Martins-Filho, J. E. Univ Fed Pernambuco Dept Elect & Syst BR-50740550 Recife PE Brazil Univ Pernambuco Polytech Sch Pernambuco BR-50720001 Recife PE Brazil

ISBN: (纸本)9781467394925

Spectrum-sliced elastic optical path networks (SLICE) can maximize spectral resource utilization by using a fine granular spectrum range unit, called frequency slot, and allowing that multiple slots be assigned to lightpaths. The routing and Spectrum Assignment (RSA) algorithm has a direct influence on the spectral resource utilization. We propose in this paper a novel routing algorithm, referred to as Spectrum Continuity based Shortest Path (SCSP). The SCSP finds a route with the lowest cost based on information of the link length and spectrum continuity. In all simulations, some effects of physical layer are considering as ASE noise, optical amplifier gain and ASE saturation in the amplifiers. The modulation formats are selected during the RSA process to optimize the spectrum resource utilization. We compared the performance of our proposal through simulation with the Shortest Path (SP) and Minimum Hop (MH) routing algorithms for three different network topologies.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on wireless meter reading system based on ultra-low power wireless routing algorithm

Research on wireless meter reading system based on ultra-low...

引用

International Conference on Frontier of Energy and Environment Engineering, ICFEEE 2014

作者： Liu, Xun Chengdu Qianjia Technology Co. Ltd Institute of Technology Chengdu China

ISBN: (纸本)9781138026919

In the paper, the important role of automatic meter reading system in the gas industry was simply introduced. Then, an automatic meter reading system based on ultra-low power wireless routing algorithm was introduced, and the composition of the meter reading was described. The functions of the various components of the system were described, and a detailed description of the system’s routing algorithm including routing process algorithm, route discovery and route repair algorithm was given. In the end, the meter reading rate of more than 93% of the system achieves the desired goal. © 2015 Taylor & Francis Group, London.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

QoS-Aware Inter-Domain Multicast for Scalable Wireless Community Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2015年第11期26卷 3136-3148页

作者： Al-Dubai, Ahmed Y. Zhao, Liang Zomaya, Albert Y. Min, Geyong Edinburgh Napier Univ Sch Comp Edinburgh Midlothian Scotland Shenyang Aerosp Univ Coll Comp Sci Shenyang Peoples R China Univ Sydney Sch Informat Technol Sydney NSW 2006 Australia Univ Exeter Dept Math & Comp Sci Exeter Devon England

Wireless community networks (WCNs) have emerged as a cost-effective ubiquitous broadband connectivity solution, offering a wide range of services in a given geographical area. QoS-aware multicast over WCNs is among the most challenging issues and has attracted a lot of attention in recent times. The existing multicast schemes in WCNs suffer in terms of several key performance metrics, such as, latency, jitter and throughput, particularly in large-scale networks. Consequently, these schemes cannot accommodate the desired performance levels, especially when dealing with high-bandwidth applications that require efficient gateway-based management. To fill in this gap, a new strategy for supporting QoS-aware multicast in large-scale WCNs is proposed in this paper. Specifically, a new Gateway based Multi-hop routing algorithm (GMR) is firstly proposed to enhance the routing management capability of the network. Built upon GMR, a new Multicast Gateway Multi-hop routing algorithm (MGMR) is devised to cope with high-bandwidth applications in WCNs. The MGMR is the first of its kind that considers both the capability of gateway-based management and the requirements of high-bandwidth applications. Extensive simulation experiments and performance results demonstrate the superiority of both GMR and MGMR when compared to other methods under various operating conditions.

关键词： Wireless community networks multicast routing algorithms QoS provisioning

来源：评论

学校读者我要写书评

暂无评论

A randomized path routing algorithm for decentralized Route allocation in transportation networks 8

A randomized path routing algorithm for decentralized Route ...

引用

8th ACM SIGSPATIAL International Workshop on Computational Transportation Science, IWCTS 2015

作者： Nguyen, Uyen T.V. Karunasekera, Shanika Kulik, Lars Tanin, Egemen Zhang, Rui Zhang, Haolan Xie, Hairuo Ramamohanarao, Kotagiri Dept. of Computing and Information Systems University of Melbourne Australia Ningbo Institute of Technology Zhejiang University China

ISBN: (纸本)9781450339797

Route planning in current route guidance systems is pri- marily based on the shortest path strategy (e.g., suggesting a path that minimizes the travel distance between source and destination) for an individual driver. A drawback of such an approach is that there is a high probability that many drivers, who share the same source and destination, follow the same route. This can lead to over-saturated road links. We propose a simple yet effective multiple path rout- ing algorithm that addresses this limitation. The proposed algorithm augments the A search algorithm with a ran- domization component, which helps to perturb the order of the searched nodes and to produce diversified routes for dif- ferent drivers with the same source and destination. Our algorithm enables decentralized route allocations, i.e., each vehicle computes its own route without a central server. We validate the performance of the proposed algorithm through microscopic traffic simulation. Experiments for various trafffic scenarios show that our algorithm achieves a good path diversification while reducing the average travel time com- pared to the traditional shortest path algorithm. © 2015 ACM.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

The Actual Maximum Throughput of Mobile Ad Hoc Networks with Reed-Solomon Coding

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-9页

作者： Fan, Yuanyuan Yang, Bin Yu, Xiaomei Chuzhou Univ Sch Math & Finance Chuzhou 239000 Peoples R China Chuzhou Univ Sch Comp & Informat Engn Chuzhou 239000 Peoples R China

Maximum throughput serves as a fundamental metric for evaluating the performance of mobile ad hoc networks. However, the actual maximum throughput still remains significantly unknown in such networks. This paper studies the actual maximum throughput of mobile ad hoc networks under a general routing scheme with reed-solomon coding, where a source node first encodes a group of g packets into w (w >= g) code blocks, and then these code blocks are transmitted to distinct relay nodes, which forward them to destination node. The original g packets can be decoded once the destination node receives any g code blocks. To explore the actual maximum throughput, we first establish two Markov chain models to capture the fastest packet sending and receiving processes at source and destination nodes under the considered routing scheme. Based on the Markov chain models, we then derive a closed-form expression for the maximum throughput in such networks. Finally, extensive simulations and theoretical results are presented to validate the accuracy of our theoretical maximum throughput analysis in mobile ad hoc networks and to illustrate how network parameters influence the maximum throughput performance.

关键词： AD hoc networks (Computer networks) REED-Solomon codes CODING theory routing algorithms MARKOV processes

来源：评论

学校读者我要写书评

暂无评论

A Data Forwarding Scheme with Reachable Probability Centrality in DTNs

A Data Forwarding Scheme with Reachable Probability Centrali...

引用

IEEE Wireless Communications and Networking Conference

作者： Jiagao Wu Jianming Wang Linfeng Liu Maryam Tanha Jianping Pan School of Computer Nanjing University of Posts and Telecommunications Department of Computer Science University of Victoria

ISBN: (纸本)9781467398152

Node mobility and end-to-end disconnections in Delay Tolerant Networks (DTNs) greatly weaken the effectiveness of data transmission. Although social-based strategies can be used to deal with the problem, most existing approaches adopt multi-copy strategy to forward messages which inevitably add more unnecessary cost. One of the most important issues is the selection of the best intermediate node to forward messages to the destination node. In this paper, we focus on finding a quality metric associated with better relays which is evaluated by Reachable Probability Centrality (RPC) as we proposed. RPC combines the contact matrix and multi-hop forwarding probability based on the weighted social network, thus ensuring an effective relay selection. We also propose a distributed RPC-based routing algorithm, which demonstrates the applicability of our scheme in the decentralized environment of DTNs. Extensive trace-driven simulations show that RPC outperforms other centrality measures and our proposed routing algorithm can significantly reduce the data forwarding cost while having comparable delivery ratio and delay to those of the Epidemic routing.

关键词： RTCA gene remote procedure calls data forwarding Messages routing algorithms DTNA gene data transmission relay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：