In this article we will study some basic problems defined on graphs and computer networks. In particular we propose to examine the analogies between networks and the mathematical theory of weighted and unweighted graphs, applied to routing protocols. In a network a sending host is directly connected to the so-called default router origin (or first hop) present in its network segment and transfers all the packets it has to send to it. The problem to be solved, which is that of routing a packet between the source and destination hosts, can clearly be traced back to the problem of routing the packet between these two routers.Routing a packet over a network is the same as finding a "path" between source and destination: moreover, the path sought must be as short as possible, i.e. we are looking for a minimum path.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26397290530
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 400135165
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18397290536
Quantité disponible : 4 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this article we will study some basic problems defined on graphs and computer networks. In particular we propose to examine the analogies between networks and the mathematical theory of weighted and unweighted graphs, applied to routing protocols. In a network a sending host is directly connected to the so-called default router origin (or first hop) present in its network segment and transfers all the packets it has to send to it. The problem to be solved, which is that of routing a packet between the source and destination hosts, can clearly be traced back to the problem of routing the packet between these two routers.Routing a packet over a network is the same as finding a 'path' between source and destination: moreover, the path sought must be as short as possible, i.e. we are looking for a minimum path. 100 pp. Englisch. N° de réf. du vendeur 9786202571067
Quantité disponible : 2 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -In this article we will study some basic problems defined on graphs and computer networks. In particular we propose to examine the analogies between networks and the mathematical theory of weighted and unweighted graphs, applied to routing protocols. In a network a sending host is directly connected to the so-called default router origin (or first hop) present in its network segment and transfers all the packets it has to send to it. The problem to be solved, which is that of routing a packet between the source and destination hosts, can clearly be traced back to the problem of routing the packet between these two routers.Routing a packet over a network is the same as finding a 'path' between source and destination: moreover, the path sought must be as short as possible, i.e. we are looking for a minimum path.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 100 pp. Englisch. N° de réf. du vendeur 9786202571067
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this article we will study some basic problems defined on graphs and computer networks. In particular we propose to examine the analogies between networks and the mathematical theory of weighted and unweighted graphs, applied to routing protocols. In a network a sending host is directly connected to the so-called default router origin (or first hop) present in its network segment and transfers all the packets it has to send to it. The problem to be solved, which is that of routing a packet between the source and destination hosts, can clearly be traced back to the problem of routing the packet between these two routers.Routing a packet over a network is the same as finding a 'path' between source and destination: moreover, the path sought must be as short as possible, i.e. we are looking for a minimum path. N° de réf. du vendeur 9786202571067
Quantité disponible : 1 disponible(s)