Kee Seong Cho

An Active Queue Management for QoS Guarantee of the High Priority Service Class

In this paper, we propose the active queue management mechanism (Active-WRED) for guaranteeing the quality of the high priority service class (VoIP or IPTV) in the multi-class traffic service environment. In the congestion situation, this mechanism increases the drop probability of the low priority traffic and reduces the drop probability of the high priority traffic; therefore it can guarantee the quality of the high priority service class from the poor quality by the packet loss.

A Control Plane of Premium IP Multicast

Recently, the fusion of communication and broadcasting surfaces streaming service such as IPTV with killer application of BcN(broadband convergence network). So, network operator is considering premium IP multicast for efficient network utilization. In this paper, premium IP multicast is called as transport service technology that transfer streaming service such as IPTV through integrated, controllable, maintainable network in order to guarantee end-to-end QoS to predefined person. It capacitates billing of multicast service instead of network operator guarantees high quality QoS to subscriber. So, network operators are able to create benefits and find benefit models. The other side, subscribers can use various high quality streaming services.

A point to multipoint routing algorithm based on source routing

This paper proposes a routing path selection mechanism for source routing-based PtMP (point-to-multipoint) call in the ATM switching system. In particular, it suggests a PtMP routing path selection method that can share the maximum amount of resources prior to the optimal path selection, guaranteeing the reduction of path calculation time and cycle prevention. The purpose of this algorithm is to maximize the sharing of resources by finding the branch point closest to the destination node. Therefore, this algorithm using back-tracking chooses from among the nodes neighboring the destination node and fixes the node crossing first the node on the existing path having the same call ID as the branch node, thereby constructing the optimal PtMP routing path. The optimal node is selected by the use of Dijkstra algorithm. That is to say, the PtMP routing path selection performs the step of cross node selection and optimal node selection (optimal path calculation) among neighboring nodes by back-tracking. This technique reduces the process of searching for a routing information table for path selection and path calculation time, it also easily solves the cycle prevention during path establishment.