A fast O(k) multicast message routing algorithm

2002 ◽  
Author(s):  
T.J. Sager ◽  
B.M. McMillin
Keyword(s):  
Routing Algorithm ◽  
Message Routing

An optimal message routing algorithm for circulant networks

2006 ◽  
Vol 52 (5) ◽  
pp. 298-306 ◽  
Author(s):  
Tomaž Dobravec ◽  
Janez Žerovnik ◽  
Borut Robič
Keyword(s):  
Routing Algorithm ◽  
Message Routing ◽  
Circulant Networks

scholarly journals Improving Topic-Based Data Exchanges among IoT Devices

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Fu Chen ◽  
Peng Liu ◽  
Jianming Zhu ◽  
Sheng Gao ◽  
Yanmei Zhang ◽  
...  
Keyword(s):  
Network Topology ◽  
Data Exchange ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Network Environment ◽  
Message Routing ◽  
Heterogeneous Devices ◽  
Proposed Model ◽  
To Come ◽  
Iot Devices

Data exchange is one of the huge challenges in Internet of Things (IoT) with billions of heterogeneous devices already connected and many more to come in the future. Improving data transfer efficiency, scalability, and survivability in the fragile network environment and constrained resources in IoT systems is always a fundamental issues. In this paper, we present a novel message routing algorithm that optimizes IoT data transfers in a resource constrained and fragile network environment in publish-subscribe model. The proposed algorithm can adapt the dynamical network topology of continuously changing IoT devices with the rerouting method. We also present a rerouting algorithm in Message Queuing Telemetry Transport (MQTT) to take over the topic-based session flows with a controller when a broker crashed down. Data can still be communicated by another broker with rerouting mechanism. Higher availability in IoT can be achieved with our proposed model. Through demonstrated efficiency of our algorithms about message routing and dynamically adapting the continually changing device and network topology, IoT systems can gain scalability and survivability. We have evaluated our algorithms with open source Eclipse Mosquitto. With the extensive experiments and simulations performed in Mosquitto, the results show that our algorithms perform optimally. The proposed algorithms can be widely used in IoT systems with publish-subscribe model. Furthermore, the algorithms can also be adopted in other protocols such as Constrained Application Protocol (CoAP).

PERFORMANCE EVALUATION OF MULTICAST WORMHOLE ROUTING IN 2D-TORUS MULTICOMPUTERS

1992 ◽  
Vol 02 (02n03) ◽  
pp. 161-170
Author(s):  
C. S. YANG ◽  
Y. M. TSAI ◽  
C. Y. LIU
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Wormhole Routing ◽  
Multicast Communication ◽  
Message Routing ◽  
Routing Scheme ◽  
Communication Traffic ◽  
Multicast Routing Algorithm ◽  
New Generation ◽  
2D Torus

Most recently, multicast communication has been included in multicomputer systems. Multicast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. The performance of multicomputers is highly dependent on the message routing scheme and the communication mechanism. Wormhole routing is the most promising switching technique used in the new generation multicomputers. In this paper, we propose a multicast wormhole routing algorithm for 2D-torus multicomputers. The multicast routing algorithm is based on a path-like routing scheme and offers deadlock-free routing. Our simulation which compared the 2D-mesh multicomputers shows that the multipath routing algorithm for 2D-torus multicomputers can reduce the communication traffic and the maximum distance in multicast communication.

scholarly journals SocialRouting: The social-based routing algorithm for Delay Tolerant Networks

2016 ◽  
Vol 62 (2) ◽  
pp. 167-172 ◽  
Author(s):  
Radosław O. Schoeneich ◽  
Rafał Surgiewicz
Keyword(s):  
Routing Algorithm ◽  
Dynamic Networks ◽  
The Novel ◽  
Mobile Nodes ◽  
Message Routing ◽  
Simulation Tools ◽  
Knowledge Based ◽  
The Social ◽  
Wide Range ◽  
Delay Tolerant

Abstract Delay and Disruptive Tolerant Networks (DTN) are relatively a new networking concept that could provide a robust communication in wide range of implementations from the space to battlefield or other military usage. However in such dynamic networks, which could be considered as a set of intermittently connected nodes, message forwarding strategy is a key issue. Existing routing solutions concentrate mainly on two major routing families flooding and knowledge based algorithms. This paper presents SocialRouting - the social-based routing algorithm designed for DTN. The use of the social properties of wireless mobile nodes is the novel way of message routing that is based on message ferrying between separated parts of the network. Proposed idea has been extensively tested using simulation tools. The simulations were made based on especially designed for measurements in DTN scenarios and compared with popular solutions.

Sign in / Sign up

Export Citation Format

Share Document