Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Filters








743 Hits in 4.0 sec

Multi-shared-trees based multicast routing control protocol using anycast selection

Weijia Jia, Wanqing Tu, Wei Zhao, Gaochao Xu
2005 International Journal of Parallel, Emergent and Distributed Systems  
A novel internet multicast routing protocol is presented to possess efficiency and effectiveness for multicast packet routing with short delay, high throughput, resource utilization and scalability for  ...  The protocol has two features: (1) Multiple Shared-Trees (MST) are configured to provide efficient, dynamic and quality multicast routing; (2) Anycasting approach is applied by forming the tree roots into  ...  However, implementing an efficient multicast routing in the Internet is a challenging task and the following issues must be tackled: .  ... 
doi:10.1080/17445760500033317 fatcat:7vep4dzacvegtlpkjcukpkreba

Integrated routing protocol for multicast and anycast messages

Weijia Jia, Gaochao Xu, Wei Zhao
2001 International Conference on Parallel Processing, 2001.  
The contributions of the protocol differ from well-known shared-tree systems in two aspects: (1) Off-tree anycast configuration and routing: multicast sources use anycast routing to select a better path  ...  A novel eficient and dynamic integrated routing protocol for multicast and anycast messages is presented.  ...  The routing algorithm takes advantage of anycast routing for path selection, which can do dynamic multiple path selection [lo, 171.  ... 
doi:10.1109/icpp.2001.952104 dblp:conf/icpp/JiaXZ01 fatcat:gmrzwebl5zgjzp7nucep3nwfzu

Efficient algorithm for mobile multicast using anycast group

W. Jia, W. Zhou, J. Kaiser
2001 IEE Proceedings - Communications  
Mobile hosts use anycast tunnelling to connect to the nearest available homeiforeign agent where an agent is able to forward the multicast messages by selecting an anycast route to a multicast router so  ...  The authors present a novel and efficient multicast algorithm that aims to reduce delay and communication cost for the registration between mobile nodes and mobility agents and solicitation for foreign  ...  Using anycast can dynamically select the paths to the multicast router to reduce the end-to-end multicast delay.  ... 
doi:10.1049/ip-com:20010211 fatcat:mtal7q7nvngxne3kjzpdcq7mru

A-DSR: A DSR-based anycast protocol for IPv6 flow in mobile ad hoc networks

Jianxin Wang, Yuan Zheng, Cheng Leung, Weijia Jia
2003 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484)  
DSR is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes.  ...  We also test its performance with different network parameters and the simulation results show that the anycast protocol can balance the network load efficiently and reduce the delay of packet and improve  ...  The destination nodes are identified by a multicast group, and we use a multicast address to identify the multicast group.  ... 
doi:10.1109/vetecf.2003.1286193 fatcat:cdleqbs67nez3pzkhel2qszxau

TMA: Trajectory-based Multi-Anycast forwarding for efficient multicast data delivery in vehicular networks

Jaehoon (Paul) Jeong, Tian He, David H.C. Du
2013 Computer Networks  
This paper describes Trajectory-based Multi-Anycast forwarding (TMA), tailored and optimized for the efficient multicast data delivery in vehicular networks in terms of transmission cost.  ...  We have formulated the multicast data delivery as the data delivery to the anycast sets of the multicast group vehicles.  ...  This multicast routing forms a multicast tree by using a reactive route discovery for the multicast group vehicles.  ... 
doi:10.1016/j.comnet.2013.05.002 fatcat:64qeht2rdbd3jp5zwtk7ilaqia

A scalable overlay framework for internet anycasting service

Chi-Jen Wu, Ren-Hung Hwang, Jan-Ming Ho
2007 Proceedings of the 2007 ACM symposium on Applied computing - SAC '07  
This study presents IAS, a scalable and efficient global overlay routing framework for Internet Anycasting Service.  ...  We introduce a new routing group concept and adopt the overlay network mechanism to achieve scalable and efficient interdomain anycast routing.  ...  Routing overhead In the second experiment, we evaluated the efficiency of the IAS routing path by comparing it against the optimal path, where the term 'optimal path' refers to the shortest path to the  ... 
doi:10.1145/1244002.1244054 dblp:conf/sac/WuHH07 fatcat:w24oe2ao3nfujnwtdcsjouoyu4

Anycast in Locality-Aware Peer-to-Peer Overlay Networks [chapter]

Rongmei Zhang, Y. Charlie Hu
2003 Lecture Notes in Computer Science  
The locality-awareness of the p2p routing substrates can be extended to support anycast and anycast is achieved as the result of the enhanced locality-aware routing.  ...  We also evaluate the performance of anycast using a realistic failure trace and the results show that our implementation of anycast is resilient to node failures.  ...  IP-anycast has also been proposed to improve IP multicast routing efficiency [23, 24] .  ... 
doi:10.1007/978-3-540-39405-1_4 fatcat:caokyoedencgfbgn4ova3wykwq

