• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.49-52
• /
• 2002

QoS support for the Internet traffic becomes an important future requirement of various network devices such as routers and switches. Differentiated Services(Diffserv) is considered as an efficient feasible solution for providing different service characteristics to different classes of network users. IETF Diffserv working group has already defined a general architecture of Diffserv and is extending its detail features. Network vendors also start implementing Diffserv enabled network devices. However, the management of Diffserv is not fully standardized yet. This paper, we present methods of traffic flow control in Diffserv Networks. we have designed a Diffserv Traffic Control system.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.307-310
• /
• 2000

ATM is the switching and multiplexing technology chosen by the ITU-T for the operation of B-lSDN. Basically, ATM technology is designed to combine the reliability of circuit switching with the efficiency and flexibility of packet switching technology. For servicing QoS in IPOA(IP over ATM) when the larger effort is given, it will be the good method that the original QoS benefits having ATM switching have in ATM layer underlying layer. The IETF has recently proposed Differentiated Services framework for provision of QoS. In this paper we analyse performance of two Diffserv mechanism. Threshold Dropping and Priority Scheduling. Threshold Dropping and Priority Scheduling can be regarded as basic mechanisms from which the other mechanisms have been derived. Hence comparative performance of these two mechanisms in providing required QoS is an important issue. In this Paper we carry out a performance comparison of the TD and PS mechanisms with the aim of providing the same level of packet loss to the preferred flow. Our comparison of the TD and PS allows us to determine resultant packet loss for the non-preferred flows as a function of various parameters of the two mechanisms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.2
• /
• pp.31-40
• /
• 2004

Diff-Serv(DS) is a mechanism by which network service providers can offer differing levels of network service to different traffic, in so providing quality of service(QoS) to their customers. Because this mechanism has been deployed just for fixed hosts with the Token Bucket mechanism according to AggF(Aggregate Flow) instead of each flow, DS can not suggest effective usability of traffic resources. In this paper, we use WFQ mechanism for traffic conditioner and scheduling method monitoring the AggF and the results will be used to control the next flows coming in TC. So it will control traffic rate dynamically and suggest efficient usability of bandwidth.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.301-311
• /
• 2013

This paper proposes a policy-based quality of service (QoS) management framework for adaptive routing decisions. We present an approach considering interior gateway protocol (IGP) for path discovery mechanisms and QoS-aware policies for configuring the network elements. The integration of the aforementioned modules into this policy-based network management (PBNM) system is demonstrated by conducting experiments in a real environment, the hellenic public administration network SYZEFXIS. These experiments combine different traffic conditioning mechanisms through event detectors, consider IP service level agreement mechanisms that interoperate with the PBNM system and analyze the enforcement of IGP and QoS policies. Finally, validation and measurement tools are used to prove the efficiency of this framework. It is shown that this architecture offers significantly increased performance and learning capabilities, while the PBNM system achieves adaptive QoS routing through automated configuration considering the avoidance of suboptimal routing issues or under-performance conditions of the network entities.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.367-370
• /
• 2011

Tactical communication environment evolving for the purpose of providing services such as voice, video and text based on ALL-IP. Therefore, To be able to guarantee QoS level which meets the required level of subscriber for these services in the constrained tactical communication infrastructure, it is required to take the characteristics such as wireless transmission link, mobility of troops or personal into service quality scheme. In this paper, to support differentiated QoS for each individual or mission in the tactical communication environment, we presents a technique that can provide same QoS level which was served originally regardless of the situation to user's move through dynamically determining the QoS level to be provided at the time of the service request on VoIP-Switch.

• 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.

• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.711-723
• /
• 2002

A finer granular scalable (FGS) version of ISO/IEC MPEG-4 video streaming is investigated in this work with the prioritized stream delivery over loss-rate differentiated networks. Our proposed system is focused on the seamless integration of rate adaptation, prioritized packetization, and simplified differentiation for the MPEG-4 FGS video streaming. The proposed system consists of three key components: 1) rate adaptation with scalable source encoding, 2) content-aware prioritized packetization, and 3) loss-based differential forwarding. More specifically, a constant-quality rate adaptation is first achieved by optimally truncating the over-coded FGS stream based on the embedding rate-distortion (R-D) information (obtained from a piecewise linear R-D model). The rate-controlled video stream is then packetized and prioritized according to the loss impact of each packet. Prioritized packets are transmitted over the underlying network, where packets are subject to differentiated dropping and forwarding. By focusing on the end-to-end quality, we establish an effective working conditions for the proposed video streaming and the superior performance is verified by simulated MPEG-4 FGS video streaming.