Home > Communications Protocols > Wireless Connectivity

[ pdf ] DATA NETWORKS - Queing Data Networks

DATA NETWORKS - Queing Data Networks Download
Topic under  Wireless Connectivity
Source: ee.sharif.edu 
File size: 3.93 MB
File type: pdf
Last download on: Thu Apr 12, 2018 04:27:34 AM
Short Desciption:
DATA NETWORKS Dimitri Bertsekas Robert Gallager Massachusetts Institute of Technology, Throughout the book, major concepts and principles are first explained in a simple non-mathematical way. This is followed by careful descriptions of modelling issues and then by mathematical analysis. Finally, the insights to be gained from the analysis are explained and examples are given to clarify the more subtle issues. Figures are liberally used throughout to illustrate the ideas. For lowerlevel courses, the analysis can be glossed over; this allows the beginning and intermediate-level to grasp the basic ideas, while enabling the more advanced student to acquire deeper understanding and the ability to do research in the field.

Chapter 1 provides a broad introduction to the subject and also develops the layering concept. This layering allows the various issues of data networks to be developed in a largely independent fashion, thus making it possible to read the subsequent chapters in any desired depth (including omission) without seriously hindering the ability to understand other chapters. Chapter 2 treats the two lowest layers of the above layering. The lowest, or physical, layer is concerned with transmitting a sequence of bits over a physical communication medium. We provide a brief introduction to the subject which will be helpful but not necessary in understanding the rest of the text. The next layer, data link control, deals with transmitting packets reliably over a communication link. Section 2.4, treating retransmission strategies, should probably be covered in any course, since it brings out the subtleties, in the simplest context, of understanding distributed algorithms, or protocols. Chapter 3 develops the queueing theory used for performance analysis of multiaccess schemes (Chapter 4) and, to a lesser extent, routing algorithms (Chapter 5). Less analytical courses will probably omit most of this chapter, simply adopting the results on faith. Little's theorem and the Poisson process should be covered however, since they are simple and greatly enhance understanding of the subsequent chapters. This chapter is rich in results, often developed in a far simpler way than found in the queueing literature. This simplicity is achieved by considering only steady-state behavior and by sometimes sacrificing rigor for clarity and insight. Mathematically sophisticated readers will be able to supply the extra details for rigor by themselves, while for most readers the extra details would obscure the line of argument. Chapter 4 develops the topic of multiaccess communication, including local area networks, satellite networks, and radio networks. Less theoretical courses will probably skip the last half of section 4.2, all of section 4.3, and most of section 4.4, getting quickly to local area networks and satellite networks in section 4.5. Conceptually, one gains a great deal of insight into the nature of distributed algorithms in this chapter. Chapter 5 develops the subject of routing. The material is graduated in order of increasing difficulty and depth, so readers can go as far as they are I Preface comfortable. Along with routing itself, which is treated in greater depth than elsewhere in the literature, further insights are gained into distributed algorithms. There is also a treatment of topological design and a section on recovery from link failures. Chapter 6 deals with flow control (or congestion control as it is sometimes called). The first three sections are primarily descriptive, describing first the objectives and the problems in achieving these objectives, second, some general approaches, and finally, the ways that flow control is handled in several existing networks. The last section is more advanced and analytical, treating recent work in the area. A topic that is not treated in any depth in the book is that of higher-layer protocols, namely the various processes required in the computers and devices using the network to communicate meaningfully with each other given the capability of reliable transport of packets through the network provided by the lower layers. This topic is different in nature than the other topics covered and would have doubled the size of the book if treated in depth.
Bookmark or share this info on Google+ and leave comment at below :

Bookmark and Share

People who downloaded this also viewed in this sites:

Data Networks Flow Control
Second Edition Data Networks DIMITRI BERTSEKAS Massachusetts Institute of Technology ROBERT GALLAGER Massachusetts Institute of Technology, 6.1...

Mobile Networks Tutorial
The wireless industry has grown dramatically in the past 10 years, surpassing the number of wireline subscribers since 2001. Subscribers are giving...

Routing in Data Networks
We have frequently referred to the routing algorithm as the network layer protocol that guides packets through the communication subnet to their...

    Leave comment :
    "DATA NETWORKS - Queing Data Networks"



    Related Free Files

    WIRELESS COMMUNICATIONS... - Download: 289 times
    Routing in Data Networks... - Download: 87 times
    A Guide to Wireless Networking and... - Download: 81 times
    Algorithms For Wireless Sensor Networks... - Download: 98 times
    Hacking Wireless Networks for Dummies... - Download: 219 times
    Point-to-Point Protocols and Links... - Download: 173 times
    Energy and Utility Optimization in Wireless... - Download: 131 times
    Introduction to Wireless Communication... - Download: 355 times
    Wireless Networking in the Developing World... - Download: 83 times
    Fundamentals of Wireless Communications... - Download: 480 times

    eXTReMe Tracker