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

Hyperbolic embedding of Internet graph for distance estimation and overlay construction

IEEE-ACM TRANSACTIONS ON NETWORKING 2008年第1期16卷 25-36页

作者： Shavitt, Yuval Tankel, Tomer Tel Aviv Univ Iby & Aladar Fleischman Fac Engn Sch Elect Engn Tel Aviv Israel

Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-to-peer realm. One scalable approach to estimate distances between nodes is to embed the nodes in some d dimensional geometric space and to use the pair distances in this space as the estimate for the real distances. Several algorithms were suggested in the past to do this in low dimensional Euclidean spaces. It was noted in recent years that the Internet structure has a highly connected core and long stretched tendrils, and that most of the routing paths between nodes in the tendrils pass through the core. Therefore, we suggest in this work, to embed the Internet distance metric in a hyperbolic space where routes are bent toward the center. We found that if the curvature, that defines the extend of the bending, is selected in the adequate range, the accuracy of Internet distance embedding can be improved. We demonstrate the strength of our hyperbolic embedding with two applications: selecting the closest server and building an application level multicast tree. For the latter, we present a distributed algorithm for building geometric multicast trees that achieve good trade-offs between delay (stretch) and load (stress). We also present a new efficient centralized embedding algorithm that enables the accurate embedding of short distances, something that have never been done before.

关键词： Geometry Internet Telecommunication Network Routing Hyperbolic Embedding Internet Graph Distance Estimation Overlay Construction Peer To Peer Realm D Dimensional Geometric Space Pair Distances Low Dimensional Euclidean Spaces Routing Paths Internet Distance Embedding Application Level multicast Tree Distributed Algorithm Geometric multicast Trees Centralized Embedding Algorithm Internet Peer To Peer Computing Economic Indicators Routing Extraterrestrial Measurements Web Server Distributed algorithms Delay Stress multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Heuristic algorithms for Lifetime-Aware Directional multicasting in Wireless Ad Hoc Networks

Performance Analysis of Heuristic Algorithms for Lifetime-Aw...

引用

22nd International Workshops on Advanced Information Networking and Applications

作者： Guo, Song Dong, Mianxiong Guo, Minyi Univ Aizu Sch Comp Sci & Engn Fukuyama Hiroshima 9658580 Japan

ISBN: (纸本)9781424442331

WANET (Wireless Ad-hoc Network) is expected to be deployed in a wide range of civil and military applications. The communicating nodes in these networks might be distributed randomly and are assumed to have packet-forwarding capability in order to communicate with each other over a shared and limited radio channel. Building such networks usually poses a significant technical challenge because energy supplied by batteries is likely, to be a scarce resource, and in some applications energy is entirely non-renewable. We consider the problem of maximizing the network lifetime for multicast communications in WANETs that use directional antennas. Recent research results have shown that it is NP problem. In order to provide a better understanding of the research challenges of the energy-aware multicast routing, this paper presents simulation based analysis to assess the performance of a group of state-of-the-art algorithms under various network configurations.

关键词： Performance analysis Heuristic algorithms multicast algorithms Mobile ad hoc networks Ad hoc networks Batteries multicast communication Directional antennas Routing Analytical models

来源：评论

学校读者我要写书评

暂无评论

Efficient Geocast utilizing Topology Information Database

Efficient Geocast utilizing Topology Information Database

引用

8th IEEE International Conference on Computer and Information Technology

作者： Kim, Songmin Jung, Younghwan Lee, Sangbin Lee, Eunsook An, Sunshin Korea Univ Dept Elect Engn Comp Network Lab Anam Dong 5Ga 1 Seoul South Korea

ISBN: (纸本)9780769532424

With the start of ubiquitous network era in the near future, LBS (Location Based Service) will continue to grow in importance, seeing that it connects physical world to logical networks. Geocast routing is the underlying technique for LBS. Therefore, this paper briefly evaluates already known geocast routing algorithms to analyze their strengths and weaknesses, and then proposes a new geocast algorithm assisted by Topology Information Database. It attempts to overcome the weaknesses as well as emphasize the strengths of well-known geocast routing protocols by suggesting a new approach.

