Geschäftskunden Kundenprogramme
Vor Ort
Merkzettel Warenkorb

Gutscheinbedingungen

*Gültig bis 20.07.2026 auf alle Bücher. Ausgeschlossen sind Zeitschriften, Prozentbücher und Abos | Einlösbar in allen Buchhandlungen von Orell Füssli, Barth Bücher, Buchladen Rapunzel, Papeterie Köhler, Schuler Orell Füssli, Stauffacher und ZAP unter Vorweisung des Gutscheins, auf www.orellfüssli.ch durch Eingabe des Gutscheincodes. Beim Service „eBooks verschenken“ und bei eBook-Käufen via eReader nicht einlösbar | Mindesteinkaufswert: Fr. 30.- | Nicht mit anderen Rabatten kumulierbar.
Produktbild: Metropolitan Area Networks

Metropolitan Area Networks

Aus der Reihe Telecommunication Networks and Computer Systems

Fr. 137.00

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

23.07.2012

Verlag

Springer London

Seitenzahl

433

Maße (L/B/H)

23.5/15.5/2.5 cm

Gewicht

674 g

Auflage

Softcover reprint of the original 1st ed. 1997

Sprache

Englisch

ISBN

978-1-4471-1232-7

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

23.07.2012

Verlag

Springer London

Seitenzahl

433

Maße (L/B/H)

23.5/15.5/2.5 cm

Gewicht

674 g

Auflage

Softcover reprint of the original 1st ed. 1997

Sprache

Englisch

ISBN

