B. Awerbuch, S. Kutten, andD. Peleg. On buffer-economical store-and-forward deadlock prevention. IEEE Transactions on Communications, 42(11):2934--2937, November 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....three one dimensional intervals are necessary. We shall discuss these results again in Section 4. In the context of routing, questions regarding covering a graph by a family of trees satisfying certain relations between distances on the graph and distances on the trees have been studied in [2]. In the context of hashing, mapping an m dimensional mesh into buckets, such that each bucket contains few elements, and local neighborhoods (of one particular size) on the mesh are mapped into a small number of buckets, has been studied in [6] The two studies mentioned above (and other similar ....

B. Awerbuch, S. Kutten, andD. Peleg. On buffer-economical store-and-forward deadlock prevention. IEEE Transactions on Communications, 42(11):2934--2937, November 1994.

.... this method as a basic building block leads to significant performance improvements for several fundamental network control problems (such as shortest paths [AR91] job scheduling and load balancing [AKP92] broadcast and multicast [ABP91] routing with small tables [AP92] deadlock prevention [AKP91] bandwidth management in high speed networks [ACG 90] and database management [BFR92] as well as for classical problems in sequential computing (such as finding small edge cuts in planar graphs [Rao92] and approximate all pairs shortest paths [ABCP93, Coh93] In most of these ....

.... In parallel to the introduction of sparse neighborhood covers in [Pel89] the strongly related, yet distinct, notion of network decomposition was introduced in [AGLP89] The main difference between the two notions is that sparse neighborhood covers, as used in [Pel93, AP90b, AP90a, BFR92, AKP92, AKP91] consist of clusters that capture the expected definition of local neighborhood (see Section 2) while network decomposition as utilized in [AGLP89, LS91, PS92, ABCP92] employs only a weak notion of neighborhood. In fact, the way network decomposition is defined in [AGLP89] the clusters might ....

Baruch Awerbuch, Shay Kutten, and David Peleg. On buffer-economical storeand -forward deadlock prevention. In Proc. of the 1991 INFOCOM, 1991.

....levels of the hierarchy, and will cost accordingly. These ideas are demonstrated in the applications presented in the sequel. We shall also discuss several other graph theoretic structures that are strongly related to covers. These include sparse spanners (cf. PS89] tree covers of graphs (cf. [AKP90]) and the new concepts of regional matchings and diameter based separators. All of these structures are constructible using one of our clustering algorithms, and each of them has proved to provide a convenient representation for handling certain network applications. Another related graph ....

....application is that of maintaining locality preserving distributed data structures, particularly directories. This application is handled in [Pel90] using the average cover algorithm AV COVER described in Section 5. Another application involves the classical problem of deadlock free routing. In [AKP90], it is shown how to use the tree covers of Section 6.4 in order to devise a deadlock free routing scheme using fewer buffers at the cost of increasing the route length. Specifically, the resulting routing requires O(k Delta n 1=k Delta log Diam(G) buffers per vertex, where Diam(G) denotes ....

[Article contains additional citation context not shown here]

Baruch Awerbuch, Shay Kutten, and David Peleg. On buffer-economical store-and-forward deadlock prevention. March 1990. Unpublished manuscript.

....concept of sparse graph covers [P89a, AP90a] Such covers seem to play a fundamental role in the design of several types of locality preserving network representations. Indeed, cover based network representations have already found several applications in the area of distributed network algorithms [P89b, PU89a, PU89b, AGLP89, AP90c, AP90b, AKP90]. The construction of sparse covers and partitions can be achieved using the clustering and decomposition techniques developed in [A85, PS89, P89a, AP90a, AP90d, LS91] The rest of the paper is organized as follows. The next section contains a precise definition of the model and the problem. In ....

B. Awerbuch, S. Kutten and David Peleg. On buffer-economical store-and-forward deadlock prevention, Proc. INFOCOM, 1991.

.... Protocols, October 1991, Zurich Such covers seem to play a fundamental role in the design of several types of locality preserving network representations. Indeed, cover based network representations have already found several applications in the area of distributed network algorithms [P89b, PU89a, PU89b, AGLP89, AP90c, AP90b, AKP90]. Sparse covers and partitions can be constructed via clustering and decomposition techniques developed in [A85, PS89, P89a, AP90a, AP90d, LS91] The rest of the paper is organized as follows. The next section contains a precise definition of the model and the problem. In Section 3 we give an ....

B. Awerbuch, S. Kutten and David Peleg. On buffer-economical store-andforward deadlock prevention, Proc. INFOCOM, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC