Near-optimal message routing and broadcasting in faulty hypercubes

Electronic Mail Systems (EMSs) have been a boon to organizational productivity, but these systems may not receive greater acceptance due in part to their general lack of robust system features. Particularly, the intractable problem of effective electronic mail dissemination management has largely eluded solution. This paper first provides a brief survey of several existing intelligent EMSs which seek to address the conundrum of mail management and then proposes an alternative solution which takes advantage of the unique characteristics of a knowledge base/database coupling to facilitate effective information sharing among members of an organization. This approach improves on prior Knowledge-Based Mail System (KMS) designs by (1) focusing on message dissemination management rather than on message receipt management, (2) separating the relatively static knowledge of message routing from the relatively dynamic knowledge of the organizational membership, and (3) incorporating a more comprehensive view of the semantic constraints involved in configuring distribution lists of message receivers through the use of the Structured Object Model (SOM) Methodology. The design concepts are illustrated by a prototype KMS, the Message Dissemination System (MDS).

Download Full-text

Underlay-Aware Distributed Service Discovery Architecture with Intelligent Message Routing

Distributed Networks ◽

10.1201/b15282-3 ◽

2017 ◽

pp. 67-89 ◽

Cited By ~ 1

Author(s):

Haja M. Saleem ◽

Seyed M. Buhari ◽

Mohammad Fadzil Hassan ◽

Vijanth S. Asirvadam

Keyword(s):

Service Discovery ◽

Message Routing ◽

Distributed Service

Download Full-text

Secure message routing in structured peer-to-peer networks

10.32920/ryerson.14665623.v1 ◽

2021 ◽

Author(s):

Abdolkarim Hajfarajollah Dabbagh

Keyword(s):

Public Key Cryptography ◽

Peer To Peer ◽

Public Key ◽

Message Delivery ◽

Delivery Time ◽

P2p Networks ◽

Security Measures ◽

Message Routing ◽

Security Issues ◽

Identity Based

"Due to the lack of a centralized server in “Peer-to-Peer” (P2P) networks, users are responsible for the security of these networks. One of the security issues in P2P networks is the security of the message routing. Messages could be altered or modified by attackers while being routed. The conventional security method to avoid this has been “Public Key Cryptography” (PKC). To avoid the certificate management issue in PKC, “Identity-based Encryption” (IBE) has been suggested in which any arbitrary string could be used as a public key. Since IBE is a computationally expensive method, current proposed IBE-based methods are not effective in the message routing phase in P2P networks and highly affect the performance of message delivery time in these networks. This thesis proposes two IBE-based protocols that can be applied effectively to the message routing phase of structured P2P networks, yet provide a satisfactory message delivery time performance. Both protocols benefit from Identity-based key exchange scheme and, therefore, none of them impose any extra communication on the network to secure message routing. Protocol 1 significantly improves the performance of message delivery time compared to the current IBE-based proposed methods. Protocol 2, which requires nodes to store data, has a performance similar to the situations in which no security measures are applied for message routing."

Download Full-text