A Dynamic Throughput Improvement Scheme with Priority

Queues in Differentiated Services Networks

 88
2


()

() A Dynamic Throughput Improvement Scheme with Priority

Queues in Differentiated Services Networks

Chi
8731658

79
()
()
() Tseng
() Fang-Geng
()
() Tsang-Ling Sheu
()
()
()
() Differentiated Services
() Self-Adaptive Control
() Dynamic Throughput

(Differentiated Services, Diffserv)

(End-to-End)(Quality of Services, QoS)
(Self-Adaptive Control
Scheme)

EF
PHB
TCP/IP
(Self-Adaptive Control Messages)

NS-2

 EF
EF
EF
Random Early
Detection (RED) EF PHB EF

Differentiated-Service networks is designed for solving scalability problems

through traffic aggregation. However, it can't guarantee end-to-end QoS of
individual flow. In this thesis, we propose a Self- Adaptive Control Scheme for
Differentiated-Service networks that can improve the throughput of individual flows
dynamically. In this scheme, egress routers monitor the average throughput of
individual flow, and send the Self-Adaptive Control Messages to ingress routers if
need. The ingress router re-allocate network resources to improve throughput of
high-priority flows depending on the Control Messages.
We use NS-2 simulator to prove that our scheme that can improve throughput
of high-priority flows dynamically, and suggest that a better time interval of
Self- Adaptive control can be determined based on the queue sizes, packets arrival
rate and departure rate. Finally, we use Random Early Detection (RED) queue
instead of Drop-Tail queue to reduce unfairness of individual flows when there are
congestion and insufficient network resources.

(Differentiated Services, Diffserv)

(End-to-End)(Quality of Services, QoS)
(Self-Adaptive Control Scheme)

EF
PHB
TCP/IP
(Self-Adaptive Control Messages)

NS-2
EF
EF
EF
Random Early Detection (RED)
EF PHB EF

Abstract

Differentiated-Service networks is designed for solving scalability problems

through traffic aggregation. However, it can't guarantee end-to-end QoS of individual
flow.

In

this

thesis,

we

propose

Self- Adaptive

Control

Scheme

for

Differentiated-Service networks that can improve the throughput of individual flows

dynamically. In this scheme, egress routers monitor the average throughput of
individual flow, and send the Self- Adaptive Control Messages to ingress routers if
need. The ingress router re-allocate network resources to improve throughput of
high-priority flows depending on the Control Messages.
We use NS-2 simulator to prove that our scheme that can improve throughput of
high-priority flows dynamically, and suggest that a better time interval of
Self- Adaptive control can be determined based on the queue sizes, packets arrival rate
and departure rate. Finally, we use Random Early Detection (RED) queue instead of
Drop-Tail queue to reduce unfairness of individual flows when there are congestion
and insufficient network resources.

Keywords :

Differentiated Services, Self-Adaptive Control, Dynamic Throughput,

Priority Queue, Quality of Services (QoS)

1.1 1
1.2 1
1.3 2

2.1 (Integrated Service, Intserv) 4

2.2 (Differentiated Service, Diffserv) 6
2.2.1IPv4/IPv6 (Diffserv Field) 8
2.2.2 11
2.2.3 20
2.3 21
2.3.1 (Packet-Marking Engine, PME)22
2.3.2 (Feedback Controlled Diffserv)23
2.3.3 MPLS 24
2.3.4 26
2.4 30

31

3.1 31
3.2 34
3.3 36
3.4 39
3.5 EF PHB 40

43

4.1 NS-2 43
4.2 NS-2 45
4.3 47
4.4 48
4.5 49

69

5.1 69
5.2 70

73

76


Figure 2.1

RSVP signaling

Figure 2.2

DS field in IPv4 header 9

Figure 2.3

DS field in IPv6 header 9

Figure 2.4

Differentiated Services Architecture 11

Figure 2.5

Major Func tional Blocks of a Diffserv Router 12

Figure 2.6

Logical View of a Classifier and Traffic Conditioner 13

Figure 2.7

RED and RIO algorithms 18

Figure 2.8

A DS-compliant LSR architecture 25

Figure 2.9

RSVP Signaling with Differentiated Services 27

Figure 3.1

Major Functional Blocks of a Self- Adaptive Diffserv Router 32

Figure 3.2

Differentiated Services Architecture with Self-Adaptive Capability 34

Figure 3.3

Self- Adaptive Control Message Format 36

Figure 3.4

Self- Adaptive Controller in a Diffserv Boundary Router 39

Figure 3.5

Self- Adaptive Algorithm for EF PHB 42

Figure 4.1

NS-2 for Network Topology Simulation 44

Figure 4.2

Hierarchical NS-2 simulator 44

Figure 4.3

DSNode and Diffserv Simulation Diagram 46

Figure 4.4

Differentiated Services Class Hierarchy 46

Figure 4.5

New Self- Adaptive DSNode 48

Figure 4.6

Network Topology used in Simulation 48

Figure 4.7

Simulation 1-1 & 1-2Throughput Comparisons between PHBs 51

Figure 4.8

EF Queue Drop Ratio at Routers(R0~R2) 52

Figure 4.9

Simulation 2-1 & 2-2Throughput Comparisons between PHBs 54

Figure 4.10

Simulation 2-1 & 2-2Throughput Comparisons for EF Flows 56

Figure 4.11

Remarked EF Packets through DS Traffic Conditioner 57

Figure 4.12

Throughput Comprisons for EF Flows with N=0, 60 and 500 sec 59

Figure 4.13

Simulation 3-2Throughput Comprisons for EF Flows (N= 500 sec) 60

Figure 4.14

Simulation 3-1EF Queue Length and Drop Ratio (Queue Size = 3750
Packets) 63

Figure 4.15

Simulation 3-1EF Queue Length and Drop Ratio (Queue Size = 7500
Packets) 64

Figure 4.16

Simulation 3-1EF Queue Length (Queue Size = 3750 Packets) 65

Figure 4.17

Simulation 3-1EF Queue Length (Queue Size = 7500 Packets) 65

Figure 4.18

Simulation 2-2Throughput Comparisons for EF Flows 68

Figure 4.19

Simulation 4Throughput Comparisons for EF Flows 68

Table 2.1

The DSCP Field of IANA Considerations 10

Table 2.2

Recommended Codepoints of AF PHB Group 16

Table 2.3

Assured / Expedited / Default Forwarding PHB Group 17

Table 2.4

Comparison of Various Differentiated Services Architectures 29

Table 3.1

Control Packet Type (CPT) Field 37

Table 3.2

Recommended Self- Adaptive Information Field 38

1.1

(Quality of Services, QoS)IETF

Per-class QoS (Differentiated Services, Diffserv)[7]

(Integrated services, Intserv)[2]

(End-to-End)
(Self-Adaptive Control Scheme)

1.2

TCP/IP IP (DS fields)

CU TCP (Reserved)

(Throughput)(Traffic Profile)

(Boundary Nodes)

NS-2[23][24]

Random Early Detection

(RED)[29] EF PHB

1.3

(Intserv)(Diffserv)

NS-2
NS-2
NS-2

(Quality of Services, QoS)

(Internet)
(Packet Switching)

(Circuit Switching)
(Guarantees of QoS)
Over-ProvisioningPriorityPer-Flow Per-Class

(priority levels)

(flow)
IETF
(Integrated Service, Intserv)[2]

(Scalability)
( Edge Router)(Classification)
(Core Network)
3

 IETF