978-1-4471-1232-7

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Metropolitan Area Networks
  • 1 Introduction.- 1.1 Capacity.- 1.2 From LANs to MANs.- 1.3 Fairness.- 1.4 User-oriented Performance Figures.- 1.5 Modeling of a MAN Environment.- 1.6 Outline of Contents.- 2 Stochastic Processes for Modeling Metropolitan Area Networks: Basic Results.- 2.1 Queueing Models for MAN Modeling.- 2.1.1 Single-queue Models.- 2.1.2 Single-queue Models with Server Vacations.- 2.1.3 Polling Models.- 2.2 System Properties.- 2.2.1 Little Theorem.- 2.2.2 Relationships between Arrival and Departure Distributions.- 2.2.3 Relationships between Arrival and Steady-state Distributions.- 2.3 Some Results on Renewal and Regenerative Processes.- 2.4 Work Conservation Laws.- 2.5 Stochastic Decomposition Laws.- 2.5.1 Stochastic Decomposition Laws for Single-queue Models.- 2.5.2 From the Decomposition Law to the Average Response Time.- 2.5.3 Stochastic Decomposition Laws for Polling Models.- 2.6 Pseudo-conservation Laws.- 2.6.1 Exhaustive Service Discipline.- 2.6.2 Gated Service Discipline.- 2.6.3 1-limited Service Discipline.- 2.6.4 l-limited Service Disciplines.- 3 Methods for the Analysis of Node-In-Isolation Models.- 3.1 M/G/l Systems.- 3.1.1 Infinite Buffer Systems.- 3.1.2 Finite Buffer Systems.- 3.2 M/G/l Systems with Vacation.- 3.2.1 Queue with Vacation and E-limited Service Discipline.- 3.2.2 Queue with Vacation and E-limited Service Disciplines.- 3.3 M/G/l-type Models.- 3.3.1 Solution Method.- 3.3.2 Implementing the Solution Method.- 3.3.3 Special Cases.- 3.3.4 Case Study: Analysis of a Packet-switching Node.- 3.4 Application of Node-in-isolation Models: Worst-case Analysis.- 3.4.1 Accuracy of the Worst-case Model Approach.- 3.4.2 E-limited Service Discipline.- 3.4.3 G-limited Service Discipline.- 4 Methods for the Analysis of Network-Wide Models: Polling Models.- 4.1 From Pseudo-conservation Laws to Waiting Time Analysis.- 4.1.1 Cycle Length Analysis: 1-limited Polling System.- 4.1.2 Cycle Length Analysis: l-limited Polling System.- 4.1.3 Waiting Time Analysis for 1-limited Polling Systems.- 4.1.4 Waiting Time Analysis for Polling Systems with Mixed Polling Strategies.- 4.1.5 Waiting Time Analysis for l-limited Polling Systems.- 4.2 Numerical Methods.- 4.2.1 Analysis of Finite Capacity Systems.- 4.2.2 Power Series Algorithm.- 4.3 For Further Study.- 4.3.1 Cycle Length Analysis: Convergence of the Iterative Procedure.- 4.3.2 1-limited Polling System: Details of the Computation.- 4.3.3 l-limited Polling System: Details of the Computation.- 4.3.4 Two-Moment Approximation of a Distribution.- 5 Fiber-Distributed Data Interface (FDDI).- 5.1 Introduction.- 5.2 FDDI Layers and Services.- 5.3 MAC Protocol.- 5.3.1 Token Structure.- 5.3.2 Frame Structure.- 5.3.3 FDDI Token Passing Mechanism.- 5.3.4 FDDI Timed Token Protocol.- 5.3.5 Additional FDDI Features.- 5.3.6 Claim Token Process.- 5.3.7 Beacon Process.- 5.3.8 Examples of Parameter Calculations.- 5.4 FDDI MAC Protocol Capacity.- 5.5 FDDI Cycle Properties.- 5.5.1 Maximum Cycle Length.- 5.5.2 Average Cycle Length.- 5.6 Remarks on the IEEE 802.4 Token Bus Protocol.- 5.7 Current Use of FDDI.- 6 FDDI Models.- 6.1 Introduction.- 6.2 Network-wide Models.- 6.2.1 Single-buffer Model with Synchronous and Asynchronous Traffic (Model 1).- 6.2.2 An FDDI Model with Zero Switchover Time (Model 2).- 6.2.3 An FDDI Network with Synchronous Traffic (Model 3).- 6.2.4 An FDDI Network with Asynchronous Traffic (Model 4).- 6.3 Station-in-isolation Models.- 6.3.1 M/G/l with Vacation and Exhaustive Limited with Limit Variation Service Discipline (Model 5).- 6.3.2 Worst Case Model for Synchronous Traffic (Model 6).- 6.3.3 M/G/l with Vacation and Vacation-dependent Time-limited Service Discipline (Model 7).- 6.3.4 M/G/l with Vacations and Time-controlled Service Discipline with and without Accumulated Delay (Model 8).- 6.4 Model 4: Details of the Computation.- 7 Distributed Queue Dual Bus (DQDB).- 7.1 Functional Architecture of a Node.- 7.2 Connectionless Data Service.- 7.2.1 MAC Convergence Function.- 7.2.2 DQDB MAC Protocol.- 7.2.3 DQDB MAC Protocol with Priorities.- 7.3 DQDB Performance and Fairness.- 7.3.1 Underload Analysis.- 7.3.2 Asymptotic Analysis.- 7.4 The Bandwidth Balancing Mechanism.- 7.4.1 Performance of DQDB with one Level of Priority and the BWB Mechanism.- 7.4.2 Performance of DQDB with Several Levels of Priority and the BWB Mechanism.- 7.5 DQDB MAC Protocol Capacity.- 7.6 Current Use of DQDB.- 7.6.1 The Tuscany MAN Testbed.- 8 DQDB Models.- 8.1 Introduction.- 8.2 Network-wide Models.- 8.2.1 Node-spaced Models.- 8.2.2 Node-concentrated Models.- 8.3 Node-in-isolation Models.- 8.3.1 L_NET Modeling.- 8.3.2 Tagged Node Models.- 9 Evolution Towards Gigabit Rates.- 9.1 Shared Medium Gigabit Networks.- 9.1.1 Cyclic Reservation Multiple Access (CRMA).- 9.1.2 MetaRing MAC Protocol.- 9.2 ATM-based Gigabit Networks.- 9.2.1 ATM LAN.- Acronyms.- Glossary of Notation.