• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1613-1618
• /
• 2012

For network is growing at a rapid rate, network environment is more complex. The technology of using network traffic to monitor our network in real-time is developed. Cacti is a representative monitoring tool which based on RRDTool(Round Robin Database tool), SNMP(Simple Network Management Protocol). In this paper, it show you how to develop a system which based on Cacti and Libpcap to monitor our monitored objects. At this system, using Libpcap to capture network traffic packets, analyze these packets and then turn out in Cacti in graphical form. So as to achieve monitoring system. This system's execution is efficient and the management is easy and the results are accurate, so it can be widely utilized in the future.

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

For network is growing at a rapid rate, network environment is more complex. The technology of using network traffic to monitor our network in real-time is developed. Cacti is a representative monitoring tool which based on RRDTool(Round Robin Database tool), SNMP(Simple Network Management Protocol). In this paper, it show you how to develop a system which based on Cacti and Libpcap to monitor our monitored objects. At this system, using Libpcap to capture network traffic packets, analyze these packets and then turn out in Cacti in graphical form. So as to achieve monitoring system. This system's execution is efficient and the management is easy and the results are accurate, so it can be widely utilized in the future.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1609-1622
• /
• 2009

In wireless sensor networks, a clustering protocol is an efficient method to prolong network lifetime. In general, it results in more energy consumption at the cluster-head node. Hence, such a protocol must changes the cluster formation and cluster-head node in each round to prolong the network lifetime. But, this method also causes large amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new clustering algorithm. In this algorithm, we exclude duplicated data of adjacent nodes and transmits the threshold value. We define a group as the sensor nodes within close proximity of each other. In a group, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, group is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(group). In the group with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of group size. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.165-170
• /
• 2023

Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, Non preemptive scheduling, Preemptive scheduling, Shortest Job scheduling and Round Robin algorithm has been discussed with an example and the results has been analyzed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.847-854
• /
• 2005

Many of scheduling algorithms that provide a pre-defined bandwidth to a traffic flow fall into a category of Latency-rate (LR) server, the delay of whose network can be simply calculated by adding up individual 'latencies' of each LR servers. Deficit Round Robin (DRR) is one of such LR servers and the simplest one to implement, so that it is adopted in many real systems. In this research we suggest an improved version of DRR, the DRR with Instant Service (DRR-IS), and analyze it. We have proved that the DRR-IS is still an LR sewer and have obtained its latency. The DRR-IS, compared with DRR, turns out to have the same complexity while provide about $30\%$ better latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7B
• /
• pp.653-663
• /
• 2002

UMTS/GPRS has its own QoS architecture, but additionally needs to support IP-QoS to provide Internet services. This paper describes an IP-QoS provisioning mechanism in the MPLS-based UMTS/GPRS network. We propose a QoS framework that includes the functional architecture of the MPLS-based GPRS networks and the efficient scheduling mechanism based on Diffserv model. The proposed scheduling mechanims is especially focused on the QoS support for real-time services. It also includes a new buffer management scheme that combines the priority queuing and weighted round robin method. The ns-2 simulator has been used to verify the validity of the proposed scheduling method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.41-52
• /
• 2005

In wireless networks there are various errors, caused by multi-path fading and interference between devices which lower the network Performance. Especially, performance of IEEE 802.IS.3 High-Rate WPAN (Wireless Personal Area Network) which is operated in ISM unlicensed frequency band is easily affected by channel errors. In this paper, we propose a scheduling algorithm which takes channel errors into consideration in scheduling asynchronous data traffic. The proposed scheduling algorithm can allocate CTA(Channel Time Allocation) proportionally in accordance with the requested channel time of each device. It also prevents waste of channel time by allocating CTA of the channel-error devices to other channel-error free devices. After recovering from the channel error, the devices are compensated as much as they conceded during channel error status. Simulation results show that the proposed scheduling algorithm is superior to the existing SRPT(Shortest Remain Processing Time) and RR(Round Robin) in throughput and fairness aspects.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.417-425
• /
• 2005

KOINONIA is high-rate Wireless Personal Area Network (WPAN) technology, and is developed for multimedia traffic transmission in personal area. A KOINONIA piconet is a collection of one or more associated slaves under a single master. Efficient scheduling of a master for the traffic of slaves is essential to use channel effectively and to guarantee QoS of multimedia traffic. We propose a new scheduling algorithm to allocate channel time at desired intervals regardless of superframe length, and a Connection Admission Control(CAC) algorithm to regulate the number of traffics in a piconet. Our proposed algorithms have been shown to save channel time and to meet QoS requirements compared to the conventional weighted round-robin algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.10-17
• /
• 2010

Sensor nodes used in Geosensor network are resource limited and power constrained. So it is necessary to research on routing protocols to gather data by using energy efficiently. Wireless sensor networks collect data gathered from sensor nodes by transfering it to the sink using multihop. However, it has two problems. First, the existing works require unnecessary data transmission for choosing a proper parent node to transfer data. Secondly, they have a large number of data transmission because each sensor node has a different path. To solves the problems, we, in this paper, propose a designated path based data aggregation scheme for efficient energy management in WSNs. The proposed scheme can reduce unnecessary data transmission by pre-determining a set of paths and can enable all the sensor nodes to participate in gathering data by running them in round-robin fashion. We show from performance analysis that the proposed scheme is more energy efficient than the existing directed diffusion(DD) and the hierarchical data aggregation(HDA).