(Differentiated Services, Diffserv)[6]
(Intserv)

2.1 (Integrated Service, Intserv)

IETF (Internet Engineering Task Force) RFC 1663
(Integrated Services)(Resource Reservation Protocol, RSVP)
[2]
(set up paths)(reserve
bandwidth) RSVP[3]
(signaling protocol)
Best-Effort Service
?? Controlled-Load Service(Enhanced) Best-Effort Service
(reliable)[4]
?? Guaranteed Service(fixed delay bound)[5]

(QoS) RSVP RSVP

(sender) PATH (receiver)
PATH
PATH RESV
RESV RESV
(reject)(accept) RESV

RESV
error error
4


PATH
RESV

(2) PATH

(1) PATH

(3) PATH

RSVP cloud
Receiver

Sender
(6) RESV

Router

(5) RESV

Figure 2.1

Router

(4) RESV

RSVP signaling

?? RSVP (RSVP signaling protocol)

?? (Admission control routine)

?? (Classifier)(Multifield classification)

?? (Packet scheduler)

?? RSVP

??

(scalability)

2.2 (Differentiated Services, Diffserv)

(Edge Router)
(Classification) DSCP(Diffserv Codepoint)
(Core Network)(Core
Router) DSCP

(Terminology)
Behavior Aggregate(BA)
Codepoint
BA
Classifier
(Packet header)
(Behavior Aggregate,
BA)(Multi-Field ,MF)
(DS Field)
(Source
Address)(Source Port)(Destination Address)
(Destination Address)(Protocol ID)

 Class Selector Codepoint

Codepoint (Packet Forwarding)
Codepoint
DS field DSCP Codepoint
PHB(Per-Hop Behavior)
Differentiated Services Boundary
(traffic conditioners)

Differentiated Services Domain

(Autonomous system)(hosts)
(policies)
PHB
Differentiated Services Egress Node

(Egress Node)
Differentiated Services Field
IP (DSCP) IPv4
(Type of Services, TOS) IPv6
(Traffic Class)
Differentiated Services Ingress Node

(Ingress node)
Differentiated Services Interior Node

 Differentiated Services Node

Diffserv
Differentiated Services Region

(Diffserv)

2.2.1 IPv4/IPv6 (Diffserv Field)

IP
IP IETF
RFC 2474[6] IETF RFC 2460[8]
IPv6 (Internet Protocol, version 6)IETF
IPv4 IPv6 IPv4
(Type of Services, TOS)
(Diffserv Field)
(Diffserv Codepoint, DSCP)
(Currently Unused, CU) IPv6
(Traffic Class) IETF IPv4 IPv6
TOS Traffic Class

IP

Bit 0

DSCP

version

length

CU

8-bit TOS

16-bit total length (in bytes)

16-bit identification
8-bit TTL

flags

13-bit fragment offset

8-bit protocol

16-bit header checksum

32-bit source IP address

32-bit destination IP address

Figure 2.2
2.1 DS field in IPv4 header
Bit 0

DSCP

version

7
CU

8-bit Traffic Class

20-bit Flow Label

16-bit Payload Length

Next Header

Hop Limit

128-bit source IP address

128-bit destination IP address

Figure 2.3 DS field in IPv6 header

RFC 791 [9] IPv4 TOS
IP (precedence bits)
IP DSCP IP
IP

 DSCP (PHB)
(Mapping Table)
DSCP PHB
PHB DSCP
PHB PHB(Default PHB)
DSCP IETF DSCP 000000
PHBDSCP 000000 PHB Best-Effort
DSCP PHB
PHB IETF DSCP PHB
PHB
IP
DSCP PHB IP
PHB IP
DSCP xxx000 PHB IP
(000000 ~ 111000) Codepoint Class
Selector Codepoints Class Selector Codepoints 000000
PHB DSCP DSCP
64 PHB IANA(Internet Assigned Numbers Authority) 64
Codepoints Table 2.1

Pool

Codepoint space

Assignment Policy

xxxxx0 (32)

Standards Action

xxxx11 (16)

Experimental/Local Use

xxxx01 (16)

Experimental/Local Use (*)

(*) may be utilized for future Standards Action Allocations as necessary

Table 2.1 The DSCP Field of IANA Considerations
10

2.2.2

(Diffserv Region)
(Diffserv Domain)
(Boundary Nodes)

(Interior)(Core)

(source)(destination)
(Upstream Domain)
(Downstream Domain)
(Boundary Node)(Ingress Node)
(Egress Node)

Figure 2.4
DS Egress
Boundary
Router

DS
Domain
Edge
Router
DS Core Router

DS Domain
DS
Domain
Source

Edge
Router

DS Ingress
Boundary
Router

Differentiated Services Region

Figure 2.4 Differentiated Services Architecture
11

Destination


DSCP
PHB (Traffic Profile)
PHB

Figure 2.5 [10]

Management

SNMP,
COPS
etc.

Diffserv
Configuration &
Management
Interface

ta
Ingress Interface
(classify, meter,
action, queueing)
Traffic
Conditioning

Data in

QoS control
messages

Routing
Core

Egress Interface
(classify, meter,
action, queueing)
PHB

Data out

QoS Agent
(optional)
(e.g. RSVP)

Figure 2.5 Major Functional Blocks of a Diffserv Router

(Ingress)(Egress Interface) Traffic Classifiers

Traffic Conditioning (TC) components Queueing components
Diffserv (operating parameters)
(monitored parameters)(provisioned parameters)
Diffserv Configuration and Management Interface
(DS Service Levels)

Traffic Conditioning Specifications (TCSs)

12

(primarily classification
rules)(TC) PHB (configuration parameters)
SNMPCOPS
(DS Configuration and Management Interface)
QoS Agent QoS Agent (snoop)
(per-microflow)(per-flow-aggregate)
(signaling) RSVP RSVP
messages RSVP
DS RSVP
DS RSVP

2.5
(Classifier)(Conditioner)
(Ingress Interface)
(routing core)

Domain
Boundary

Traffic Conditioner

Meter

Packets

Classifier

Marker

Shaper/
Dropper

Classified
Packets

Figure 2.6 Logical View of a Classifier and Traffic Conditioner

13

(Service
Level Agreements, SLA) SLA (re-marking)

SLA SLA (Traffic Profiles)

(TC)
(temporal properties)
in-profile out-of-profile

codepoint = X, use token-bucket r, b

r b token rate burst size DSCP X
In-Profile
Out-of-Profile In-Profile DS
Out-of-Profile
In-Profile(shaped)(policed)
(re-marked) DSCP
In-Profile Out-of-Profile

(Diffserv Field) DSCP

(Behavior Aggregate, BA) PHB
IETF PHB(Default
Forwarding, DF) PHB(Assured Forwarding, AF) PHB
(Expedited Forwarding, EF) PHB1998 IETF RFC2597[11] RFC
2598[12] AF EF PHB[11][12] DSCP
(DF) PHB Best-Effort
Best- Effort
14


PHB DSCP 000000
RFC 2598[12](EF) PHB DSCP 101110EF
PHB (low packet loss)(low packet latency)
(low delay jitter)(endpoint)
(Virtual Leased Line)
(Premium Service) EF PHB

(queue) EF PHB (no queues)

Aggregated Maximum Arrival Rate Aggregated Minimum Departure Rate

EF PHB Maximum Arrival Rate
Minimum Departure Rate EF

RFC 2597[11](Assured Forwarding, AF) PHB Group

