|
Broadband integrated services digital network based on
asynchronous transfer mode (B_ISDN/ATM) will provide diverse
services in the near future. Those services have quite
different quality of service (QOS) requirements in terms of
delay and loss. How to fulfill those QOS in topic in this
field. In this thesis we aim at departure scheduling that is to
decide which traffic if served next will cause less penalty in
the future. We found that the Value Iteration Algorithm can
gives an optimal solution to our departure scheduling problem.
However, this approach is not practical in real network
application due to its computational complexity. So, we propose
a near optimal departure scheduling scheme. We will show that
in most cases our scheme gives a optimal decision. Furthermore,
we build a simulation to simulate the real network operation
and apply our scheduling scheme to control the departure.
|