Optimal Routing View routing as a “global” optimization problem Assumptions: – The cost of using a link is a function of the flow on that link

FLOW CONTROL QuickTime™ and a GIF decompressor are needed to see this picture. QuickTime™ and a Photo - JPEG decompressor are needed to see this picture. LIDS Flow control: end-to-end mechanism for regulating traffic between source and destination

DestinationAddress Output port number or VC number A packet switch consists of a routing engine (table look-up), a switch scheduler, and a switch fabric

Service times M/G/1 General independent Poisson arrivals at rate λ Service time has arbitrary distribution with given E[X] and E[X2] – Service times are independent and identically

RESERVATION SYSTEMS Single channel shared by multiple users Only one user can use t he channel at a time

Multiple Access Shared Transmission Medium a receiver can hear multiple transmitters a transmitter can be heard by multiple receivers the major problem with multi-access is allocating the channel between the users; the nodes do not know when the other nodes

Fundamental aspects of network Design and Analysis: – Architecture Layering Topology design – Protocols Pt.-to-Pt. Multiple access End-to-end

Outline Governing Equation Stability Analysis 3 Examples Relationship between σ and λh Implicit Time-Marching Scheme

Finite Difference Problem Definition Formulas

1 Scalar Conservation laws 1.1 Definit 1.1.1 Conservative form