(class) class (drop precedence)

AFij i j AF PHB 1 i N1
j M RFC N = 4 M = 3 AF PHB Group

AF11AF13 AF21 AF PHB AF11 AF21

AF11 AF13 AF13
AF PHB DS
15

 PHB
AF
(microflow)(reordering)
AF PHB Group DSCP Table 2.2

Class 1

Class 2

Class 3

Class 4

Low Drop Precedence

010000

011000

100000

101000

Medium Drop Precedence

010010

011010

100010

101010

High Drop Precedence

010100

011100

100100

101100

Table 2.2

Recommended Codepoints of AF PHB Group

DS AF PHB
(buffer space)
AF PHB

PHB (QoS)

AF PHB
SLA (bit rate) In-Profile
Out-of-Profile SLA
In-Profile packets Out-of-Profile packets In
Out RIO(Random Early Detection with In/Out bit)[31]
(Assured Queue)Table 2.3 PHB

16

DF (Default
EF (Expedited
AF (Assured Forwarding)

Forwarding,
Forwarding)
Best-effort)

Recommended
DSCP

AF1

AF3

AF3

AF4

Low

010000

011000

100000

101000

Med.

010010

011010

100010

101010

High

010100

011100

100100

101100

101110

Traffic Control

000000

Classification, marking,
Classification, marking, RED/ERED/RIO

FIFO
priority/CBQ/WFQ/WRR

scheduling

scheduling
scheduling

Non-conforming
Remark

Drop

Olympic service (gold, silver, bronze),4

Premium service/Virtual

class, 3 drop precedence each class

Leased Line Service

Just Forward

Traffic
Characteristic

None

Table 2.3 Assured / Expedited / Default Forwarding PHB Group

Table 2.3 AFEF DE(BE) PHB DSCP IETF

PHB (Traffic Control)
AF PHB RED(Random Early Detection) [29]
RIO(RED with In/Out bit)[31] ERED(Enhanced RED)[34] EF PHB
WRR(Weighted Round-Robin)[36]CBQ(Class-Based Queue) [32] [33]
WFQ(Weighted Fair Queue)[35]

RED[29](threshold) Maximum
Threshold (Max th ) Minimum Threshold(Minth )
(Average Queue Size, avg) avg < Minth
Minth avg < Max th (Congestion Avoidance Phase)
avgMinth Max th (Marking Probability, Pmax ) Pmax
(Mark)
avg Max th (Congestion Control Phase)
17

ERED[34] Minth Max th Unmark

Minth avg < Max th Unmark avg < Minth
Unmark
Mark
RIO[31] RED RED
Minth Max th In Packet Out Packet
In Packet RIO In
avg_in Out Packet In/Out
avg_totalIn avg_inMinth _in Max th _in Out
avg_totalMinth _out Max th _out Minth _out
Minth _in Max th _out Max th _in Pmax _out Pmax_in
Out P_out
avg_total Max th _out Out
In
Figure 2.7 RED RIO
P (Drop)

P (Drop)

P max _out
P max

Min th

Maxth

P max_in

avg

Min th_out
Maxth_out
Minth_in
Maxth_in

RED

avg_in /
avg_total

RIO

Figure 2.7 RED and RIO algorithms

Priority

18

(resources starvation)CBQ[32][33](Class)

Priority

WFQ[35](flow)
(sorting)(reordering)
Per-Flow Queues
(Weight)
WFQ
(flow)

Byung G. Kim Bo-Kyoung Kim[36] WRR

(sequential service slots)
(service turn)
(weight)

Round-Robin
WFQ WRR

19

2.2.3
(Intserv) RSVP
Requirement Spec(Rspec) Traffic Spec (Tspec)
RSVP
(complexity)(scalability)

per-class
(QoS)(throughput)

IP IP TCP
UDP
TCP
TCP window size UDP
PHB
TCP
PHB TCP
TCP RTT(round-trip time) RTT
ACK TCP window size
TCP
RTT TCP

(non-adaptive)

20

 EF PHB EF
EF PHB VoIP
[13] EF PHB

VoIP

2.3
(Intserv networks)

2.3.1 (Packet-Marking Engine, PME)

W.-C. Feng, D.D. Kandlur, D. Saha, and K.G. Shin[14] 1999
end-to-end throughput

?? 1-bit priority (High priority)

(Low priority)
(lose rate)
?? (network providers)

?? TCP
??
(Control Engine)
21

(Packet-Marking Engine, PME)(host network

interface) PME (Minimum
Service Rate) PME DSCP
)
(re- mark)
(Packet Marking Probability, mprob)
mprob

TCP
TCP-like algorithm (mprob) TCP congestion
window size (cwnd) RTT

marked unmarked TCP (Congestion Control)

TCP Congestion Control
TCP (Source Node)

(Drop Probabilities) ERED

(Enhanced Random Early Detection)

1-bit Priority
6-bits DSCP
UDP TCP Congestion Window

TCP PME

22

2.3.2 (Feedback Controlled Diffserv)

Hungkei (Keith) Chow [15] 1999 IETF Internet Draft
Feedback Controlled
Diffserv(FC-DS)

?? FC-DS (Ingress node)

1. Adaptive TC(ATC)(TC)
2. Probe Control Packet DS Domain
per-flow per-boundary node Probe Control Packet

?? FC-DS (Interior node)

1.
2. probe/report control packet
probe/report
?? FC-DS (Egress node)
1. probe control packet
2. probe control packet report
packet
3. FC-DS (ATC)
(TC)
4. report packet
(receiver control)(QoS monitoring)
report packet
PHB
23

 report packet
(shaping) Token bucket soft random
discard (Adaptive Traffic Profile)

(microflow)FC-DS
(ATC) report packet
PHB RTT
report packet

2.3.3 MPLS
I. Andrikopoulos G. Pavlou [20] 1999 MPLS [18][19]
F.L. Faucheur [21] 2000 Internet Draft
MPLS
PHB MPLS
(signaling) Label
(, BA)
MPLS (Forwarding
Equivalence Class, FEC)(Label Switched Path, LSP)
FEC FEC element FEC element
IP (traffic stream) LSP
MPLS MPLS
DSCP LSP (Egress LSR)
24

DSCP value/PHB LSP n (classes)

MPLS m LSR n*m LSP m
FECs FEC n (labels) Behaviour
Aggregate (BA) SelectorBA Egress LSR
LSP LSP LSP
LSP BA ( DSCP) Diffserv
label table FEC element Figure 2.8
(Label Switch Router, LSR) Diffserv
Module PHB ATM (QoS
Parameters)LDP Daemon BA
LDP LSP LSR MPLS
Daemon Layer 2 Layer 3
MPLS
Switch Controller
Diffserv
Module

Routing
Daemon

Flow MIB

LDP Daemon DS-compatible

MPLS
Daemon

Flow MIB
Controller

TCP/UDP IP

GSMP
Interface

Admission
Control

PHB

Mapper
PHB-to-ATM

LDP Session to LDP peer

ATM Driver

ATM Switch

Figure 2.8 A DS-compliant LSR architecture

25

ATM
MIB

 MPLS
MPLS

2.3.4
(Intserv) RSVP end-to-end (per-flow)

Per-Aggregate (Per-Class)

IETF [17]
RSVP IETF DCLASS
(object)[16] RSVP (RSVP message object)
DSCP RSVP
RSVP
(edge nodes)(boundary nodes) RSVP

RSVP
RSVP RSVP

Figure 2.9

26

