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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
D. C. Champeney, Fourier Transforms and Their Physical Applications, Academic Press, Nueva York, 1973.F. J. Harris, "On the use of windows for harmonic analysis with the discrete Fourier Transform", Proceedings IEEE, pág. 51-82, 1978.H. Baher, H. Baher, Analog & Digital Signal Processing, John Wiley & Sons, Nueva York.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. Bestandsnummer des Verkäufers 26397290530
Anzahl: 4 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Print on Demand. Bestandsnummer des Verkäufers 400135165
Anzahl: 4 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND. Bestandsnummer des Verkäufers 18397290536
Anzahl: 4 verfügbar
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 -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. Bestandsnummer des Verkäufers 9786202571067
Anzahl: 2 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9786202571067
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9786202571067
Anzahl: 1 verfügbar