Searching for authors named "Marios Mavronicolas" – sorted by Relevance.
39 documents found, showing 1 through 10.
Next 10 →
-
Stability in routing: Networks and protocols
- …We provide a state-of-the-art survey of results concerning stability issues for routing in communication networks, and corresponding protocols. Roughly speaking, a distributed routing protocol is stable on some particular network if the protocol maintains a bounded number of packets in the network a…
- Cited by 1 (0 self) – Add To MetaCart
-
A Network Game with Attacker and Protector Entities
- …Abstract. Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. Opponent to the attackers is the system protector scanning and cleaning from attackers some part of the network…
- Cited by 6 (4 self) – Add To MetaCart
-
A Graph-Theoretic Network Security Game
- …Abstract. Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. We model this practical network scenario as a non-cooperative multi-player game on a graph, with two kinds of players, a set of attackers and a protect…
- Cited by 4 (3 self) – Add To MetaCart
-
Impossibility Results for Weak Threshold Networks
- …It is shown that a weak threshold network (in particular, threshold network) of width w and depth d cannot be constructed from balancers of width p 0 ; p 1 ; : : : ; p m\Gamma1 , if w does not divide P d , where P is the least common multiple of p 0 ; p 1 ; : : : ; p m\Gamma1 . This holds regardle…
- Cited by 4 (4 self) – Add To MetaCart
-
Impossibility Results for Threshold Networks
- …It is shown that a threshold network of width w and depth d cannot be constructed from balancers of width p 0 ; p 1 ; : : : ; p m\Gamma1 , if w does not divide P d , where P is the least common multiple of p 0 ; p 1 ; : : : ; p m\Gamma1 . This holds regardless of the size of the network, as long a…
- Cited by 1 (1 self) – Add To MetaCart
-
Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract)
- …) Marios Mavronicolas ? Dan Roth ?? Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138, USA Abstract. We present linearizable implementations for two distributed organizations of multiprocessor shared memory. For the full caching organization, where each process keeps a local c…
- Cited by 7 (2 self) – Add To MetaCart
-
Impossibility Results for Threshold Networks
- …It is shown that a threshold network of width w and depth d cannot be constructed from balancers of width p 0 ; p 1 ; : : : ; p m01 , if w does not divide P d , where P is the least common multiple of p 0 ; p 1 ; : : : ; p m01 . This holds regardless of the size of the network, as long as it is fin…
- Add To MetaCart
-
A Combinatorial Characterization of Properties Preserved by Antitokens
- …Introduction Balancing networks were devised by Aspnes et al. [4] as a novel class of distributed data structures that provide highly-concurrent, low-contention solutions to a varietyofmultiprocessor synchronization problems. A balancing network is constructed from elementary switches with # input…
- Add To MetaCart
-
Efficient, Rate-Based Flow Control Algorithms
- …Two important parameters of rate-based flow control algorithms, from the point of view of network performance, are their locality, which can be measured by the amount of global knowledge required for the distributed implementation of their scheduling mechanisms, and their convergence complexity, def…
- Add To MetaCart
-
Greedy Õ(C+D) Hot-Potato Routing on Trees
- …In hot-potato (deflection) routing, nodes in the network have no bu#ers for packets in transit. A hotpotato routing algorithm is greedy if packets are advanced from their sources toward their destinations whenever possible. The dilation D is the longest distance a packet has to travel; the conges…
- Cited by 1 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