关键词： Databases Floods multicast algorithms Routing protocols Disaster management Computer networks Telecommunication network topology Wireless sensor networks Remote monitoring Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Distributed End Host multicast algorithms for Irregular Overlay Mesh

Distributed End Host Multicast Algorithms for Irregular Over...

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Wanqing Tu Weijia Jia Department of Computer Science City University of Hong Kong Hong Kong China

This paper proposes a set of novel distributed algorithms on top of m-D irregular mesh overlay to achieve the short delay and low network resource consumption end host multicast services. Our end host multicast fully utilizes the advantages of m-D irregular mesh to construct a two-layer architecture. Compared to previous approaches, the novelty and contribution of our end host multicast include: 1. cluster formation that partitions the group members into different clusters in the lower layer; 2. cluster core selection that selects a core who has the minimum sum of overlay hops to all other cluster members for each cluster ; 3. weighted shortest path tree construction that constructs the shortest multicast trees with the minimum number of paths to propagate the multicast traffic; 4. distributed multicast routing directs the multicast messages to be efficiently distributed along the two-layer multicast architecture in parallel without a global control. Simulation results show that our end host multicast can distributively achieves the short delay and low network resource consumption multicast services as compared with some well-know end host multicast systems.

关键词： multicast algorithms Routing Mesh networks multicast protocols Peer to peer computing Computer science Robustness Scalability Floods Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Application of Improved Ant Colony Algorithm to the QoS multicast Routing

Application of Improved Ant Colony Algorithm to the QoS Mult...

引用

ETT and GRS International Education Technology and Training, and International Workshop on Geoscience and Remote Sensing

作者： Kewen Li Jing Tian College of Computer and Communication Engineering China University of Petroleum Dongying Shandong China School of Management Tianjin University TJU Tianjin China

For the search of the optimal path and the establishment of the multicast tree which meets QoS constraints in multicast routing, an improved ant colony algorithm is proposed in the paper. In the searching process, two group ants carry out searching separately and alternate information after one search to avoid stagnation. And the optimal one is selected from the two paths combining multi-constrained QoS. At the same time, in the choice of the next node, the probability of previous search on the path is introduced to speed up the search speed. Experiments show that the algorithm has a better performance than the other routing algorithm and establish the multicast tree quickly.

关键词： multicast algorithms Routing Ant colony optimization Delay Management training NP-complete problem Jitter Costs Computer science education Educational technology

来源：评论

学校读者我要写书评

暂无评论

On scheduling concurrent multicast sessions over resource reserved network

On scheduling concurrent multicast sessions over resource re...

引用

IEEE International Conference on Networks

作者： Xiaoyu Zhang Fan Wang Department of Electronics and Communication Engineering School of Business Sun Yat-sen University Guangzhou China Sun Yat-Sen University Guangzhou Guangdong CN

ISBN: (纸本)9781424438051

Resource reserved network can provide guaranteed quality of service to end users, especially those services requiring high bandwidth and short delay, such as video conferencing, video on demand, etc. In this paper, we consider the multicast packing problem, where multiple multicast sessions request network services simultaneously. To maximize the profit, network service provider need to carefully schedule these multicast sessions under the capacity constraint. We first formulate the problem as an integer programming problem and propose an optimization algorithm using branch-and-bound technique. A valid upper bound and a lower bound are then derived by using a statistical method and a greedy heuristic, respectively. The simulation results illustrate that our optimization algorithm performs effectively within the two boundaries.

关键词： Routing Video on demand multicast algorithms Videoconference Bandwidth Linear programming Cable TV Quality of service Cost function Delay

来源：评论

学校读者我要写书评

暂无评论

multicast Planning for Mission-Critical Networks

Multicast Planning for Mission-Critical Networks

引用

IEEE Princeton Section Sarnoff Symposium

作者： Selcuk Cevher M. Umit Uyar Mariusz A. Fecko John Sucec Sunil Samtani The City College Graduate Center of the City University New York NY USA Applied Research Area Telcordia Technologies Inc. Piscataway NJ USA

In this paper, considering user vicinity information, maximum tolerable unwanted traffic, and routing overhead, we introduce a new two-stage multicast group planning technique which has many applications in tactical networks (TN) used in the future battlefield networks (FBN). We formally define channelization problem with respect to no false exclusion and minimum false inclusion requirements . We address: (i) selection of the number of multicast groups, (ii) adaptation of the mapping algorithms to the networks with different characteristics, and (Hi) reduction of the computational complexity of the mapping algorithms. Our approach results in scalable group configurations based on the availability of resources in the network. Simulation results show that it is cost-effective and generates multicast groups of smaller sizes, which are easier to maintain especially in mobile ad hoc networks (MANETs), than other greedy approaches for the same amount of unwanted traffic per user.

关键词： Mission critical systems Information filtering Information filters Telecommunication traffic multicast algorithms Bandwidth Technology planning Computational complexity Mobile ad hoc networks Traffic control

来源：评论

学校读者我要写书评

暂无评论

Tabu Artificial Fish Swarm Algorithm Based Intelligent QoS multicast Routing Algorithm

Tabu Artificial Fish Swarm Algorithm Based Intelligent QoS M...

引用

International Conference on Computational Intelligence and Security

作者： Junwei Wang Xingwei Wang Min Huang Department of Automation Northeastern University Qinhuangdao Hebei China School of Information Science and Engineering Northeastern University Shenyang Liaoning China

ISBN: (纸本)9781424441969

In this paper, a QoS multicast routing scheme based on TS (Tabu Search) and AFS (artificial fish swarm) is presented. The corresponding model and its mathematical description are introduced. By combining fast searching ability of AFS and global optimization ability of TS, it tries to find the best multicast tree with the maximum probability of meeting multiple QoS constraints under the given cost and the inaccurate QoS information. Simulation results have shown that it is effective and efficient.

关键词： multicast algorithms Marine animals Artificial intelligence Particle swarm optimization Routing Bandwidth Delay Mathematical model Competitive intelligence Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

Novel Gossip-Based multicast Protocol with No Global View Information

Novel Gossip-Based Multicast Protocol with No Global View In...

引用

International Conference on Future Generation Communication and Networking (FGCN)

作者： Chayoung Kim Jinho Ahn Department of Computer Science Kyonggi University Suwon Gyeonggi South Korea

ISBN: (纸本)9781424440085

Application-level gossip-based broadcast protocols are gaining significant popularity as an interesting alternative to deterministic broadcast algorithms for reliable propagation by providing an attractive tradeoff between reliability and scalability. In addition, many distributed applications require scalable, reliable and causally ordered delivery of broadcast messages to a large number of processes. However, despite the importance of the ordering guarantees, there exist only a few works to consider this requirement. Most early versions of these protocols rely on the assumption that each process knows every other process, or use virtual synchrony probabilistically by composing the gossip-style dissemination based on partially randomized individual views and K-committee protocol with a deterministic reliability. This paper presents an efficient gossip-based multicast protocol to guarantee causally-ordered delivery semantics based on the local view of every individual member consisting of a subset of members continuously changing, whose size never excesses a determined threshold, without virtual synchrony and K-committee.

关键词： multicast protocols Broadcasting multicast algorithms Scalability Computer science Computer network reliability Telecommunication network reliability Application software Buildings Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

A Weighted Fuzzy Clustering Algorithm for multicast Routing Optimization

A Weighted Fuzzy Clustering Algorithm for Multicast Routing ...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Qi Bing Jun Lu Yan Long School of Electrical and Electronic Engineering North China Electric Power University Beijing China

To solve the topology cluster detection in the multicast routing optimization, this paper proposed a weighted fuzzy clustering algorithm for the mixed data set indicating two different routing metrics. The scheme first normalized the related routing metrics to comprise the feature vector, and then weighted the features in the fuzzy membership matrix corresponding to their related importance to the routing optimization for the better clustering performance. The experiments illustrated, compared with HCM, that the proposed scheme is effective in both the clustering performance and the routing performance with the different topology configuration.

关键词： Clustering algorithms multicast algorithms Routing Tree graphs Fuzzy systems Topology Unicast Fuzzy sets Bandwidth Delay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：