Abstract: With the constraints on both QoS (Quality of Service) and network resource considered for the traffic requested from users, a QoS dynamic traffic grooming scheme is proposed on optical Internet. It is based on a hierarchical graph model and the Dijkstra kth shortest path algorithm to minimize the network cost. With the concept of appetency introduced, the scheme tries to groom the newly arrived traffic requests and lead them to the existing lightpaths available to meet the requirements of bandwidth and delay as possible. Simulation results showed that the scheme proposed is feasible, practical and effective, since it not only support QoS but also improve the lightpath efficiency.