• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.135-143
• /
• 2006

PQ(Priority Queue) and WRR(Weighted Round Robin) are the most famous schedulers, however, these schedulers have both points of advantages and disadvantages. In this paper, we propose an algorithm that can be adopted in my kind of scheduling type with making up for weak points of PQ and WRR. The proposed algorithm includes a fuzzy theory in the scheduler to assign priorities dynamically in the DiffServ network. This algorithm produces the control discipline by the fuzzy theory to assign priorities of the Queue effectively with checking the Queue status of each class dynamically under the discipline.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1094-1104
• /
• 2017

In this paper, a motion image is detected based on the irregularity of lights. This motion image is extracted by modifying the reflected light region of the 3 way-diff algorithms. 3 way-diff algorithm extracts reflected light region using the 3-successive image. In this algorithm, The reflected light region is a region generated by light in the image production process and is finally created around all objects. The algorithm shows a process to extracting the region. This process is a simple operation, but doesn't have a defined formula for light. This paper judges that the reflected light region is a kind of noise at the 3 way-diff algorithms and defines the formula for extracting the reflected light region. It shows that compared with the proposed algorithm and existing algorithm through experiment.

• ETRI Journal
• /
• v.24 no.1
• /
• pp.43-55
• /
• 2002

This paper proposes a flow-based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi-Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ-aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay-bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ-aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end-to-end delay and path utilization.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.84-92
• /
• 2007

This paper deals with the creation of multicast trees in a differentiated services (DiffServ) domain. Initially, we model the integration problems of multicast & DiffServ and give a general de-scription of our framework for multicast provisioning in DiffServ domains. Within this framework, we introduce a novel heuristic algorithm which calculates the multicast trees efficiently. The multicast tree's format and the bandwidth constraints per service class are modeled. The heuristic is based on the Dijkstra's shortest path algorithm and aims to produce the cheapest possible trees (Steiner tree problem) that conform to the defined model. The produced trees can be considered as DiffServ-customized Steiner trees. Furthermore, we evaluate the algorithm with theoretical and experimental analysis and finally, we present our conclusions.

• The Journal of the Korea Contents Association
• /
• v.6 no.7
• /
• pp.58-68
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.145-156
• /
• 2007

Recently, the needs for effective real time change detection algorithms for XML/HTML documents and increased in such fields as the detection of defacement attacks to web documents, the version management, and so on. Especially, those applications of real time change detection for large number of XML/HTML documents require fast heuristic algorithms to be used in real time environment, instead of algorithms which compute minimal cost-edit scripts. Existing heuristic algorithms are fast in execution time, but do not provide satisfactory edit script. In this paper, we present existing algorithms XyDiff and X-tree Diff, analyze their problems and propose algorithm X-tree Diff which improve problems in existing ones. X-tree Diff+ has similar performance in execution time with existing algorithms, but it improves matching ratio between nodes from two documents by refining matching process based on the notion of efficiency of matching.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.735-742
• /
• 2007

We propose an effective packet marking algorithm for video streaming in DiffServ network. Because legacy packet markers such as srTCM(single rate three color marker) cannot distinguish the importance of packet, these markers can cause quality degradation of streaming during the network congestion period. Recently proposed TMS (Two Marker System) [4] shows effectiveness in such scenario that video streaming service is struggling with other types of service traffic. However, if many video streaming services co-exist in DiffServ network and result in competition among themselves, then both legacy packet markers and even TMS cannot prevent drastic streaming quality degradation. To cope with this, we suggest A-TCPM (Adaptive time sliding window Three Color Marker) algorithm. In this algorithm, an A-TCPM module decides the color of a racket based upon the probability which is lead by current channel status and frame importance ratio. Simulation results show that proposed A-TCPM algorithm can enhance streaming service quality especially when overbooked video streaming sessions struggle with themselves.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.128-131
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assigns the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. In result, the proposed algorithm enhances the packet discard rate at the EF class than WRR scheduling method and the AF4 class than PQ scheduling method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.697-710
• /
• 2004

Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.