DS domain
(transit network)

End-user domain
(stub network)

End-user domain
(stub network)

Edge Router

? RSVP signaling
? Intserv parameters
? Traffic Shaping
? Packet Marking

Edge Router
Boundary Routers

? Aggregate Policing (BA)

? Diffserv PHB
? Carries RSVP message
"Transparently"

Figure 2.9 RSVP Signaling with Differentiated Services

(mapping)
?? Default Mapping Intserv service type DSCP
well-defined mapping
?? Network Driven Mapping
RSVP Default well-defined mapping

Network Driven Mapping

end-to-end flows

??
?? RSVP
?? Bandwidth Broker

RSVP
27

RSVP RSVP RSVP

RSVP
RESV RESV
RESV (Intserv)
(Diffserv) PHB RESV
PHB DSCP RSVP
end-to-end

Table 2.4

28

Adaptive PME [14]

Features

??
??
??
??
??
??

New Packet-Marking Engine

Source Transparent Marking
Source Integrated Approach

FC-DS [15]
?? New FC-DS nodes
?? Probe/Report control packet
?? Adaptvie QoS

TCP-like algorithm
Modified TCP congestion control
Dynamic Marking
probability(mprob)

?? Each priority with separately drop

DS in MPLS [20][21]

RSVP in DS [16][17]

?? New Switch Controller

?? New DCLASS object in RSVP
?? MPLS and Diffserv Mapping ?? New role of edge/boundary
nodes
?? Modified MPLS signaling and
LDP
?? Default mapping/Network
driven mapping
?? Modified Label Table
?? LSPs merging
?? Static/dynamic resources
provision
?? Request/Allocation for
BW/Label
?? RSVP signaling in Diffserv

probability for ERED algorithm

Advantages

?? TCP-friendly algorithms
?? Current network status report
?? MPLS and Diffserv networks
integration
?? Adative packet marking to improve ?? Adative traffic conditioning
end-to-end throughput
?? Fair network resources allocation ?? End-to-end QoS
?? Traffic fairness
?? 1-bit priority for packet marking
?? Support TCP traffic only
?? Update network interface in

Disadvantages

host/nodes

?? More scalability than pure

Intserv network

?? End-to-end QoS
?? Dynamic resources allocation

?? Upgrade DS nodes to support FC ?? MPLS nodes must be Diffserv ?? Diffserv nodes must be
scheme

capable

?? More processing complexity in

FC-DS ingress nodes

?? Extra processing of probe control

?? Modified MPLS label table

?? A great quantity of LSPs
establishments

?? Undecided MPLS/Diffserv

packets

arch.

Table 2.4 Comparison of Various Differentiated Services Architectures

29

upgraded

?? Extra RSVP messages

processing in edge nodes

?? Predestined RSVP signaling

2.4

EF

PHB Minimum Departure Rate WRR

EFAF DF PHB
(weight) EF PHB
Minimum Departure Rate
EF
(Average Throughput)
EF Minimum Departure Rate
WRR EF Round-Robin
EF

30

DSCP PHB
DSCP PHB per-aggregate (per-class)

3.1

(Internet Services Provider, ISP)(Network Administrator)

(Service Level Agreements, SLA)
(Traffic Conditioning Agreements, TCA) PHB
PHB
SLA TCA SLA
TCA
ISP

31


(throughput)

(boundary nodes)

Management

SNMP,
COPS
etc.

Diffserv
configuration &
management
interface

ta

Data in

QoS &
self-adaptive
control message

Ingress Interface
(classify, meter,
action, queueing)
Traffic Conditioning

Routing
Core

Self-Adaptive
Controller

Egress Interface
(classify, meter,
action, queueing)
PHB

Data out

QoS &
self-adaptive
control message

Figure 3.1 Major Functional Blocks of a Self-Adaptive Diffserv Router

(QoS and Self-Adaptive Controller)

Igress Interface (metering)(Throughput)
Self- Adaptive Controller

32

Self-Adaptive Diffserv Domain

Self-Adaptive Ingress Node

(self-adaptive control messages)

Self-Adaptive Interior Node

Self-Adaptive Egress Node

(self-adaptive control messages)

33

 Self-adaptive Controller

3.2
(per-domain)

(Diffserv Region)(Domain)

3.2

Destination

(4) Sending Remarked Fow Messages

DS Domain
Edge
Router
DS Egress Boundary
Router

(3) Receiving
Self-Adaptive
control messages
and Re-marking
or Re-allocating
resources

DS Core Router

DS Domain

(1) Metering and Performing

Self-Adaptive Algorithm

DS Ingress
Boundary Router

Edge
Router

DS Domain

(2) Sending Self-Adaptive Control

Messages to Ingress Router if needed

Source

Figure 3.2 Differentiated Services Architecture with Self-Adaptive Capability

34

(1)
(metering) PHB
(SLA)(TCA)

(2)

(3)

(4)
DSCP

PHB
IETF PHB
(Expedited Forwarding, EF) PHB DSCP
(Assured Forwarding, AF) PHB (Default Forwarding,
DF) PHB EF PHB
DSCP
AF
PHB (drop
precedence) AF PHB
AF PHB
EF PHB
DF (BE) PHB AF PHB
(Minimum Rate)
35

3.3
TCP
(Self-Adaptive Control Messages) TCP/IP
IETF IPv4/IPv6
(DS Field) 8-bits TOS(IPv4) 8-bits
Traffic Class(IPv6)[6] DSCP CU
(Currently Unused) CU
Control Packet Type (CPT)
RFC 793 [22] Transmission Control Protocol (TCP) TCP
TCP (Reserved)
DSCP TCP

Figure 3.3
Self-adaptive control message
IP Header

4-bit
version

TCP Header

4-bit
header
length

6-bit Old
DSCP

Other Self-Adaptive Information (optional)

CPT

3-bit
flags

16-bit identification
8-bit time to
live (TTL)

16-bit total length (in bytes)

8-bit protocol

13-bit fragment offset

16-bit header checksum

32-bit source IP address

32-bit destination IP address

IP Header
16-bit source port number

16-bit destination port number

32-bit sequence number

32-bit acknowledgement number
4-bit
header
length

6-bit SAI
(New DSCP)

U A P R
R C S S
G K H T

S
Y
N

F
I
N

16-bit TCP checksum

16-bit window size

16-bit urgent pointer

TCP Header

Figure 3.3

Self-Adaptive Control Message Format

36

 IP 6-bit Old DSCP DSCP

PHB
SLATCA CU CPT (Control
Packet Type)

(Uni-direction)

TCP 6-bit Self-Adaptive Information (SAI)

DSCP
DSCP SAI
PHB CPT

(Classifier)
RFC 2475[7]BA ClassifierMF Classifier
BA (Behavior
Aggregate) DSCP MF (Multi-Field)
IP (Port Number)(Protocol ID)
(DS Field)
CPT Table 3.1
CPT packet type
CPT value

Control Packet Type

00
01

Normal Data Packet

For BA Classification

10

For MF Classification

11

Reserved

Table 3.1

Control Packet Type (CPT) Field

37

(output interface) WRR(Weighted

Round-Robin) PHB (weighted parameter)
PHB
EF PHBAF PHB DF (BE) PHB 1
4 5 1000 PHB
100400 500PHB
SAI
WRR PHB PHB
PHB SAI
PHB Table 3.2 SAI Field

PHB

DSCP Field

SAI Field

Description

EF

101110

0xxxxxx

Increase weight for WRR

