Normal view MARC view ISBD view

Modeling and Analysis of Telecommunications Networks. (Record no. 38794)

000 -LEADER
fixed length control field	09703nam a22004933i 4500
001 - CONTROL NUMBER
control field	EBC175986
003 - CONTROL NUMBER IDENTIFIER
control field	MiAaPQ
005 - DATE AND TIME OF LATEST TRANSACTION
control field	20181121143654.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION
fixed length control field	m o d \|
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field	cr cnu\|\|\|\|\|\|\|\|
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	181113s2004 xx o \|\|\|\|0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number	9780471643395
--	(electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN	9780471348450
035 ## - SYSTEM CONTROL NUMBER
System control number	(MiAaPQ)EBC175986
035 ## - SYSTEM CONTROL NUMBER
System control number	(Au-PeEL)EBL175986
035 ## - SYSTEM CONTROL NUMBER
System control number	(CaPaEBR)ebr10113991
035 ## - SYSTEM CONTROL NUMBER
System control number	(CaONFJC)MIL36797
035 ## - SYSTEM CONTROL NUMBER
System control number	(OCoLC)54772966
040 ## - CATALOGING SOURCE
Original cataloging agency	MiAaPQ
Language of cataloging	eng
Description conventions	rda
--	pn
Transcribing agency	MiAaPQ
Modifying agency	MiAaPQ
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number	TK5101.H39 2004
082 0# - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number	621.3820151
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name	Hayes, Jeremiah F.
245 10 - TITLE STATEMENT
Title	Modeling and Analysis of Telecommunications Networks.
250 ## - EDITION STATEMENT
Edition statement	1st ed.
264 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc	Hoboken :
Name of publisher, distributor, etc	John Wiley & Sons, Incorporated,
Date of publication, distribution, etc	2004.
264 #4 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Date of publication, distribution, etc	©2004.
300 ## - PHYSICAL DESCRIPTION
Extent	1 online resource (415 pages)
336 ## - CONTENT TYPE
Content type term	text
Content type code	txt
Source	rdacontent
337 ## - MEDIA TYPE
Media type term	computer
Media type code	c
Source	rdamedia
338 ## - CARRIER TYPE
Carrier type term	online resource
Carrier type code	cr
Source	rdacarrier
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note	Intro -- MODELING AND ANALYSIS OF TELECOMMUNICATIONS NETWORKS -- CONTENTS -- Preface -- Retrieving Files from the Wiley FTP and Internet Sites -- 1 Performance Evaluation in Telecommunications -- 1.1 Introduction: The Telephone Network -- 1.1.1 Customer Premises Equipment -- 1.1.2 The Local Network -- 1.1.3 Long-Haul Network -- 1.1.4 Switching -- 1.1.5 The Functional Organization of Network Protocols -- 1.2 Approaches to Performance Evaluation -- 1.3 Queueing Models -- 1.3.1 Basic Form -- 1.3.2 A Brief Historical Sketch -- 1.4 Computational Tools -- Further Reading -- 2 Probability and Random Processes Review -- 2.1 Basic Relations -- 2.1.1 Set Functions and the Axioms of Probability -- 2.1.2 Conditional Probability and Independence -- 2.1.3 The Law of Total Probability and Bayes' Rule -- 2.2 Random Variables-Probability Distributions and Densities -- 2.2.1 The Cumulative Distribution Function -- 2.2.2 Discrete Random Variables -- 2.2.3 Continuous Random Variables -- 2.3 Joint Distributions of Random Variables -- 2.3.1 Probability Distributions -- 2.3.2 Joint Moments -- 2.3.3 Autocorrelation and Autocovariance Functions -- 2.4 Linear Transformations -- 2.4.1 Single Variable -- 2.4.2 Sums of Random Variables -- 2.5 Transformed Distributions -- 2.6 Inequalities and Bounds -- 2.7 Markov Chains -- 2.7.1 The Memoryless Property -- 2.7.2 State Transition Matrix -- 2.7.3 Steady-State Distribution -- 2.8 Random Processes -- 2.8.1 Defintion: Ensemble of Functions -- 2.8.2 Stationarity and Ergodicity -- 2.8.3 Markov Processes -- References -- Exercises -- 3 Application of Birth and Death Processes to Queueing Theory -- 3.1 Elements of the Queueing Model -- 3.2 Little's Formula -- 3.2.1 A Heuristic -- 3.2.2 Graphical Proof -- 3.2.3 Basic Relationship for the Single-Server Queue -- 3.3 The Poisson Process -- 3.3.1 Basic Properties.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note	3.3.2 Alternative Characterizations of the Poisson Process -- 3.3.3 Adding and Splitting Poisson Processes -- 3.3.4 Pure Birth Processes -- 3.3.5 Poisson Arrivals See Time Averages (PASTA) -- 3.4 Birth and Death Processes: Application to Queueing -- 3.4.1 Steady-State Solution -- 3.4.2 Queueing Models -- 3.4.3 The M/M/1 Queue-Infinite Waiting Room -- 3.4.4 The M/M/1/L Queue-Finite Waiting Room -- 3.4.5 The M/M/S Queue-Infinite Waiting Room -- 3.4.6 The M/M/S/L Queue-Finite Waiting Room -- 3.4.7 Finite Sources -- 3.5 Method of Stages -- 3.5.1 Laplace Transform and Averages -- 3.5.2 Insensitivity Property of Erlang B -- 3.5.3 The Erlang B Blocking Formula: N Lines, Homogeneous Traffic -- References -- Exercises -- 4 Networks of Queues: Product Form Solution -- 4.1 Introduction: Jackson Networks -- 4.2 Reversibility: Burke's Theorem -- 4.2.1 Reversibility Defined -- 4.2.2 Reversibility and Birth and Death Processes -- 4.2.3 Departure Process from the M/M/S Queue: Burke's Theorem -- 4.3 Feedforward Networks -- 4.3.1 A Two-Node Example -- 4.3.2 Feedforward Networks: Application of Burke's Theorem -- 4.3.3 The Traffic Equation -- 4.4 Product Form Solution for Open Networks -- 4.4.1 Flows Within Feedback Paths -- 4.4.2 Detailed Derivation for a Two-Node Network -- 4.4.3 N-Node Open Jackson Networks -- 4.4.4 Average Message Delay in Open Networks -- 4.4.5 Store-and-Forward Message-Switched Networks -- 4.4.6 Capacity Allocation -- 4.5 Closed Jackson Networks -- 4.5.1 Traffic Equation -- 4.5.2 Global Balance Equation-Solution -- 4.5.3 Normalization Constant-Convolution Algorithm -- 4.5.4 Extension to the Infinite Server Case -- 4.5.5 Mean Value Analysis of Closed Chains -- 4.5.6 Application to General Networks -- 4.6 BCMP Networks -- 4.6.1 Overview of BCMP Networks -- 4.6.2 Single Node-Exponential Server -- 4.6.3 Single Node-Infinite Server.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note	4.6.4 Single Node-Processor Sharing -- 4.6.5 Single Node-Last Come First Served (LCFS) -- 4.7 Networks of BCMP Queues -- 4.7.1 Store-and-Forward Message-Switched Nodes -- 4.7.2 Example: Window Flow Control-A Closed Network Model -- 4.7.3 Cellular Radio -- References -- Exercises -- 5 Markov Chains: Application to Multiplexing and Access -- 5.1 Time-Division Multiplexing -- 5.2 The Arrival Process -- 5.2.1 Packetization -- 5.2.2 Compound Arrivals -- 5.3 Asynchronous Time-Division Multiplexing -- 5.3.1 Finite Buffer -- 5.3.2 Infinite Buffer -- 5.4 Synchronous Time-Division Multiplexing -- 5.4.1 Application of Rouche's Theorem -- 5.4.2 Calculations Involving Rouche's Theorem -- 5.4.3 Message Delay -- 5.5 Random Access Techniques -- 5.5.1 Introduction to ALOHA -- 5.5.2 Analysis of Delay -- References -- Exercises -- 6 The M/G/1 Queue: Imbedded Markov Chains -- 6.1 The M/G/1 Queue -- 6.1.1 Imbedded Markov Chains -- 6.1.2 Distribution of Message Delay: FCFS -- 6.1.3 Residual Life Distribution: Alternate Derivation of the Pollaczek-Khinchin Formula -- 6.1.4 Variation for the Initiator of a Busy Period -- 6.1.5 Busy Period of the M/G/1 Queue -- 6.2 The G/M/1 Queue -- 6.3 Priority Queues -- 6.3.1 Preemptive Resume Discipline -- 6.3.2 L-Priority Classes -- 6.3.3 Nonpreemptive Priorities -- 6.4 Polling -- 6.4.1 Basic Model: Applications -- 6.4.2 Average Cycle Time -- 6.4.3 Average Delay: Exhaustive, Gated, and Limited Service -- References -- Exercises -- 7 Fluid Flow Analysis -- 7.1 On-Off Sources -- 7.1.1 Single Source -- 7.1.2 Multiple Sources -- 7.2 Infinite Buffers -- 7.2.1 The Differential Equation for Buffer Occupancy -- 7.2.2 Derivation of Eigenvalues -- 7.2.3 Derivation of the Eigenvectors -- 7.2.4 Derivation of Coefficients -- 7.3 Finite Buffers -- 7.4 More General Sources -- 7.5 Analysis: Leaky Bucket -- 7.6 Equivalent Bandwidth.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note	7.7 Long-Range-Dependent Traffic -- 7.7.1 Definitions -- 7.7.2 A Matching Technique for LRD Traffic Using the Fluid Flow Model -- References -- Exercises -- 8 The Matrix Geometric Techniques -- 8.1 Introduction -- 8.2 Arrival Processes -- 8.2.1 The Markov Modulated Poisson Process (MMPP) -- 8.2.2 The Batch Markov Arrival Process -- 8.2.3 Further Extensions -- 8.2.4 Solutions of Forward Equation for the Arrival Process -- 8.3 Imbedded Markov Chain Analysis -- 8.3.1 Revisiting the M/G/1 Queue -- 8.3.2 The Multidimensional Case -- 8.3.3 Application of Renewal Theory -- 8.3.4 Moments at Message Departure -- 8.3.5 Steady-State Queue Length at Arbitrary Points in Time -- 8.3.6 Moments of the Queue Length at Arbitrary Points in Time -- 8.3.7 Virtual Waiting Time -- 8.4 A Matching Technique for LRD Traffic -- 8.4.1 d MMPPs and Equivalents -- 8.4.2 A Fitting Algorithm -- Appendix 8A: Derivation of Several Basic Equations Used in Text -- Appendix 8B: Derivation of Variance and Covariance Functions of Two-State MMPP -- References -- Exercises -- 9 Monte Carlo Simulation -- 9.1 Simulation and Statistics -- 9.1.1 Introduction -- 9.1.2 Sample Mean and Sample Variance -- 9.1.3 Confidence Intervals -- 9.1.4 Sample Sizes and Run Times -- 9.1.5 Histograms -- 9.1.6 Hypothesis Testing and the Chi-Square Test -- 9.2 Random-Number Generation -- 9.2.1 Pseudorandom Numbers -- 9.2.2 Generation of Continuous Random Variables -- 9.2.3 Discrete Random Variables-General Case -- 9.2.4 Generating Specific Discrete Random Variables -- 9.2.5 The Chi-Square Test Revisited -- 9.3 Discrete-Event Simulation -- 9.3.1 Time-Driven Simulation -- 9.3.2 Event-Driven Simulation -- 9.4 Variance Reduction Techniques -- 9.4.1 Common Random-Number Technique -- 9.4.2 Antithetic Variates -- 9.4.3 Control Variates -- 9.4.4 Importance Sampling -- References -- Exercises -- Index.
520 ## - SUMMARY, ETC.
Summary, etc	This book covers at an advanced level mathematical methods for analysis of telecommunication networks. The book concentrates on various call models used in telecommunications such as quality of service (QoS) in packet-switched Internet Protocol (IP) networks, Asynchronous Transfer Mode (ATM), and Time Division Multiplexing (TDM). Professionals, researchers, and graduate and advanced undergraduate students of telecommunications will benefit from this invaluable guidebook.
588 ## - SOURCE OF DESCRIPTION NOTE
Source of description note	Description based on publisher supplied metadata and other sources.
590 ## - LOCAL NOTE (RLIN)
Local note	Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2018. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element	Telecommunication systems.
655 #4 - INDEX TERM--GENRE/FORM
Genre/form data or focus term	Electronic books.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Babu, Thimma V. J. Ganesh.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Ganesh Babu, Thimma V. J.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text	Print version:
Main entry heading	Hayes, Jeremiah F.
Title	Modeling and Analysis of Telecommunications Networks
Place, publisher, and date of publication	Hoboken : John Wiley & Sons, Incorporated,c2004
International Standard Book Number	9780471348450
797 2# - LOCAL ADDED ENTRY--CORPORATE NAME (RLIN)
Corporate name or jurisdiction name as entry element	ProQuest (Firm)
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier	<a href="https://ebookcentral.proquest.com/lib/buse-ebooks/detail.action?docID=175986">https://ebookcentral.proquest.com/lib/buse-ebooks/detail.action?docID=175986</a>
Public note	Click to View

No items available.