( en | de | ru )

 

Disambiguation of "Barth, Dominique"

Author of the publication

copydeleteadd this publication to your clipboard
Compact Multicast Algorithms on Grids and Tori Without Intermediate Buffering.

, and . Parallel Process. Lett., 12 (1): 31-39 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dominique Dudkowski

Fundamental storage mechanisms for location-based services in mobile ad-hoc networks. Uni Stuttgart, (2009)

Dominique Bouts

Dominique Bäumer

Dominique Schaaf

Dominique Singer

 

Other publications of authors with the same name

Model for sharing femto access., , and . VALUETOOLS, page 254-264. ICST/ACM, (2011)End-to-end quality of service in pseudo-wire networks., , and . StudentWorkshop@CoNEXT, page 21:1-21:2. ACM, (2011)Risk-aware SLA negotiation., , , , and . VALUETOOLS, page 223-232. ICST/ACM, (2013)Reputation-Aware Learning for SLA Negotiation., , and . Networking Workshops, volume 7291 of Lecture Notes in Computer Science, page 80-88. Springer, (2012)Distributed Multi-link Auctions for Network Resource Reservation and Pricing., and . QofIS, volume 3266 of Lecture Notes in Computer Science, page 328-337. Springer, (2004)Bandwidth and Cutwidth of the Mesh of d-Ary Trees.. Euro-Par, Vol. I, volume 1123 of Lecture Notes in Computer Science, page 243-246. Springer, (1996)Detecting flows congesting a target network link., , and . Electron. Notes Discret. Math., (2005)Efficient Micro-Mobility with Congestion Avoiding in Two-Nodes Mobile IP Network Architecture., , , and . NTMS, page 1-6. IEEE, (2009)Scattering and multi-scattering in trees and meshes, with local routing and without buffering., and . Parallel Comput., 25 (8): 1035-1057 (1999)Optimal configuration of an optical network providing predefined multicast transmissions., , , , and . Comput. Networks, 56 (8): 2097-2106 (2012)