Arpeggio: Metadata Searching and Content Sharing with Chord [chapter]

Austin T. Clements, Dan R. K. Ports, David R. Karger
2005 Lecture Notes in Computer Science  
The implementation can handle group sizes varying from one to the whole Internet, and membership maintenance is efficient enough to allow members to join for the purpose of receiving a single message.  ...  Key to this efficiency is the use of a proximity-aware peer-to-peer overlay network for decentralized, lightweight group maintenance; nodes join the overlay once and can join and leave many groups many  ...  Conclusions This paper presents an efficient anycast implementation that supports large and highly dynamic groups.  ... 
doi:10.1007/11558989_6 fatcat:75cuumsyrbd3vg2prkie3ofcai

Scalable Application-Level Anycast for Highly Dynamic Groups [chapter]

Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Antony Rowstron
2003 Lecture Notes in Computer Science  
The implementation can handle group sizes varying from one to the whole Internet, and membership maintenance is efficient enough to allow members to join for the purpose of receiving a single message.  ...  Key to this efficiency is the use of a proximity-aware peer-to-peer overlay network for decentralized, lightweight group maintenance; nodes join the overlay once and can join and leave many groups many  ...  Conclusions This paper presents an efficient anycast implementation that supports large and highly dynamic groups.  ... 
doi:10.1007/978-3-540-39405-1_5 fatcat:6oaic5slbbhqrcceirxfoampom

Design and implementation of routing protocols for IPv6 global anycast communications

Satoshi Doi, Shingo Ata, Hiroshi Kitamura, Masayuki Murata
2006 International Journal of Internet Protocol Technology  
Based on our findings, we propose two routing protocols for inter-segment anycast to support anycast-oriented communication.  ...  However, because there are no protocol standards or even consensus on routing protocols, inter-segment anycast communications are not yet available.  ...  The Internet Protocol version 6 (IPv6) has three types of IP addresses, i.e., unicast and multicast addresses as in IPv4, and an anycast address that is the subject of the current paper.  ... 
doi:10.1504/ijipt.2006.009743 fatcat:4qiiuewiwngrpj33g54lsnx4nm

A column generation technique for routing and spectrum allocation in cloud–ready survivable elastic optical networks

Róża Goścień, Krzysztof Walkowiak
2017 International Journal of Applied Mathematics and Computer Science  
One of them is routing and spectrum allocation (RSA) of three types of network flows (unicast, anycast, multicast) in elastic optical networks (EONs) implementing dedicated path protection (DPP).  ...  Then, relying on extensive simulations, we compare algorithm performance with reference methods and evaluate CG efficiency in detail.  ...  For unicast and anycast (after DC selection) demands, a structure corresponds to a routing path which connects communicating nodes.  ... 
doi:10.1515/amcs-2017-0042 fatcat:f6mljhwka5hjtbuxqvsvlqvb4u

A Survey of Opportunistic Networks

Chung-Ming Huang, Kun-chan Lan, Chang-Zhou Tsai
2008 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)  
In such a network, there does not exist a complete path from source to destination for most of the time. In addition, the path can be highly unstable and may change or break quickly.  ...  Each message can be routed independently for increased efficiency and robustness.  ...  In [32] , the authors developed several multicast routing algorithms as follows. 1. UBR (Unicast-Based Routing) uses unicast transfer to achieve the multicast service. 2.  ... 
doi:10.1109/waina.2008.292 dblp:conf/aina/HuangLT08 fatcat:ak5jdrvz25heffslnaa6a57nde

Internet indirection infrastructure

Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana
2002 Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '02  
Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers  ...  This level of indirection decouples the act of sending from the act of receiving, and allows 3 to efficiently support a wide variety of fundamental communication services.  ...  Keshav, and the anonymous reviewers for their useful comments that helped improve the paper.  ... 
doi:10.1145/633030.633033 fatcat:lj65eluma5bx7mpmm6neis2dyy

Internet indirection infrastructure

Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana
2002 Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '02  
Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers  ...  This level of indirection decouples the act of sending from the act of receiving, and allows 3 to efficiently support a wide variety of fundamental communication services.  ...  Keshav, and the anonymous reviewers for their useful comments that helped improve the paper.  ... 
doi:10.1145/633025.633033 dblp:conf/sigcomm/StoicaAZSS02 fatcat:d4xrxc2ns5crdivsrs5marmmrm

Internet Indirection Infrastructure [chapter]

Ion Stoica, Daniel Adkins, Sylvia Ratnasamy, Scott Shenker, Sonesh Surana, Shelley Zhuang
2002 Lecture Notes in Computer Science  
Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers  ...  This level of indirection decouples the act of sending from the act of receiving, and allows 3 to efficiently support a wide variety of fundamental communication services.  ...  Keshav, and the anonymous reviewers for their useful comments that helped improve the paper.  ... 
doi:10.1007/3-540-45748-8_18 fatcat:p55wn7czxjb25nnop7gdamf4we
« Previous Showing results 1 — 15 out of 743 results