Arrow Research search

Author name cluster

H. Attiya

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

I&C Journal 1995 Journal Article

Connection Management Without Retaining Information

  • H. Attiya
  • S. Dolev
  • J.L. Welch

Managing a connection between two hosts in a network is an important service to provide in order to make the network useful for many applications. The two main subproblems are the management of serial incarnations of a connection and the transfer of messages within an incarnation, This paper investigates whether it is necessary for connection management protocols to retain state information across node crashes and between incarnations. The following results were obtained: • When information is not retained across node crashes, incarnation management is not possible at all. • When information is not retained between incarnations, incarnation management is possible if the network is FIFO and not possible if the network is non-FIFO. • When information is not retained across node crashes, message transfer can be accomplished in networks that lose packets if the network is FIFO the protocol is allowed a variable length grace period after a crash during which it need not deliver messages. However, message transfer cannot be accomplished if the network is non-FIFO or the grace period allowed is fixed. • When information is not retained across node crashes, message transfer can he accomplished in networks that do not lose packets if the network is FIFO the protocol need not be FIFO, Message transfer is not possible when the network is non-FIFO and the protocol must be FIFO. • If the network has bounded capacity, then message transfer is possible without using stable storage. This indicates, somewhat surprisingly, that there is a data link initialization protocol that can withstand node crashes without stable storage.

I&C Journal 1994 Journal Article

Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty

  • H. Attiya
  • N.A. Lynch

A timing-based variant of the mutual exclusion problem is considered. In this variant, only an upper bound, m, on the time it takes to release the resource is known, and no explicit signal is sent when the resource is released; furthermore, the only mechanism to measure real time is an inaccurate clock, whose tick intervals take time between two constants, c 1 ≤ c 2. When control is centralized it is proved that n[c2(⌊(m+l)/c1⌋+1)]+l is an exact bound on the worst case response time for any such algorithm, where n is the number of contenders for the resource and l is an upper bound on process step time. On the other hand, when control is distributed among processes connected via communication lines with an upper bound, d, for message delivery time, it is proved that n[c2(⌊(m+l)/c1⌋+1)+d+c2+2l] is an upper bound. A new technique involving shifting and shrinking executions is combined with a careful analysis of the best allocation policy to prove a corresponding lower bound of n·c2(m/c1)+(n−1)d. These combinatorial results shed some light on modeling and verification issues related to real-time systems.

v2026.09.13