EF

101110

1xxxxxx

Decrease weight for WRR

AF

Old DSCP

New DSCP

Change to new DSCP

BE

000000

0xxxxxx

Increase weight for WRR

BE

000000

1xxxxxx

Decrease weight for WRR

Table 3.2

Recommended Self-Adaptive Information Field

IETF PHB
SAI
SAI
Figure 3.3 TCP
TCP (data)

38

3.4

Self- Adaptive Controller (SA Controller)

Self-Adaptive Controller

Figure 3.4
SA Controller

Metering result

Self-Adaptive Processing

Ingress Interface
(classify, meter,
action, queueing)

Egress Interface
(classify, meter,
action, queueing)
Routing
Core

Egress Interface
(classify, meter,
action, queueing)

Ingress Interface
(classify, meter,
action, queueing)

Self-Adaptive
Controller

Self-Adaptive Processing

Metering result

SA control messages (from Egress)

SA control messages (from Egress)

SA control messages (to ingress)

SA control messages (to ingress)

Figure 3.4 Self-Adaptive Controller in a Diffserv Boundary Router

39

(flow)

3.5 EF PHB
EF PHB End-to-End
IETF PHB(Expedited Forwarding,
EF) PHB
(Traffic Profile) EF PHB (Minimum Departure
Rate)(Virtual Leased
Line)(ATM) CBR

WRR (Weight) EF
EF
EF PHB EF PHB
EF PHB
(Default
Forwarding, DF) PHB Best-Effort
DF PHB EF PHB
EF PHB EF PHB

EF PHB

40

 EF PHB

EF PHB EF Traffic
Profile
EF PHB
Figure 3.5 EF PHB
(Traffic Profile) Peak Rate (PRef ) Minimum
Departure Rate (MinRef ) EF PHB EF
Average Throughput (Thref ) MinRef
EF PHB EF
MinRef
DF PHB WRR EF PHB WRR
EF EF PHB
EF DF PHB
EF PHB EF PHB AF PHB
AF DF PHB Minimum Weight
(MinWaf MinWdf) AF DF PHB EF
PHB AF DF PHB (Starvation)
MinWaf MinWdf
AF DF PHB WRR

41

Self-Adaptive Algorithm for EF PHB :

Parameter Definitions :
Peak Rate : PRe f
Minimum Departure Rate : MinR e f
Average Throughput : Thre f
Weight of EF PHB for WRR scheduling : We f
Weight of AF PHB for WRR scheduling : Waf
Weight of DF PHB for WRR scheduling : Wdf
Minimum Weight for AF PHB : MinWaf
Minimum Weight for DF PHB : MinWdf
Weight Increase Scale : Winc (default is 1)
Numbers of Active EF flow : n
Total Bandwidth : BW
Bandwidth Allocation for EF PHB : BWe f

PRef
Thref
MinRef
Thref

IF( MinRef Thref PRef) THEN

// do nothing
ELSEIF ( Thref < MinRef OR BWef < n * MinRef) THEN
// self-adaptive weight estimation
IF ( Winc Wdf) THEN
// preemptive from DF PHB resources
Wef = Wef + Winc, Wdf = Wdf Winc
// send self-adaptive control messages with new Wef
ELSEIF ( Winc Waf) THEN
// preemptive from AF PHB resources
Wef = Wef + Winc, Waf=Waf - Winc
ENDIF
ENDIF

Figure 3.5 Self-Adaptive Algorithm for EF PHB

42

Do nothing

Change
weight for
EF PHB

Network Simulator Version 2 (NS-2)[24]

(Discrete event simulator)UC Berkeley, USC/ISI, LBL Xerox
PARC DARPA (Defense Advanced Research Projects Agency) VINT
(Object-Oriented simulator)
LBNL NS Lawrence Berkeley National Laboratory(LBNL)
Network Research Group
(Programmed Event-Driven Simulation Engine)
NS NS
[23] NS
Otcl (MIT object tcl)[26] TCL
(Tool Command Language)[25]

4.1 NS-2
Network Simulator, NS-2
C++
TCL OTcl
Otcl TCL NS-2

NS-2 C++(Class Hierarchy) Otcl

(interpreter)
(interpreted hierarchy)
(compiled hierarchy)(one-to-one)
OTcl (Script files) Otcl
43


NS-2 C++
OTcl

? Network topology
description
? Simulation parameters
? Configuration parameters
Simulated Network
Topology

User

OTcl Script Files

Interpreter
hierarchy ->
Compiled
hierarchy

Output files or
Monitor Display

Configuration frontend
(OTcl Interpreter)

Simulation
status

NS-2 Simulator

Figure 4.1

NS-2 for Network Topology Simulation

User (Simulation
Topology)
OTcl Script files
OTcl Interpreter
NS-2 (C++ kernel)

Figure 4.2

Hierarchical NS-2 simulator

44

4.2

NS-2
NS-2 [27]

Sean Murphy[28]
NS-2
(Multiple Traffic Classes)(Traffic
Conditioners)(Diffserv Schedulers)
EFAFBE CS
EF AF PHB SLATCA
PHB
(Weight) WRR
NS-2 IP
NS-2
NS-2
NS-2 Figure 4.3
Sean Murphy DS Node
Conditioner Node
NS-2 Figure 4.3
Source DS Node
DS Scheduler Link Source DS Node DS
Scheduler NS-2 Link PHB
DS Node Conditioner DS Profile
PHB DS Profile Conditioner DS
Node PHB
PHB DS Profile
PHB DS Scheduler
DS Node DS Node
45

Conditioner

Node
DSProfile

Conditioner

DSNode
Link

Source

Node

DSScheduler

Figure 4.3

DSNode and Diffserv Simulation Diagram

TclObject

DSQueue

NsObject

DSPacketQueue

Connector

DSREDPacketQueue
Agent

DSRIOPacketQueue

DSScheduler
DS3CPacketQueue
DSSchedulerWRR
DSByteQueue
DS3CScheduler
DS3CSchedulerWRR

Handler

DSConditioner
DSSchedulerHandler
SADSConditioner
DS3CSchedulerHandler
DSRIOClass
DSBBQueueHandler
DSBBQClass
DSRIOQueueHandler
DSProfile
Original Classes

DSPeakRateProfile

Modified Classes for Self-Adaptive Controller

Added Classes for Self-Adaptive Controller

Figure 4.4

Differentiated Services Class Hierarchy

46

Figure 4.4 NS-2 C++

OTcl OTcl
Sean
Murphy[28]

Sean Murphy

4.3

SLATCA
NS-2 Sean Murphy

?? SADS Conditioner Self-Adaptive Node

Control Packet Control Packet WRR

?? IP CPT IP
CU CPT
?? DS Profile CPT

?? DS Scheduler DS 3Cscheduler WRR

?? (Debug)
47


DSNode DSControlAgent

Self-Adaptive
Controloer

Conditioner

OTcl Figure 4.5 Self-Adaptive DSNode

Figure 4.5

Node

New Self-Adaptive DSNode

NS-2 (Interpreted Hierarchy)

(Compiled Hierarchy)
C++ OTcl
OTcl
C++

4.4

NS-2

Figure 4.6
EF 0
AF 3
1

EF

AF

BE

Link : 10 Mbps

BE 6

0 EF

3 AF

EF 1

R0

Link : 3 Mbps

R1

Link : 3 Mbps

R2

Link : 3 Mbps

R3

AF 4
BE 7

6 BE
EF

AF

BE

