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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 26397290530
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand. Codice articolo 400135165
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND. Codice articolo 18397290536
Quantità: 4 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9786202571067
Quantità: 2 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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. Codice articolo 9786202571067
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9786202571067
Quantità: 1 disponibili