ch01-flow_cl - CNASSUPCOM Engineering of Engineering...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
  1 Engineering of Engineering of Telecommunication and Telecommunication and Computer Networking Computer Networking Master,                                                                  SUPCOM   F 2006 Master,                                                                  SUPCOM   F 2006 CNAS                                                      SUPCOM CNAS                                                      SUPCOM
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  2 Summary 1. Traffic Control 2. Error control 3. Routing 4. Multiple Access Control 5. Traffic management 6. Switching 7. Signalling 8. Transport functions
Background image of page 2
  3 Chapter I Traffic Control Engineering of Telecommunication and Computer Engineering of Telecommunication and Computer Networking Networking Master, SUPCOM F 2006 Master, SUPCOM F 2006
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  4 Introduction: Flow control problem Consider a  file transfer : Sender sends a stream of  packets representing segments of a file Sender should try to cope with the rate at which  receiver and network can process data Sender Cannot send too slow (can waste time) or too  fast (can lead to buffer overflow) How to find the correct rate? Considerations: Simplicity, Overhead, Scaling,  Fairness, Stability. 
Background image of page 4
  5 Classification of controls Open loop Source describes its desired flow rate Network  admits  call Source sends at this rate Closed loop Source monitors available service rate (Explicit or implicit) Source sends at this rate Due to speed and delay, errors may occur Hybrid Source asks for some minimum rate, but can send more,  if available
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  6 Open loop flow control Two phases to flow Call setup Data transmission Call setup Network prescribes parameters User chooses parameter values Network admits or denies call Data transmission User sends within parameter range Network  polices  users and traffic Scheduling policies give user Quality of Service
Background image of page 6
  7 Hard problems Choosing a descriptor at a source Choosing a scheduling discipline at intermediate  network elements Admitting calls so that their performance  objectives are met ( call admission control ). Traffic descriptors: Three uses Basis for traffic contract Input to regulator Input to policer
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  8 Descriptor requirements Representativity: adequately describes flow, so that network does not reserve too little or too much resource Verifiability: verify that descriptor holds Preservability: Does not change inside the network Usability: Easy to describe and use for admission
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 33

ch01-flow_cl - CNASSUPCOM Engineering of Engineering...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online