Ted Herman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ted Herman has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Shlomi Dolev
Ben-Gurion University of the Negev
3 shared publications - Toshimitsu Masuzawa
Nara Institute of Science and Technology, Ikoma, Japan 630-0101
2 shared publications - Arobinda Gupta
Indian Institute of Technology
1 shared publication - Colette Johnen
Université de Bordeaux
1 shared publication I. Pirwani
Dept. of Comput. Sci., Iowa Univ., Iowa City, IA
1 shared publication- James H. Anderson
University of North Carolina at Chapel Hill, Chapel Hill, USA
1 shared publication
Latest Publications
- Open Access
Local Read-Write Operations in Sensor Networks
Designing protocols and formulating convenient programming units of abstraction for sensor networks is challenging due to communication errors and platform constraints. This paper investigates properties and implementation reliability for a \emph{local read-write} abstraction. Local read-write is inspired by the class of read-modify-write operations defined for shared-memory multiprocessor architectures. The class of read-modify-write operations is important in solving consensus and related synchronization problems for concurrency control. Local read-write is shown to be an atomic abstraction for synchronizing neighborhood states in sensor networks. The paper compares local read-write to similar lightweight operations in wireless sensor networks, such as read-all, write-all, and a transaction-based abstraction: for some optimistic scenarios, local read-write is a more efficient neighborhood operation. A partial implementation is described, which shows that three outcomes characterize operation response: success, failure, and cancel. A failure response indicates possible inconsistency for the operation result, which is the result of a timeout event at the operation's initiator. The paper presents experimental results on operation performance with different timeout values and situations of no contention, with some tests also on various neighborhood sizes.
Open AccessLocal Read-Write Operations in Sensor Networks
Designing protocols and formulating convenient programming units of abstraction for sensor networks is challenging due to communication errors and platform constraints. This paper investigates properties and implementation reliability for a \emph{local read-write} abstraction. Local read-write is inspired by the class of read-modify-write operations defined for shared-memory multiprocessor architectures. The class of read-modify-write operations is important in solving consensus and related synchronization problems for concurrency control. Local read-write is shown to be an atomic abstraction for synchronizing neighborhood states in sensor networks. The paper compares local read-write to similar lightweight operations in wireless sensor networks, such as read-all, write-all, and a transaction-based abstraction: for some optimistic scenarios, local read-write is a more efficient neighborhood operation. A partial implementation is described, which shows that three outcomes characterize operation response: success, failure, and cancel. A failure response indicates possible inconsistency for the operation result, which is the result of a timeout event at the operation's initiator. The paper presents experimental results on operation performance with different timeout values and situations of no contention, with some tests also on various neighborhood sizes.
- 2 June 2007
- Published by Springer Nature in Distributed Computing
- Vol. 20 (1) , 53-73
Fault-containing self-stabilizing distributed protocols
- 2 June 2007
- Published by Springer Nature in Distributed Computing
- Vol. 20 (1) , 53-73
Fault-containing self-stabilizing distributed protocols
- 30 May 2007
- Published by Springer Nature in Distributed Computing
- Vol. 20 (1) , 29-38
Parallel composition for time-to-fault adaptive stabilization
- 30 May 2007
- Published by Springer Nature in Distributed Computing
- Vol. 20 (1) , 29-38
Parallel composition for time-to-fault adaptive stabilization
- 1 October 2006
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 3 (10) , 486
Introduction: Self Stabilization
- 1 October 2006
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 3 (10) , 486
Introduction: Self Stabilization
- 8 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Oriented Edge Colorings and Link Scheduling in Sensor Networks
This paper shows that TDMA slot assignment for unicast communication in a wireless network can be distributively computed for an n-node acyclic network in O(polylog(n)) time, with high probability. The best previous distributed algorithm for this problem requires O(n) time and obtains a TDMA schedule using 2Delta time slots. The new algorithm uses (1+epsiv)middot2Delta time slots where epsiv is a tunable fraction
- 8 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Oriented Edge Colorings and Link Scheduling in Sensor Networks
This paper shows that TDMA slot assignment for unicast communication in a wireless network can be distributively computed for an n-node acyclic network in O(polylog(n)) time, with high probability. The best previous distributed algorithm for this problem requires O(n) time and obtains a TDMA schedule using 2Delta time slots. The new algorithm uses (1+epsiv)middot2Delta time slots where epsiv is a tunable fraction
- 1 August 2006
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 3 (8) , 402
Introduction: Self Stabilization
- 1 August 2006
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 3 (8) , 402
Introduction: Self Stabilization
- 24 March 2005
- Published by Elsevier in Information Processing Letters
- Vol. 94 (5) , 203-209
Strategies for peer-to-peer downloading
- 24 March 2005
- Published by Elsevier in Information Processing Letters
- Vol. 94 (5) , 203-209
Strategies for peer-to-peer downloading
- 1 September 2003
- Published by Springer Nature in Distributed Computing
- Vol. 16 (2-3) , 75-110
Shared-memory mutual exclusion: major research trends since 1986
- 1 September 2003
- Published by Springer Nature in Distributed Computing
- Vol. 16 (2-3) , 75-110
Shared-memory mutual exclusion: major research trends since 1986
- 1 February 2001
- Published by Elsevier in Information Processing Letters
- Vol. 77 (2-4) , 115-121
Available stabilizing heaps
- 1 February 2001
- Published by Elsevier in Information Processing Letters
- Vol. 77 (2-4) , 115-121
Available stabilizing heaps
- Open Access
Available and Stabilizing 2-3 Trees
Transient faults corrupt the content and organization of data structures. A recovery technique dealing with such faults is stabilization, which guarantees, following some number of operations on the data structure, that content of the data structure is legitimate. Another notion of fault tolerance is availability, which is the property that operations continue to be applied during the period of recovery after a fault, and successful updates are not lost while the data structure stabilizes to a legitimate state. The available, stabilizing 2-3 tree supports find, insert, and delete operations, each with O(lg n) complexity when the tree's state is legitimate and contains n items. For an illegitimate state, these operations have O(lg K) complexity where K is the maximum capacity of the tree. Within O(t) operations, the state of the tree is guaranteed to be legitimate, where t is the number of nodes accessible via some path from the tree's root at the initial state. This paper resolves, for the first time, issues of dynamic allocation and pointer organization in a stabilizing data structure.
Open AccessAvailable and Stabilizing 2-3 Trees
Transient faults corrupt the content and organization of data structures. A recovery technique dealing with such faults is stabilization, which guarantees, following some number of operations on the data structure, that content of the data structure is legitimate. Another notion of fault tolerance is availability, which is the property that operations continue to be applied during the period of recovery after a fault, and successful updates are not lost while the data structure stabilizes to a legitimate state. The available, stabilizing 2-3 tree supports find, insert, and delete operations, each with O(lg n) complexity when the tree's state is legitimate and contains n items. For an illegitimate state, these operations have O(lg K) complexity where K is the maximum capacity of the tree. Within O(t) operations, the state of the tree is guaranteed to be legitimate, where t is the number of nodes accessible via some path from the tree's root at the initial state. This paper resolves, for the first time, issues of dynamic allocation and pointer organization in a stabilizing data structure.