overview of the proposed IPv6 QoS manager (Fgee,
2004). Section 5 discusses how the dynamic pricing
model is integrated with the QoS manager.
Simulation results are presented to illustrate the
feasibility of the integrated approach.
2 QOS REQUIRMENTS
QoS is the ability of a network to provide better
services to selected network traffic over different
underlying technologies. End-to-end delay, jitter,
bandwidth and packet loss rate are the parameters
typically used for characterizing QoS of individual
connections or data flows (Jha, 2002). The elements
commonly involved in providing QoS guarantees are
(Jha, 2002): 1) Admission Control determines access
to available network resources and keeps track of all
reservations. 2) Policing is performed when a flow’s
actual data traffic exceeds the requested values given
in the traffic specifications. In such cases the packets
are dropped or downgraded to a best effort service
class or marked as non-conforming. 3) Packet
classification identifies packets belonging to a
specific flow and designates a QoS class for this
flow. 4) Packet scheduler ensures that the flows
identified by the packet classifier receive the
requested QoS. 5) Traffic control implementation
involves queuing methods employed to control
traffic at routers interfaces. Function 1) and 2) are
handled by the domain QoS manager. Functions 3)
and 4) are implemented at the edge points.
3 INTERNET PROTOCOL V6
Two components of IPv6 are used to deliver QoS,
the first is the 8-bit priority field in the IPv6 header
that can be used to identify and discriminate traffic
types based on contents of this field. The second
component is the flow label which is used to label
packets belonging to traffic flows for which the
sender requests special handling. Network elements
can now classify packets based on IP semantics
allowing for efficient mapping of packets to their
flows and hence to their flow specification policy.
The flow label is chosen by the IPv6 QoS manager
and is used for reserving resources, and routing and
monitoring traffic flow packets. Also, packets can
now be associated with particular service classes and
IPv6 routing performed on the basis of these classes,
thus improving the performance of core routers. The
benefits of this scheme (Fgee, 2004) are its
simplicity and speed.
4 IPV6 QOS MANAGEMENT
The proposed QoS scheme handles QoS requests by
processing, monitoring, and controlling the traffic
flows. Weighted Fair Queuing (WFQ) is used to
separate the flows in which separate queues are
assigned for each traffic flow. The IPv6 QoS
management system uses the DGI and traffic class
(TC) field for reserving and tracking traffic flows.
This scheme is unique in that the IPv6 network can
be managed without invoking any other QoS
protocols such as RSVP or MPLS. The end-to-end
delay is less as the backbone routers use the DGI for
forwarding decisions as compared to the longest
match procedure used by other schemes. This
technique is scalable as the edge routers handle QoS
requests and communicate with other QoS
managers. Traffic flows are classified based on the
TC field so that each priority level is treated
differently. A sender sends its QoS request to the
network edge router. Upon receiving requests, the
edge router communicates with its domain manager
to approve or reject these requests. The edge router
forwards the manager’s responses, either positive or
negative, to the sender. When accepted, the source
starts sending data packets to the edge router where
traffic flow packets are classified, scheduled and
monitored. Packets are queued depending on their
TC field and the policies set by the QoS manager.
The leaky bucket algorithm is implemented to police
incoming traffic. The algorithm parameters for the
accepted traffic are setup according to their traffic
specifications. When a flow violates its requested
specification, its priority level is degraded or its
packets dropped.
5 DYNAMIC PRICING MODEL
The pricing model is based on the DiffServ end-to-
end pricing scheme introduced in (Tianshu, 2003).
In this market based model the value for the base
price
and fill factor is set by the network
provider for each traffic type. The fill factor is the
ratio of target capacity
to the maximum capacity
for a service class i. The price for a
class i at time t is computed (Tianshu, 2003, Waog,
2001) by:
i
base
P
i
f
i
T
i
C
max
)(tP
i
iiiiii
TTDtPtP /)()1()( −