EF 2
AF 5
BE 8

Figure 4.6

Network Topology used in Simulation

48

(dumb bell) Figure 4.6

R0~R3
R0~R2
PHB
R3 3 Mbps
10 Mbps EF PHB
AF BE PHB
(Background Traffic) PHB
EF PHB

4.5

EF PHB
Figure 4.6 R1 R2
EF BE

Default Weight in WRR

PHB

Data Sending Rate

Configurated Peak Rate

Scheduler

Sim. 1-1

1200kbps (CBR)

1200kbps

EF

1
Sim. 1-2

TCP (FTP)

500kbps

AF

TCP (FTP)

500kbps

BE

TCP (FTP)

EF PHB AF BE PHB

49

 EF PHB
1-1 (Simulation 1-1) EF PHB
1200 kbps UDP AF BE PHB TCP
1-2 EF PHB TCP EF PHB

Figure 4.8 PHB (Throughput) 1-1

EF PHB WRR 1
500
WRR EF
BE
EF BE PHB AF PHB WRR
TCP
AF BE PHB (oscillating)
(Traffic Profile) Configured Peak Rate
WRR PHB
PHB TCP window size
TCP window size
1-2
Figure 4.8 UDP TCP EF

BE
EF PHB
(QoS)

50

kbits/sec

Simulation 1-1 : Throughput Comparisons (EF using UDP)

2000

2000

1800

1800

1600

1600

1400

1400

1200

1200

1000

1000

800

800

600

600

400

400

200

200

0
0

100

200

300

400

500

600

700

800

AF
EF
BE

0
900 1000 1100 1200 1300 1400 1500

Time (sec)

kbits/sec

Simulation 1-2 : Throughput Comparisons (EF using TCP)

2000

2000

1800

1800

1600

1600

1400

1400

1200

1200

1000

1000

AF
EF

800

800

600

600

400

400

200

200

0
0

100

200

300

400

500

600

700

800

900 1000 1100 1200 1300 1400 1500

Time (sec)

Figure 4.7 Simulation 1-1 & 1-2Throughput Comparisons between PHBs

51

BE

Figure 4.7 1-1 1-2 AFEF BE PHB

500
WRR[36] 1-1
UDP EF 1-2 TCP EF
WRR PHB PHB
PHB EF PHB
1200 kbps
Simulation 1-1 : EF Queue Drop Ratio
0.8
0.7

Drop Ratio

0.6
0.5
EF (R0)

0.4

EF (R1)
EF (R2)

0.3
0.2
0.1
0
0

100

200

300

400

500

600

700

800

900 1000 1100 1200 1300 1400 1500

Time (sec)

Figure 4.8 EF Queue Drop Ratio at Routers(R0~R2)

Figure 4.8 R0~R2 EF

500 R1 R2
EF 1-1 EF UDP
(1200 kbps)
EF
52

 EF
BE TCP TCP window size
window size
BE 1-2
PHB TCP

EF PHB
Figure 4.6 R0R1 R2 EFAF
BE

Default Weight in WRR

PHB

Data Sending Rate

Configurated Peak Rate

Scheduler

Sim. 2-1

300kbps per-flow

300kbps

Sim. 2-2

TCP (FTP)

300kbps

AF

TCP (FTP)

500kbps

BE

TCP (FTP)

EF

EF PHB R0~R2 EF
300 kbps
EF 300 kbps
R0~R2 AF BE
EF TCP UDP

53

kbits/sec

Simulation 2-1 : Throughput Comparisons (EF using UDP)

2000

2000

1800

1800

1600

1600

1400

1400

1200

1200

1000

1000

800

800

600

600

400

400

200

200

0
0

100 200 300

400 500

600 700

AF
BE
EF

0
800 900 1000 1100 1200 1300 1400 1500

Time (sec)

kbits/sec

Simulation 2-2 : Throughput Comparisons (EF using TCP)

2000

2000

1800

1800

1600

1600

1400

1400

1200

1200

1000

1000

800

800

600

600

400

400

200

200

0
0

100

200

300

400

500

600

700

800

900 1000 1100 1200 1300 1400 1500

Time (sec)

Figure 4.9 Simulation 2-1 & 2-2Throughput Comparisons between PHBs

54

AF
BE
EF

Figure 4.9 2-1 2-2 PHB

WRR
EF
EF BE PHB 2-1 2-2 EF
900 kbps 2-2 EF
900 kbps (oscillating) 2-2 EF
TCP TCP window size 2-1
EF UDP 2-2
Figure 4.10 2-1 2-2 EF
2-2 EF TCP
10
Figure 4.10
EF EF
EF PHB
(unfairness) RTT
EF PHB
EF
300 kbps EF

55

Simulation 2-1 : Throughput Comparisons for EF Flows

400

350
300

kbits/sec

250
EF0
EF1
EF2

200

150
100

50
0
0

100

200

300

400

500

600

700

800

900 1000 1100 1200 1300 1400 1500

Time (sec)

Simulation 2-2 : Throughput Comparisons for EF Flows

500
450
400
350

kbits/sec

300
EF0

250

EF1
EF2

200
150
100
50
0
0

100

200

300

400

500

600

700

800

900

1000 1100 1200 1300 1400 1500

Time (sec)

Figure 4.10 Simulation 2-1 & 2-2Throughput Comparisons for EF Flows

56

Simulation 2 : Remarked EF Packets through Traffic Conditioner

3000

2500

Packets

2000

1500

Sim. 2-1
Sim. 2-2

1000

500

0
0

100

200

300

400

500

600

700

800

900 1000 1100 1200 1300 1400 1500

Time (sec)

Figure 4.11 Remarked EF Packets through DS Traffic Conditioner

Figure 4.11 2-1 2-2 EF

(Traffic Profile)
Figure 4.9 Figure 4.10
500 EF
Figure 4.11 2-2 EF
TCP EF 300 kbps window size
TCP EF
300 kbps (Traffic
Conditioner) EF PHB
(Dropped) 2-1 EF
UDP 300 kbps
EF PHB
57

 300 kbps
300 kbps
EF PHB EF
(Dropped) 2-2 EF
TCP
TCP EF

Figure 4.6 EFAF BE

R0R1 R2
N (Time Interval)

PHB

Sim. 3-1

Data Sending Rate

Default

SA Time

Weight

Interval (N)

Configurated Peak Rate

TCP (FTP)

300 kbps

EF

60 sec
1

Sim. 3-2

TCP (FTP)

300 kbps

500 sec

AF

TCP (FTP)

500 kbps

BE

TCP (FTP)

EF

58

 PHB

EF PHB TCP 3-1 3-2 N

60 500 2-2

kbits/sec

Simulation 3 : Throughput Comparisons ( EF using TCP)

1200

1200

1000

1000

800

800

600

600

400

400
Sim. 2-2 (0 sec)
Sim. 3-2 (500 sec)
Sim. 3-1 (60 sec)

200
0
0

100

200

300

400

500

600

700

800

900

200

0
1000 1100 1200 1300 1400 1500

Time (sec)

Figure 4.12

Throughput Comprisons for EF Flows with N=0, 60 and 500 sec

Figure 4.12 3-1 3-2 (N = 60 500 )

EF PHB 2-2 Figure
4.12 EF

N EF PHB
500 2-2
3-1 3-2 510 1000

59


EF
Figure 4.10 EF
Figure 4.10

Figure 4.13
Simulation 3-2 : Throughput Comparisons for EF Flows (N = 500 sec)
500
450
400

kbits/sec

350
300
EF0

250

EF1

200

EF2

150
100

Unfairness

50
0
0

100

200

300

400

500

600

700

800

900

1000 1100 1200 1300 1400 1500

Time (sec)

Figure 4.13 Simulation 3-2Throughput Comprisons for EF Flows (N= 500 sec)

EF PHB

60


NS-2

EF PHB

EF PHB
EF

(Maximum Queue Length)

Q (Bytes) A (bps) T
(bps) (8 * Q) / (A T) A
EF T EF PHB WRR

(8 * Q) / T
(8 * Q) / (A T)
Figure 4.6
EF PHB
50 3750 7500 3-1
61

 Figure 4.14 Figure 4.15

(8 * Q) / (A T) 3-1 3750
UDP 500Bytes EF 900 kbps
R2 EF PHB WRR
EF 300 kbps (8 * 3750 Packets * 500 Bytes/Packet)
/ (900 KBits/sec 300 KBits/sec) = 25 sec EF 25
Figure 4.14 7500
(8 * 7500 Packets * 500 Bytes/Packet) / (900 KBits/sec 300 KBits/sec)
= 50 sec EF 50 Figure 4.15

T
( T A)

25 50
EF 25
50 20 45 EF
Figure 4.16 Figure 4.17

62

4000

3500

Queue Length (Packets)

25 sec, 3750 Packets

3000

2500

2000

1500

1000
EF QL R0
EF QL R1

500

EF QL R2
0
0

100

200

300

400

500

600

700

800

900

1000

1100

1200

1300

1400

1500

Time (sec)

0.7

0.6

Drop Ratio

0.5

0.4

0.3

0.2
EF (R0)

0.1

EF (R1)
EF (R2)

25 sec
0
0

100

200

300

400

500

600

700

800

900

1000

1100

1200

1300

Time (sec)
Figure 4.14 Simulation 3-1EF Queue Length and Drop Ratio
(Queue Size = 3750 Packets)

63

1400

1500

8000

7000

50 sec, 7500 Packets

6000

Packets

5000

4000

3000

2000
EF (R0)
EF (R1)

1000

EF (R2)
0
0

100

200

300

400

500

600

700

800

900

1000

1100

1200

1300

1400

1500

Time (sec)

0.7

0.6

Drop Ratio

0.5

0.4

0.3

0.2
EF (R0)
EF (R1)
EF (R2)

0.1

50 sec
0
0

100

200

300

400

500

600

700

800

900

1000

1100

1200

1300

Time (sec)

Figure 4.15 Simulation 3-1EF Queue Length and Drop Ratio

(Queue Size = 7500 Packets)

64

1400

1500

3500

Queue Length (Packets)

3000

2500

2000

1500

1000
EF (R0)
500

EF (R1)
EF (R2)

0
0

100

200

300

400

500

600

700

800

900

1000

1100

1200

1300

1400

1500

Time (sec)

Figure 4.16 Simulation 3-1EF Queue Length (Queue Size = 3750 Packets)

8000

6754 Packets
7000

Queue Length (Packets)

6000

5000

4000

3000

2000
EF (R0)
1000

EF (R1)
EF (R2)

0
0

100

200

300

400

500

600

700

800

900

1000

1100

1200

1300

1400

Time (sec)

Figure 4.17 Simulation 3-1EF Queue Length (Queue Size = 7500 Packets)

65

1500

 Figure 4.16 Figure 4.17 Figure 4.14 4.15

EF 20 45
EF
2-1 Figure 4.9 900 kbps

Figure 4.12 Figure 4.16 4.17

EF PHB T

Q A T

EF PHB
3-2 Figure 4.13 EF

Sean Murphy[28] EF
Drop Tail[37]

1992 Sally Floyd Van Jacobson[37]

(bursty traffic) Round Trip Time (RTT)Drop
Tail
Random Early Detection(RED)[29]
66

 Sean Murphy RE
EF PHB
EF PHB Drop Tail RED
2-2 Figure 4.6 EF
AFBE

PHB

Data Sending Rate

Peak Rate

EF

TCP (FTP)

300 kbps

Default Weight in
WRR
1

AF

TCP (FTP)

500 kbps

BE

TCP (FTP)

Figure 4.19 RED EF

EF
2-2 Figure 4.18 500

RED Drop Tail EF

EF

67

500
450
400
350

kbits/sec

300
250
200
150
100

EF0
EF1

50

EF2

0
0

100

200

300

400

500

600

700

800

900

1000

1100

1200

1300

1400

1500

Time (sec)

Figure 4.18 Simulation 2-2Throughput Comparisons for EF Flows

500
450
400
350

kbits/sec

300
250
200
150
EF0

100

EF1
50

EF2

0
0

100

200

300

400

500

600

700

800

900

1000

1100

1200

1300

Time (sec)

Figure 4.19 Simulation 4Throughput Comparisons for EF Flows

68

1400

1500

5.1

PHB
DSCP

(ISP)

(weight) WRR

EF PHB

PHB

69

(ISP)
(Region)
(Domain)

TCP/IP IP
CU TCP
TCP

NS-2[24]
NS-2
NS-2

EF EF

5.2

EF PHB
AF PHB IETF PHB

70


?? AF PHB (Drop Precedence)

DSCP

?? WRR
PHB
PHB AF PHB

AF
??

?? EF PHB

[14][15]
?? TCP
TCP

TCP

71

72


[1] Xipeng Xian, Lionel M. Ni, Internet QoS : A Big Picture, IEEE Network Vol. 13
NO.2 , pp. 8-18, March-April 1999.
[2] R. Braden, D. Clark, S. Shenker, Integrated Services in the Internet Architecture :
an Overview,RFC 1633, June 1994.
[3] R. Braden et al., Resource ReSerVation Protocol (RSVP) Version 1 Functional
Specification, RFC 2205, September 1997.
[4] J. Wroclawski, Specification of the Controlled-Load NetworkElement Service,
RFC 2211, September 1997.
[5] S. Shenker, C. Partridge, R. Guerin, Specification of Guaranteed Quality of
Service, RFC 2212, September 1997.
[6] K. Nichols, S. Blake, F. Baker, D. Black, Definition of the Diffrentiated Services
Field(DS Field) in the IPv4 and IPv6 Headers, Internet RFC 2474, December
1998.
[7] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, An Architecture
for Differentiated Services, Internet RFC 2475, December 1998.
[8] Deering, S. and R. Hinden, Internet Protocol, Version 6 (IPv6) Specification,
RFC 2460, December 1998.
[9] Postel, J., Editor, Internet Protocol Specification, RFC 791, September 1981.
[10] Y. Bernet, A. Smith, S. Blake, D. Grossman, A Conceptual Model for Diffserv
Routers, Internet-Draft (draft-ietf-diffserv-model-03.txt), May 2000.
[11] J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, Assured Forwarding PHB
Group, RFC 2597, June 1999.
[12] V. Jacobson, K. Nichols, K. Poduri, An Expedited Forwarding PHB, RFC 2598,
June 1999.
[13] Bruce Davie, Implementing QoS for Packet Telephony, PACKET CISCO
System Users Magazine, Vol.12 NO.2, pp. 81-83, Second Quarter 2000.
[14] Wu-Chang Feng, Dilip D. Kandlur, Debanjan Saha, and Kang G. Shin, Adaptive
Packet Marking for Maintaining End-to-End Throughput in a
Differentiated-Services Internet, IEEE/ACM Transactions on Networking, Vol. 7
NO.5, pp. 685-697, October 1999.
[15] Hungkei (Keith) Chow, A Feedback Control Extension to Differentiated
Services, Internet-Draft (draft-chow-diffserv-fbctrl-00.txt), March 1999.
[16] Y. Bernet, Format of the RSVP DCLASS Object, Internet-Draft
(draft-ietf-issll-dclass-01.txt), October 1999.

