Controller and estimator for dynamic networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 175-184

  Korman, Amos ^a   Kutten, Shay ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Asynchronous protocols; Distributed algorithms; Labeling schemes

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMICAL SYSTEMS; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; PROBLEM SOLVING; TOPOLOGY;

ASYNCHRONOUS PROTOCOLS; DISTRIBUTED NETWORKS; DYNAMIC NETWORK; LABELING SCHEMES; SPANNING TREE;

COMPUTER NETWORKS;

EID: 36849003455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281127     Document Type: Conference Paper

References (27)

1. Y. Afek, B. Awerbuch, S.A. Plotkin and M. Saks. Local management of a global resource in a communication network. J. ACM 43, (1996), 1-19.
2. Y. Afek, E. Gafni, and M. Ricklin. Upper and lower bounds for routing schemes in dynamic networks. In Proc. 30th Symp. on Foundations of Computer Science (FOCS), 1989, 370-375.
3. Y. Afek and M. E. Saks. Detecting Global Termination Conditions in the Face of Uncertainty. In Proc. 6th Ann. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC),1987, pp. 109-124.
4. B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), 1993, pp. 164-173.
5. B. Awerbuch, S. Kutten, and D. Peleg. Competitive Distributed Job Scheduling. In Proc. 24th Annual ACM Symposium on Theory of Computing (STOC), 1992, pp. 571-580.
6. R. Bar-Yehuda and S. Kutten. Fault-Tolerant Majority Commitment. J. of Alg. Vol. 9, pp. 568-582, 1988.
7. L. Barrire, P. Flocchini, P. Fraigniaud, and N. Santoro. Can we elect if we cannot compare? In Proc. 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), 2003, pp. 324-332.
8. Y. Bartal, A. Fiat, and Y. Rabani. Competitive Algorithms for Distributed data Management. J. Comput. Syst. Sci. 51(3): 341-358 (1995).
9. Y. Bartal and A. Rosen. The Distributed k-Server Problem- A Competitive Distributed Translator folk-Server Algorithms. In Proc. 33rd Symp. on Foundations of Computer Science (FOCS), pp. 344-354, 1992.
10. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Math. 1 (1959), S. pp. 269-271.
11. M. J. Fischer, N. A. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2), pp. 374-382 (1985).
12. P. Fraigniaud and C. Gavoille. Routing in trees. In Proc. 28th Int. Colloq. on Automata, Languages, and Programming (ICALP). 2001, pp. 757-772.
13. C. Gavoille, D. Peleg, S. Perennes and R. Raz. Distance labeling in graphs. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2001, pp. 210-219.
14. S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. In SIAM J. on Descrete Math 5, (1992), 596-603.
15. M. Katz, N.A. Katz, A. Korman and D. Peleg. Labeling schemes for flow and connectivity. SIAM Journal on Computing 34 (2004),23-40.
16. E. Korach, S. Kutten, and S. Moran. A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. ACM TOPLAS Vol. 12, No. 1,pp. 84-101, 1990.
17. A. Korman. General Compact Labeling Schemes for Dynamic Trees. In Proc. 19th International Symposium on Distributed Computing (DISC), 2005.
18. A. Korman. Labeling Schemes for Vertex Connectivity. In Proc. 34th Int. Colloq. on Automata, Languages, and Programming (ICALP), 2007.
19. A. Korman and S. Kutten. Distributed Verification of Minimum Spanning Trees. In Proc. 25th Ann. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), 2006.
20. A. Korman, D. Peleg, and Y. Rodeh. Labeling schemes for dynamic tree networks. Theory of Computing Systems (ToCS) 37 (2004), pp. 49-75.
21. A. Korman and D. Peleg. Labeling Schemes for Weighted Dynamic Trees. In Proc. 30th Int. Colloq. on Automata, Languages, and Programming (ICALP), 2003, pp. 369-383.
22. A. Korman and D. Peleg. Dynamic Routing Schemes for General Graphs. In Proc. 33rd Int. Colloq. on Automata, Languages, and Programming (ICALP), 2006.
23. S. Kutten. Optimal Fault-Tolerant Distributed Construction of a Spanning Forest. Information Processing Letters, Vol. 27, pp. 299-307,May 1988.
24. N.A. Lynch, N.D. Griffeth, M.J. Fischer and L.J. Guibas. Probabilistic Analysis of a Network Resource Allocation Algorithm. Inf. Cont. 68, 47-85.
25. M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive Algorithms for On-Line Problems. In Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), 1988, pp. 322-333.
26. J. Moy - 1994 - RFC 2328, April 1998.
27. M. Thorup and U. Zwick. Compact routing schemes. In Proc. 13th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 2001, pp. 1-10.