Given a fixed network of routers, a set of multicast sources and their corresponding receivers, the problem of constructing multicast sessions that maximize the multicast throughput of all sessions for different applications has been considered in this book. It is known that for problem with only one source node, heuristic algorithms based on packing maximum-rate Steiner trees may achieve throughput close to network capacity for some networks of interest. As it is investigated thoroughly in this book, direct extension of such successful algorithms for single-source scenarios to multi-source application is inefficient. In this book, it has been proposed and investigated three novel classes of tree packing algorithms, the non-cooperative class, the medium cooperative class and the highly cooperative class, that are distinguished by the degree of cooperation between participating routers. It has been show, how better performance can be achieved when the source nodes act more cooperatively (and less selfishly), as they claim bandwidth resources in the networks. It has been shown that this approach is completely competitive with network coding in IP networks.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reza got his B.Sc in Electrical Engineering and first master in Computer Science both from Sharif University of Technology. He got his second master in Software Engineering from University of Regina in Canada. His current research interests are, Multimedia and Cloud Computing, System Oriented Architecture and Combinatorial Optimization.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Given a fixed network of routers, a set of multicast sources and their corresponding receivers, the problem of constructing multicast sessions that maximize the multicast throughput of all sessions for different applications has been considered in this book. It is known that for problem with only one source node, heuristic algorithms based on packing maximum-rate Steiner trees may achieve throughput close to network capacity for some networks of interest. As it is investigated thoroughly in this book, direct extension of such successful algorithms for single-source scenarios to multi-source application is inefficient. In this book, it has been proposed and investigated three novel classes of tree packing algorithms, the non-cooperative class, the medium cooperative class and the highly cooperative class, that are distinguished by the degree of cooperation between participating routers. It has been show, how better performance can be achieved when the source nodes act more cooperatively (and less selfishly), as they claim bandwidth resources in the networks. It has been shown that this approach is completely competitive with network coding in IP networks. 84 pp. Englisch. Bestandsnummer des Verkäufers 9783838398358
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Given a fixed network of routers, a set of multicast sources and their corresponding receivers, the problem of constructing multicast sessions that maximize the multicast throughput of all sessions for different applications has been considered in this book. It is known that for problem with only one source node, heuristic algorithms based on packing maximum-rate Steiner trees may achieve throughput close to network capacity for some networks of interest. As it is investigated thoroughly in this book, direct extension of such successful algorithms for single-source scenarios to multi-source application is inefficient. In this book, it has been proposed and investigated three novel classes of tree packing algorithms, the non-cooperative class, the medium cooperative class and the highly cooperative class, that are distinguished by the degree of cooperation between participating routers. It has been show, how better performance can be achieved when the source nodes act more cooperatively (and less selfishly), as they claim bandwidth resources in the networks. It has been shown that this approach is completely competitive with network coding in IP networks. Bestandsnummer des Verkäufers 9783838398358
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Rahimi M. RezaReza got his B.Sc in Electrical Engineering and first master in Computer Science both from Sharif University of Technology. He got his second master in Software Engineering from University of Regina in Canada. His cu. Bestandsnummer des Verkäufers 5420048
Anzahl: Mehr als 20 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Given a fixed network of routers, a set of multicast sources and their corresponding receivers, the problem of constructing multicast sessions that maximize the multicast throughput of all sessions for different applications has been considered in this book. It is known that for problem with only one source node, heuristic algorithms based on packing maximum-rate Steiner trees may achieve throughput close to network capacity for some networks of interest. As it is investigated thoroughly in this book, direct extension of such successful algorithms for single-source scenarios to multi-source application is inefficient. In this book, it has been proposed and investigated three novel classes of tree packing algorithms, the non-cooperative class, the medium cooperative class and the highly cooperative class, that are distinguished by the degree of cooperation between participating routers. It has been show, how better performance can be achieved when the source nodes act more cooperatively (and less selfishly), as they claim bandwidth resources in the networks. It has been shown that this approach is completely competitive with network coding in IP networks.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 84 pp. Englisch. Bestandsnummer des Verkäufers 9783838398358
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. On Optimal Multimedia and Data Multicast in IP Networks | A System Level Approach to Optimized IP Multicast | M. Reza Rahimi | Taschenbuch | 84 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838398358 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. Bestandsnummer des Verkäufers 107408402
Anzahl: 5 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Bestandsnummer des Verkäufers ERICA79038383983516
Anzahl: 1 verfügbar