• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.2
• /
• pp.193-204
• /
• 2010

Since Wireless Multimedia Sensor Network(WMSN) needs to process various multimedia data such as audio, image and video data as well as scalar data, it requires a mechanism that can support Quality of Service(QoS) to handle efficiently. This paper classifies traffic in WMSN as periodic monitoring traffic, event traffic, multimedia traffic and query-based traffic, proposes marking algorithm and queue management mechanism that guarantee differentiated QoS in terms of delay, energy efficiency and credibility on each traffic and conduct performance analysis with simulation.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.553-561
• /
• 2002

We present a novel service discipline, called linear service discipline, to serve multiple QoS queues sharing a resource and analyze its properties. The linear server makes the output traffic and the queueing dynamics of individual queues as a linear function of its input traffic. In particular, if input traffic is Gaussian, the distributions of queue length and output traffic are also Gaussian with their mean and variance being a function of input mean and input power spectrum (equivalently, autocorrelation function of input). Important QoS measures including buffer overflow probability and queueing delay distribution are also expressed as a function of input mean and input power spectrum. This study explores a new direction for network-wide traffic management based on linear system theories by letting us view the queueing process at each node as a linear filter.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.4
• /
• pp.15-22
• /
• 2011

U-Healthcare service is a real-time service using the vital signs which are continuously transferred from monitoring sensors attached to mobile patients under the wireless network environments. It should monitor the health condition of mobile patients everywhere at any time. In this paper, we have improved two features of the three layered mobile patient monitoring system with load balancing ability. First, the simulation process has been improved by allowing the number of related nodes to be changed. Secondly, we have modified S node to which queue is added to reduce the loss rate of collecting data from patients during the delay of S node process. And the data from the patient with high priority can be transferred to the server immediately through the filtering function. Furthermore, we have solved the problem of redundancy in sharing information among S nodes by differentiating process time to each S node. By performing a DEVS Java-based system simulation, we have verified the efficiency of this improved system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.129-140
• /
• 2003

Recently viruses and various hacking tools that threat hosts on a network becomes more intelligent and cleverer, and so the various security mechanisms against them have ken developed during last decades. To detect these network attacks, many NIPSs(Network-based Intrusion Prevention Systems) that are more functional than traditional NIDSs are developed by several companies and organizations. But, many previous NIPSS are hewn to have some weakness in protecting important hosts from network attacks because of its incorrectness and post-management aspects. The aspect of incorrectness means that many NIPSs incorrectly discriminate between normal and attack network traffic in real time. The aspect of post-management means that they generally respond to attacks after the intrusions are already performed to a large extent. Therefore, to detect network attacks in realtime and to increase the capability of analyzing packets, faster and more active responding capabilities are required for NIPS frameworks. In this paper, we propose a framework for real-time intrusion prevention. This framework consists of packet filtering component that works on netfilter in Linux kernel and traffic control component that have a capability of step-by-step control over abnormal network traffic with the CBQ mechanism.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.6
• /
• pp.65-70
• /
• 1999

In ATM network there exist several traffics according to QoS, such as CBR, rt-VBR, nrt-VBR, UBR, and ABR. Many studies have done at the traffic management of ABR which uses the unused network bandwidth. Many flow control mechanisms have proposed to use efficiently the unused bandwidth. In TMWG(Traffic Management Working Group) of ATM Forum, there exist rate-based, credit-based, and mixture of them to manage flow control of ABR traffic. Among these, rate-based mechanisms adopted as standard because it is flexible and also makes it possible to implement ATM switch with low price and high capacity. In this paper, we study the switch that uses EFCI, ER and VS/VD(Virtual Source/Virtual Destination) with rate-based mechanism. Instead of using queue threshold, we propose a new algorithm which uses bandwidth threshold of input stage of switch, and manages efficiently ABR traffic with EPRCA algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.879-890
• /
• 1995

This paper proposes the shuttle protocol that can gather management information from managed systems in an efficient way. In this paper, we implement the protocol and evaluate the performance by simulation. The major feature of the shuttle protocol is a chained logical connection through managed systems, and management informations to be collected are circulated among specified managed systems in circular order on a logical ring connection. The data generated by an managed system are relayed to a neighbor managed system and the system sends its data which has additional management information to received data. Finally, a manager stationman get all of data generated by every managed system. we will show the analysis of management traffic patterns using conventional polling schemes and the shuttle protocol implementation viable to TCP/IP network and improving existing polling mechansims. Additionally, it is performed to evaluate the packet processing time and its distribution of a manager system and a gateway, and the queue length of packet and bit length of gateway against conventional polling schemes by simulation using OPNRT, a simulation-dedicated package.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.194-204
• /
• 2008

The online collection of coarse-grained traffic information, such as the total number of flows, is gaining in importance due to a wide range of applications, such as congestion control and network security. In this paper, we focus on an active queue management scheme called SRED since it estimates the number of active flows and uses the quantity to indicate the level of congestion. However, SRED has several limitations, such as instability in estimating the number of active flows and underestimation of active flows in the presence of non-responsive traffic. We present a Markov model to examine the capability of SRED in estimating the number of flows. We show how the SRED cache hit rate can be used to quantify the number of active flows. We then propose a modified SRED scheme, called hash-based two-level caching (HaTCh), which uses hashing and a two-level caching mechanism to accurately estimate the number of active flows under various workloads. Simulation results indicate that the proposed scheme provides a more accurate estimation of the number of active flows than SRED, stabilizes the estimation with respect to workload fluctuations, and prevents performance degradation by efficiently isolating non-responsive flows.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.530-538
• /
• 2011

Performance of TCP can be severely degraded in Mobile IP-based wireless networks where packet losses not related to network congestion occur frequently during inter-subnetwork handoffs by user mobility. To solve such a problem in the networks using Mobile IP, the packet buffering method at a base station(BS) recovers those packets dropped during handoff by forwarding the buffered packets at the old BS to the mobile users. But, when the mobile user moves to a congested BS in a new foreign subnetwork, those buffered packets forwarded by the old BS are dropped and TCP transmission performance of a mobile user degrades severely. In this paper, we propose a Modified BLUE(MBLUE) buffer required at a BS to increase TCP throughput in Mobile IP-based networks. When a queue length exceed a threshold and congestion grows, MBLUE increases its packet drop probability. But, when a TCP connection is added at new BS by a handoff, the old BS marks the buffered packets. And new BS receives the marked packets without dropping. Simulation results show that MBLUE buffer reduces congestion during handoffs and increases TCP throughputs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.168-175
• /
• 2006

To cope with channel variation, wireless networks such as IEEE 802.11 WLAN provide multiple transmission rates by employing different channel modulation and coding schemes. However, the coexistence of different transmission rates degrades the total system performance of the network. In order to eliminate this performance abnormality and improve protocol capacity, we propose a new Packet transmission algorithm, the RAT(Rate-Adapted Transmission) scheme. The RAT scheme distributes the wireless channel fairly based on the channel occupancy time. Moreover, it efficiently transmits packets even in a single station using rate-based queue management. Therefore, the RAT scheme obtains not only the inter-rate contention gain among stations but also the intra-rate contention gain among connections in a single station.

• The Journal of Society for e-Business Studies
• /
• v.17 no.1
• /
• pp.53-74
• /
• 2012

This study developed a method for selection of available human resources for incomingjob allocation that considers factors affecting resource performance in the business process management (BPM) environment. For many years, resource selection has been treated as a very important issue in scheduling due to its direct influence on the speed and quality of task accomplishment. Even though traditional resource selection can work well in many situations, it might not be the best choice when dealing with human resources. Humanresource performance is easily affected by several factors such as workload, queue, working hours, inter-arrival time, and others. The resource-selection rule developed in the present study considers factors that affect human resource performance. We used a Bayesian Network (BN) to incorporate those factors into a single model, which we have called the Bayesian Selection Rule (BSR). Our simulation results show that the BSR can reduce waiting time, completion time and cycle time.