Spelling suggestions: "subject:"1topology"" "subject:"cotopology""
1 |
Reliable key-based routing topologies.Risson, John, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW January 2007 (has links)
Key-based routing enables massive, networked systems to direct messages to a node responsible for a resource and its key. Our thesis is that key-based routing (KBR) is a reliable primitive for large Internet services. Four issues are addressed. Firstly, most KBR schemes do not support strong routing consistency: routing is consistent when one and only one node delivers messages for a given key to the application layer. Inconsistent routing can cause application-layer performance problems and faults. The faulttolerant active rings (ftar) algorithm of this dissertation is unique in that it is fault-tolerant and it guarantees strong routing consistency: other algorithms either support probabilistic routing consistency or are not fault-tolerant. Routing tables are updated only after a joining or leaving node and its two immediate neighbors agree to the topology change. We formally specify, refine and prove the algorithm using the B Method. Secondly, algorithms are required to maintain one-hop KBR topologies reliably. One-hop topologies can give lower message latency and loss than topologies with small routing tables. Existing one-hop topologies with full routing tables have expensive repair mechanisms or critical points of failure. To avoid these problems, we contribute anti-entropy multicast (aecast), a reliable multicasting algorithm for one-hop topology maintenance. Aecast is compared with another epidemic multicasting algorithm, pbcast, by analysis and simulation; aecast gives at least fivefold fewer out-of-date nodes on average within one round of a topology update; faster updates improve routing performance. Thirdly, accurate analysis of lazy replica repair algorithms is required. Whereas the above algorithms maintain the topology, replication algorithms maintain data stored on the topology. One algorithm lazily repairs replicas when there is a membership timeout for failed nodes; the analysis ignored replica repair times and therefore overestimates availability. The Markov analysis here is more accurate. Fourthly, hierarchic topologies are reliable in that they protect the local topology from remote failures and network partitions; in existing designs, topology changes burden the top of the hierarchy. We devise a hierarchic architecture that avoids this problem.
|
2 |
Curves in non-metrical analysis situs with an application in the calculus of variations ...Lennes, N. J. January 1911 (has links)
Thesis (Ph. D.)--University of Chicago, 1907. / Vita. Reprinted from American journal of mathematics, vol. XXXIII, no. 3.
|
3 |
Symmetrical cut setsDancer, Wayne. January 1900 (has links)
Thesis (Ph. D.)--University of Michigan. / Cover title. Reprinted from Fundamenta mathematicae, vol. XXVII, 1936. Includes bibliographical references.
|
4 |
Zur Komplettierung topologischer GruppenFischer, Hans Rudolf, January 1959 (has links)
Inaug.-Diss.--Universität Zürich. / Vita. Includes bibliographical references (p. 22).
|
5 |
Über eine Anwendung der konformen Abbildung zum beweise einiger Deformationssätze der Topologie ...Kronsbein, Jack, January 1930 (has links)
Inaug.-diss.-Leipzig. / Lebenslauf. "Literaturverzeichnis": p. [9]-10.
|
6 |
Examples of topological spacesSchaffer, Robert John 08 1900 (has links)
No description available.
|
7 |
The Dimension of a topological spaceGard, James Risen 12 1900 (has links)
No description available.
|
8 |
Compact and related mappingsCain, George Lee 08 1900 (has links)
No description available.
|
9 |
The lifting and generalized extension problemsBastida, Eduardo Ramon 08 1900 (has links)
No description available.
|
10 |
Nets with well-ordered domainsHamrick, Gary Calvin 08 1900 (has links)
No description available.
|
Page generated in 0.0271 seconds