A framework for delivering multicast messages in networks with mobile hosts

Acharya, Arup; Badrinath, B. R.

doi:10.1007/bf01193337

Cited by 103 publications

(50 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The three primary properties proven for the Chandy-Lamport distributed snapshot are: (1) there is no residual storage in the system at some point after the algorithm begins execution, (2) every message is recorded once, and (3) no message is recorded more than once. We translate these properties directly into the mobile environment stating that (1) eventually there is no residual storage in the system at some point after the delivery process begins, (2) the announcement is delivered to the intended recipient, and (3) the announcement is delivered only once.…”

Section: Propertiesmentioning

confidence: 99%

“…Another area of research in the mobility community is multicast, including some work on reliable multicast [1] but only under the assumption that the set of recipients is known. Our algorithm can trivially be extended to perform multicast to all mobile units in the system during the execution of the snapshot without knowing the list of recipients.…”

Section: Multiple Announcement Deliveriesmentioning

confidence: 99%

“…In snapshot delivery, we assume that the MSCs hold a copy of the announcement for delivery to the mobile units for a bounded period of time limited to the duration of the local snapshot. This is more efficient than another proposal [1] in which the announcement is broadcast to all nodes, each of which stores the announcement until notified that delivery has occurred. In our approach, the time for storage is bounded by the speed of network propagation and connectivity of the network.…”

Section: Reality Checkmentioning

confidence: 99%

See 2 more Smart Citations

Dependable Message Delivery to Mobile Units

Varghese¹,

Roman²,

Murphy³

2004

Mobile Computing Handbook

View full text Add to dashboard Cite

Mobile computing is emerging as a novel paradigm with its own characteristic problems, models, and algorithms. Much effort is being directed to integrate mobile units with fixed networks, providing bridges to connect wireless to wired. The result is a fixed core of wireconnected static nodes and a fluid fringe of wireless mobile units, a computing system similar to the cellular telephone network. The model we put forward uses the graph of fixed nodes as a foundation and models the mobile units themselves as persistent messages moving through this network graph. Such a model allows algorithms from traditional distributed computing to be directly implemented in the mobile environment, however, it has been shown that the unique properties of mobility, such as limited bandwidth and disconnection, make such direct translation impractical. This paper presents a fundamentally different idea. Instead of recreating the functionality of distributed algorithms in the mobile domain, we show how distributed algorithms can be adapted to solve problems unique to the mobile environment. Specifically we focus on the problem of dependably delivering a message to a moving unit. We demonstrate this technique with two new algorithms, the first based on distributed snapshots and the second on diffusing computations.

show abstract

Section: Propertiesmentioning

confidence: 99%

Section: Multiple Announcement Deliveriesmentioning

confidence: 99%

Section: Reality Checkmentioning

confidence: 99%

See 1 more Smart Citation

Dependable Message Delivery to Mobile Units

Varghese¹,

Roman²,

Murphy³

2004

Mobile Computing Handbook

View full text Add to dashboard Cite

show abstract

“…Furthermore, mobility introduces new issues at the algorithmic level. For example, a mobile host may miss messages simply because of its movements, even with perfectly reliable communication links and computers that never crash [1]. All the above reasons imply that specialized protocols are required for extending to mobile hosts functionalities common for stationary ones.…”

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Support for Reliable Multicast in Mobile Wireless Systems

Anastasi

Bartoli

Luccio

2002

NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. In this paper we present a protocol for reliable multicast within a group of mobile hosts that communicate with a wired infrastructure by means of wireless technology. The protocol tolerates failures in the wired infrastructure, i.e., crashes of stationary hosts and partitions of wired links. The wireless coverage may be incomplete and message losses could occur even within cells, due to physical obstructions or to the high error rate of the wireless technology, for example. Movements of mobile hosts are accommodated efficiently because they do not trigger any interaction among stationary hosts (i.e., there is no notion of handoff). We evaluate by simulation the impact of fault-tolerance on the performance of the protocol in normal operating conditions, i.e., in the absence of failures. The results obtained show that the increase in the average latency experienced by messages is limited to few milliseconds.

show abstract

“…Furthermore, mobility introduces new issues at the algorithmic level and in the design of communication and computing paradigms. For example, a mobile host may miss messages simply because of its movements, even with perfectly reliable communication links and computers that never crash [3]. All the above reasons imply that network protocols and distributed algorithms for a mobile computing environment cannot assume that a host maintains a fixed and universally known location in the network at all times.…”

mentioning

confidence: 99%

Communication and Computing Paradigm for Distributed Mobile Systems

Mohamed¹

2007

Int. Jour. Info. Sci. Comp.

View full text Add to dashboard Cite

The advancements in technology have enabled mobile devices to become information and service providers by complementing or replacing static hosts. This motivates the need for merging of mobile and grid technologies, leading to mobile grid paradigm. Computational mobile grid can also be viewed as a seamless integration of cluster of mobile clusters. Hence, as a first step in realizing a mobile grid, Anonymous Remote Mobile Cluster Computing (ARMCC) model is proposed. The main purpose of ARMCC is to utilize the idle computing power of both the static and mobile nodes, to provide parallel programming on a distributed mobile computing environment. The cluster model was extended to a mobile grid paradigm that integrates the computational, data and service grids. However, though the mobile grid is visualized as cluster of mobile clusters, the model of mobile cluster is not directly applicable to mobile grid. In addition to computational power other resources and services offered by the participating nodes are shared in case of mobile grid. Thus, all the participating mobile nodes in the mobile grid are represented using surrogate objects which reside on the static portion of the network. These surrogate objects are realized as a shared distributed object space. The constrained nature of the mobile devices participating in the mobile cluster requires an efficient communication primitive for exactly-once message delivery. Thus a novel communication paradigm, namely, Fault Tolerant Exactly Once Reliable Multicast Protocol (FTEORMP) for distributed mobile system is proposed. Key words: I. INTRODUCTIONHigh speed networks and the improved performance of processors in the recent years, has made network of workstations [1] an efficient paradigm for parallel and distributed computing. On the other hand, with rapid evolution of wireless communications, a huge number of communication devices and mobile devices have been developed. These devices provide high computing power and storage capabilities. At the same time, the cost for these high end mobile devices is decreasing and thus becoming affordable for everyone. Thus, computing is no longer restricted to desktop computers, and access to information, resources and data is made available anytime and anywhere [2]. This has led to a new era in computing, namely distributed mobile computing. It involves distributed mobile systems that are defined as a collection of processes where some processes are running on Mobile Hosts (MHs), in addition to some processes running on Static Hosts (SHs). These processes communicate with each other by exchanging messages. This paradigm provides the flexibility for the mobile users to roam around freely while maintaining connectivity with a wired computing infrastructure. Thus enabling mobile users to communicate/compute effortlessly, anywhere, anytime.This work specifically addresses problems arising out of integrating mobile devices into distributed systems. Applications with distributed systems are not suitable in distributed mobile sys...

show abstract

A framework for delivering multicast messages in networks with mobile hosts

Cited by 103 publications

References 18 publications

Dependable Message Delivery to Mobile Units

Dependable Message Delivery to Mobile Units

Fault-Tolerant Support for Reliable Multicast in Mobile Wireless Systems

Communication and Computing Paradigm for Distributed Mobile Systems

Contact Info

Product

Resources

About