• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.121-128
• /
• 2005

Recently, as the research of effective resource management for supporting of various next generation internet service, the admission control mechanisms using the dynamic provisioning methods in differentiated service networks are studied. However, even though admission control mechanism is applied to the network, there exits the unfairness of call blocking probability among the different bandwidth requested services. In this paper, we propose the new admission control policy heuristic algorithm that provides fairness of call blocking probability between the large bandwidth requested service and the small bandwidth requested service. The simulation results show that the proposed algorithm provides not only blocking probability fairness but also high bandwidth utilization.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.377-384
• /
• 2005

The purpose of this research is to develop and evaluate a traffic engineering architecture that uses local state information. This architecture is applied to an Internet protocol radio access network (RAN) that uses multi-protocol label switching (MPLS) and differentiated services to support mobile hosts. We assume mobility support is provided by a protocol such as the hierarchical mobile Internet protocol. The traffic engineering architecture is router based-meaning that routers on the edges of the network make the decisions onto which paths to place admitted traffic. We propose an algorithm that supports the architecture and uses local network state in order to function. The goal of the architecture is to provide an inexpensive and fast method to reduce network congestion while increasing the quality of service (QoS) level when compared to traditional routing and traffic engineering techniques. We use a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm. We use the network simulator ns-2 as the core of our simulation environment. Around this core we built a system of pre-simulation, during simulation, and post-processing software that enabled us to simulate our traffic engineering architecture with only very minimal changes to the core ns-2 software. Our simulation environment supports a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.225-236
• /
• 2003

In this paper, we propose a wireless scheduling algorithm to provide the Internet delay proportional differentiated services in wireless networks. For considering network environments that have burst and location-dependent channel errors, our proposed WDPS(Wireless Delay Proportional Service) scheduling algorithm adaptively serves packets in class queues based on the delivered delay performance for each class. The remarkable characteristics of WDPS scheduler are supporting a fair relative delay service, providing graceful throughput and delay compensation, and avoiding class queue blocking problem. Through simulations, we show that the algorithm achieves the desirable properties to provide delay proportional services in wireless networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1017-1027
• /
• 2006

Recently, Internet service providers are offering triple play service which combines voice and video services with the existing high speed Internet service under the common network infrastructure of IP protocol, so that they can create more benefit from operating a single network architecture. In line with this movement in the convergence of network and services, in this work we propose a bandwidth dimensioning method for the subscriber network of the IP network at flow level. To that purpose, let us propose a series of bandwidth dimensioning methods: bandwidth for best effort service only, bandwidth dimensioning for premium services, and bandwidth dimensioning schemes for the premium Internet services as well as the best effort service which comprise the TPS. Our link dimensioning method is based on the flow level that incorporates the flow blocking probability as a measure of grade of services(GoS), and investigates the characteristics of the proposed methods via extensive numerical experiments. After that, let us carry out a simulation experiment concerning the delay and loss performance of the packet scheduling for the premium services (QoS) using the bandwidth designed by our proposed method, via which the packet level quality of service (QoS) for the proposed link dimensioning method can be observed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.192-202
• /
• 2004

In this paper we have proposed policy-based network management system architecture for Internet QoS support Mobile IP networks that is divided into four layers(application layer, information management layer, policy control layer, device layer), then we propose an implementation strategy of policy-based network management system to enforce various control and network management operations and a model of policy server using SCOPS(Simple Common Open Policy Service) protocol that is developed in this research. For policy-based mobile IP network management system implementation, we have derived four policy classes(access control, mobile IP operation, QoS control, and network monitoring) and we showed operation procedures for each policy scenarios. Finally we have implemented Internet QoS support policy-based mobile IP network testbed and management system and verified out DiffServ policy enforcement behaviors for a target class service that is arranged a specific bandwidth on network congestion conditions.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.5
• /
• pp.103-111
• /
• 2002

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked fine. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.509-524
• /
• 2005

Due to the strict requirements of emerging applications, per-flow admission control is gaining increasing importance. One way to implement per-flow admission control is using an on­path resource reservation protocol, where the admission decision is made hop-by-hop after a new flow request arrives at the network boundary. The next-steps in signaling (NSIS) working group of the Internet engineering task force (IETF) is standardising such an on-path signaling protocol. One of the reservation methods considered by NSIS is reduced-state mode, which, suiting the differentiated service (DiffServ) concept, only allows per-class states in interior nodes of a domain. Although there are clear benefits of not dealing with per-flow states in interior nodes-like scalability and low complexity-, without per-flow states the handling of re-routed flows, e.g., after a failure, is a demanding and highly non-trivial task. To be applied in carrier-grade networks, the protocol needs to be resilient in this situation. In this article, we will explain the consequences of a route failover to resource reservation protocols: Severe congestion and incorrect admission decisions due to outdated reservation states. We will set requirements that handling solutions need to fulfill, and we propose extensions to reduced-state protocols accordingly. We show with a set of simulated scenarios that with the given solutions reduced-state protocols can handle re-routed flows practically as fast and robust as stateful protocols.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.11a
• /
• pp.400-406
• /
• 2002

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked fine. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.400-406
• /
• 2002

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked One. But the needs of users have changed. The want to use the new real-time multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-or-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.43-48
• /
• 2004

RTP that is proposed supplement of real-time services on internet environment, as Real-time Transport Protocol, is the protocol that for the purpose of sending data of stream type. RTP and RTCP(Real-time Transport Control Protocol) basically work at the same time, RTCP serves with state information of network at present. RTP has important properties of a transport protocol that runs on end-to-end systems and provides demultiplexing. It also offer reliability and protocol-defined flow／congestion control that transport protocol like TCP can not provides. In this paper, we look around concept and construction of Differentiated sen1ice tint run on RTP and by setting parameters of packet transfer method be used CBQ(Class-Based Queuing) for packet transfer on Differentiated service, each service queue controls properly through packet scheduling method, such as WRR(Weighted Round Robin) and PRR(Packet-by-packet Round Robin) all service classes do not experience the starvation and confirm the performance through computer simulation to achieve fairly scheduling.