73

[17] Y. Bernet, R. Yavatkar, P. Ford, F. Baker, L. Zhang, M. Speer, R. Braden, B.

Davie, J. Wroclawski, E. Felstaine, A Framework For Integrated Services
Operation Over Diffserv Networks, Internet-Draft
(draft-ietf-issll-diffserv-rsvp-05.txt), May 2000.
[18] R. Callon, et al. "A Framework for Multiprotocol Label Switching",
Internet-Draft (draft-ietf-mpls-framework-05.txt), September 1999
[19] Eric C. Rosen et al., "Multiprotocol Label Switching Architecture",
Internet-Draft (draft-ietf-mpls-arch-06.txt), August 1999
[20] I. Andrikopoulos, G. Pavlou, Supporting Differentiated Services in MPLS
Networks, Quality of Service, 1999. , IWQoS '99. 1999 Seventh International
Workshop on , 1999.
[21] F.L. Faucheur, L. Wu, B. Davie, S. Davari, P. Vaananen, R. Krishnan, P. Cheval, J.
Heinanen, MPLS Support of Differentiated Services, Internet-Draft
(draft-ietf-mpls-diff-ext-05.tx), June 2000.
[22] Jon Postel, ed. Transmission Control Protocol, RFC 793, September 1981.
[23] Network Research Group, Lawrence Berkeley National Laboratory (LBNL), NS
version 1 - LBNL Network Simulator, http://www-nrg.ee.lbl.gov/ns/
[24] UC Berkeley, UCB/LBNL/VINT Network Simulator ns (version 2),
http://www-mash.cs.berkeley.edu/ns/
[25] Sun Microsystems Laboratories, Tcl/Tk research at Sun Microsystems
Laboratories, http://www.sun.com/research/tcl/
[26] David Wetherall, MIT Lab for Computer Science, OTcl - MIT Object Tcl The
FAQ & Manual, ver0.96, Sep. 1995,
ftp://ftp.tns.lcs.mit.edu/pub/otcl/README.html
[27] UC Berkeley, "UCB/LBNL Network Simulator : Contributed Code",
http://www-mash.cs.berkeley.edu/ns/ns-contributed.html
[28] Sea Murphy, Diffserv additions to ns-2,
http://www.teltec.dcu.ie/~murphys/ns-work/diffserv/index.html, May 2000.
[29] Sally Floyd, Van Jacobson, Random Early Detection Gateways for Congestion
Avoidance, IEEE/ACM Transactions on Networking Vol. 1 NO.4, pp. 397-413,
August 1993.
[30] B.Braden et al., Recommendation on Queue Management and Congestion
Avoidance in the Internet, RFC 2309, April 1998.
[31] Clark, D.D.; Wenjia Fang, Explicit allocation of best-effort packet delivery
service, IEEE/ACM Transactions on Networking Vol. 6 NO.4, pp. 362-373,
August 1998.
[32] Sally Floyd, Issues in Flexible Resource Management for Datagram Networks",
3rd Workshop on Very High Speed Networks, March 9, 1992.
74

[33] Sally Floyd, Van Jacobson, Link-sharing and Resource Management Models for
Packet Networks, IEEE/ACM Transactions on Networking, Vol. 3 NO.4, pp.
365-386, August 1995.
[34] W.C. Feng, D.D. Kandlur, D. Saha, K.G. Shin, "Understanding and Improving
TCP Performance Over Networks with Minimum Rate Guarantees", IEEE/ACM
Transactions on Networking, Vol. 7, NO.2, pp. 173-187, April 1999.
[35] A. Demers, S. Keshav, S. Shenker, "Analysis and Simulation of a Fair Queueing
Algorithm", Symposium proceedings on Communications architectures &
protocols, September 1989.
[36] Byung G. Kim, Bo-Kyoung Kim, "Simulation Study of Weighted Round-Robin
Queueing Policy", Proceedings of Technical Conference on Telecommunications
R&D in Massachusetts, October 1994.
[37] Sally Floyd, Van Jacobson, "On Traffic Phase Effects in Packet-Switched
Gateways", Lawrence Berkeley Laboratory, 1992.

75

A
Adaptive Traffic Conditioner (ATC) 23, 24
Assured Forwarding (AF) 14, 15, 35

B
Behavior Aggregate (BA) 6, 14, 37
Best-Effort (BE) 4, 10, 14

C
Class Selector Codepoint 7, 10
Class-Based Queue (CBQ) 17
Classification 3, 17, 37
Classifier 5, 12, 37
Congestion Avoidance 17
Congestion Control 17, 22, 29
Control Packet Type (CPT) 36, 37, 47
Controlled-Load Service 4
Currently Unused (CU) 8, 36, 47

D
DCLASS 26, 29
DS Service Levels 12
Default Forwarding (DF) 14, 17
Differentiated Services (Diffserv) 1, 6, 27
Drop Precedence 15, 35
Dumb Bell 49

76

E
Edge Router 3, 6
Egress Node 7, 11, 23
Enhanced Random Early Detection (ERED) 17, 22, 29
Expedited Forwarding (EF) 2, 14, 35

F
Feedback Controlled Diffserv (FC-DS) 23
Forwarding Equivalence Class (FEC) 24

I
In-Profile 14, 16
Ingress Node 7, 11, 23
Integrated Services (Intserv) 4, 20, 27
Interior Node 7, 23, 33
Internet Engineering Task Force (IETF) 3, 8, 23

L
Label Switch Router (LSR) 24, 25
Label Switched Path (LSP) 24, 25, 29

M
Marking Probability 17, 22
Multi-Field (MF) 6, 37

N
Network Simulator Version 2 (NS-2) 2, 43, 70

O
Object Tcl (OTcl) 43
Out-of-Profile 14, 16
Over-Provisioning 3
77

P
Per-Hop Behavior (PHB) 7, 10, 31
Premium Service 15, 17
Probe Control Packet 23, 29

Q
Quality of Services (QoS) 3, 13, 25

R
Random Early Detection (RED) 2, 17, 66
Random Early Detection with In/Out bit (RIO) 16
Report Packet 23, 29
Resource Reservation Protocol (RSVP) 4, 13, 20
Round-Trip Time (RTT) 20, 55

S
Self- Adaptive Control Message 33, 36
Self- Adaptive Controller 32
Self- Adaptive Diffserv Domain 33
Self- Adaptive Egress Node 33
Self- Adaptive Information (SAI) 37
Self- Adaptive Ingress Node 33
Self- Adaptive Interior Node 33
Service Level Agreements (SLA) 14, 31, 45
Signaling Protocol 4, 5

T
Traffic Conditioning Specifications (TCS) 12
Token Bucket 24
Token Rate 14
78

Tool Command Language (Tcl) 43

Traffic Conditioning Agreements (TCA) 31, 45
Traffic Profile 12, 24, 40

V
Virtual Leased Line (VLL) 15, 17, 40
Voice-over-IP (VoIP) 21

W
Weighted Fair Queue (WFQ) 17, 19
Weighted Round-Robin (WRR) 17, 30

79