Searching for "Directed Tree Networks." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

11 documents found, showing 1 through 10. Next 10 →

Directed Tree Networks
by Technological Developments In
…1 date: May 6, 1998 file: erleba1 DIRECTED TREE NETWORKS Technological developments in the field…
Add To MetaCart

Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree
by Thomas Erlebach, Klaus Jansen — 1998 — Proceedings of the 2nd Workshop on Algorithm Engineering WAE'98, Technical Report MPI-I-98-1-019, pages 13--24, Max-Planck-Institut fur Informatik, Saarbrucken
…--24 Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks…
Cited by 2 (1 self) – Add To MetaCart

Scheduled Hot-Potato Routing
by Joseph (Seffi) Naor, Ariel Orda, Raphael Rom — 1998 — Journal of Graph Algorithms and Applications
… The network is a directed graph G(V; E), where V is the set of nodes and E V V is the set of edges…
Cited by 3 (0 self) – Add To MetaCart

Maximizing the Number of Connections in Optical Tree Networks
by Thomas Erlebach, Klaus Jansen — 1998 — In Proceedings of the 9th Annual International Symposium on Algorithms and Computation (1998), LNCS 1533
… study the problem of satisfying a maximum number of connection requests in a directed tree network…
Cited by 10 (4 self) – Add To MetaCart

Approximating the Traffic Grooming Problem in Tree and Star Networks ⋆ (Extended Abstract)
by Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
… bounded degree tree networks and for directed tree networks are presented in the following two subsections…
Add To MetaCart

Optimal Wavelength Routing on Directed Fiber Trees
by Thomas Erlebach, Tu Munchen, Klaus Jansen, Christos Kaklamanis, Pino Persiano — 1999 — Theoretical Computer Science
… topologies which are relevant to wide-area networks. In particular we consider directed trees where each edge…
Cited by 29 (13 self) – Add To MetaCart

Optimal Allocation of Electronic Content (an Earlier Draft With More Examples)
by Israel Cidon, Shay Kutten, Ran Soffer — 2001
… and its solution with OLA. 1 The Model A directed tree T = (V; E) represents the communication network…
Cited by 1 (1 self) – Add To MetaCart

Optimal Allocation of Electronic Content (Extended Abstract)
by Israel Cidon, Shay Kutten — 2000
… the leaves. Consequently, this instance of the problem over a directed tree network is an important practical…
Add To MetaCart

Full Circle: Simulating Linux Clusters on Linux Clusters
by Luis Ceze, Karin Strauss, George Almasi, Patrick J. Bohrer, Jose R. Brunheroto, Calin Cascaval, Jose G. Castanos, Derek Lieber, Xavier, Xavier Martorell, José E. Moreira, Alda Sanomiya, Eugen Schenfeld — 2003 — In Proceedings of the Fourth LCI International Conference on Linux Clusters: The HPC Revolution 2003
….4Gb/s, and the bisection bandwidth of a 64K node system is 360GB/s (each direction). The tree network…
Cited by 1 (1 self) – Add To MetaCart

2nd Workshop on Algorithm Engineering WAE'98 - Proceedings
by Kurt Mehlhorn (ed.), Kurt Mehlhorn, Kurt Mehlhorn — 1998
… Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks…
Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB