• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.13-24
• /
• 2003

Grid technology requires use of geographically distributed resources from multiple domains. Resource monitoring services or tools consisting sensors or agents will run on many systems to find static resource information (such as architecture vendor, OS name and version, MIPS rate, memory size, CPU capacity, disk size, and NIC information) and dynamic resource information (CPU usage, network usage(bandwidth, latency), memory usage, etc.). Thus monitoring itself may cause system overhead. This paper proposes the optimal monitoring interval to reduce the cost of monitoring services and the dynamic monitoring interval to measure monitoring events accurately. By employing two features, we find out unnecessary system overhead is significantly reduced and accuracy of events is still acquired.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.487-494
• /
• 2009

VOD(Video On Demand) that provides streaming service according to the user's requirement in real time, consists of the video streaming server and the client system. Since it is very hard to apply the traditional server-client model that a server communicates with many clients through 1:1 connection to VOD system because it requires very high network bandwidth, many researches have been done to address this problem. Batching technique is one of VOD system based on Multicast that requires very small network bandwidth. However, the batching based VOD system has a limitation that it is very hard to provide VCR(Video Cassette Recorder) ability. In this paper, we propose a technique that reduces the required network bandwidth to provide VCR function by using the characteristic of MPEG, one of international video compression standard. In the proposed technique, a new video stream for VCR function is constructed with I pictures that is able to be decoded independently. The new video stream for VCR function is transmitted with the video stream for normal play together in Batching manner. The performance evaluation result shows that the proposed technique not only reduces the required network bandwidth and memory usage but also decreases the CPU usages.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.25-28
• /
• 1999

Consider connection-oriented wireless cellular net-works. To establish a circuit or virtual circuit in such a network, a paging message is broadcast over a region at which the destined mobile station is presumed to reside, (identified as a paging area). For an effective paging mechanism, it is desirable to provide the location information of mobile stations to the network. In this paper, we consider a mobile controlled location update scheme under which each mobile station periodically reports its current location information to the network by using an inherent timer (without measuring the power of signals transmitted from base stations). Based on the latest information about a mobile station's location, a paging area is selected to page the mobile station. Note that under this scheme, a mobile station may not yet have reported its location change while sojourning out of the current paging area. In such situation, the mobile station can not receive a paging message destined to it. Frequent location updates can reduce the paging failure rate incurred by mobile stations'sojourning out of the paging area. However, larger bandwidth is needed for location update as the location update rate is increased. On the other hand, as the size of the paging area is increased, the paging failure rate is decreased, while larger bandwidth is required for paging. Thus, we first present a model for mobility, paging and location update processes, and secondly investigate the effect of network parameters on the paging failure rate and the amount of bandwidth used for paging and location update. Finally, we formulate problems to find proper values for the location update rate and paging area size under the constraints on the bandwidth usage levels for location update and paging.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1C
• /
• pp.63-75
• /
• 2012

This paper researched the operation methods of software video teleconferencing on the tactical communication networks under 1Mbps. The tactical communication networks have limited bandwidths, frequent data losses and transmission delays due to the unstable networks. In addition, the bandwidth for video teleconferencing has to be much smaller since the Army Tactical Command Information System(ATCIS) has priority of using the bandwidth. This paper analyzed such restrictions of tactical communication networks, presented some methods to improve the quality of the software video teleconferencing on the tactical communication networks and their actual experiments as well. It is applied in the first place to re-transmit the lost packets and to reduce the image size for the data traffic. Nothing is better for the video teleconferencing than to provide the bandwidth enough for every user. However, on the tactical communication networks with the limited bandwidth, video teleconferencing can be improved by optimizing the compression rate of image data, the number of image frames, the audio codec and the usage of audio compensation data.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.316-328
• /
• 2003

In this paper, we propose and analyze two adaptive channel allocation schemes for supporting multimedia traffics in hierarchical cellular systems. It is guaranteed to satisfy the required quality of service of multimedia traffics according to their characteristics such as a mobile velocity for voice calls and a delay tolerance for multimedia calls. In the scheme 1, only slow-speed voice calls are allowed to overflow from macrocell to microcell and only adaptive multimedia calls can overflow from microcell to macrocell after reducing its bandwidth to the minimum channel bandwidth. In the scheme II, in addition to the first scheme, non-adaptive multimedia calls can occupy the required channel bandwidth through reducing the channel bandwidth of adaptive multimedia calls. The proposed scheme I is analyzed using 2-dimensional Markov model. Through computer simulations, the analysis model and the proposed schemes are compared with the fixed system and two previous studies. In the simulation result, it is shown that the proposed schemes yield a significant improvement in terms of the forced termination probability of handoff calls and the efficiency of channel usage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.324-329
• /
• 2005

In the traditional telephone services, the settlement method for usage of facilities has been systematically and reasonably arranged based on the cost. Through the advanced technology, the telecommunication services such as the convergence of voice-data, wire-wireless, communication-broadcasting, etc are offering. So, new settlement method in the broadband convergence network (BCN) should be necessary. This paper suggests inter-companies settlement method in the broadband network using interconnection bandwidth and transmission distance factor. By reflecting the facility cost weight on each BCN level, the cost settlement for various services can be easily done. As the settlement model for BCN, the inter-companies interconnection and settlement can be normalized by interconnection bandwidth and transmission distance factors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11B
• /
• pp.1620-1627
• /
• 2001

In this paper, a broadband microstrip antenna for PCS and IMT-2000 service is designed. To obtain the broadband characteristics of an antenna, we utilized the multi-layered structure composed of two foam material layers, parasitic element and aperture coupled feeding network. The broadband characteristic is obtained by changing the size of parasitic element and the height of foam materials. In addition to that, the usage of metal layer at the distance of λ/4 from feed-line, back radiation is reduced. The bandwidth of a single element for VSWR less than 1.3 is about 550MHz. The bandwidth of a designed 1$\times$4 array antenna for VSWR less than 1.3 is about 460MHz. The gain of a designed array antenna is about 11.15∼12.15dBi and the front-to-back ratio is about 30dB.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.5
• /
• pp.80-86
• /
• 2010

The conventional bus system architecture consists of masters, slaves, arbiter, decoder and so on in shared bus. As several masters can't use a bus concurrently, arbiter plays an role in arbitrating the bus. The efficiency of bus usage can be determined by the selection of arbitration method. Fixed Priority, Round-Robin, TDMA and Lottery arbitration policies are studied in the conventional arbitration method where the bus priority is primarily considered. In this paper, we propose the arbitration method that calculates the bus utilization of each master. Furthermore, we verify the performance compared with the other arbitration methods through TLM(Transaction Level Model). From the results of performance verification, the arbitration methods of Fixed Priority and Round-Robin can not set the bus utilization and those of TDMA and Lottery happen the error of 50% and 70% respectively compared with bus utilization set by user in more than 100,000 cycles. On the other hand, the bandwidth-award bus arbitration method remains the error of less than 1% since approximately 1000 cycles, compared with bus utilization set by user.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1770-1780
• /
• 1997

Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11B
• /
• pp.698-706
• /
• 2005

In this paper, we investigate the parameters of the IEEE 802.11e MAC protocol, CWmin and AIFS, in terms of their capability of QoS control. The delay and the bandwidth performances are selected as the QoS medics to examine the characteristics of those parameters. A policy on MAC parameters usage, thereby, is proposed. We regard the MAC-level traffic classification as the differentiation in the channel accessibility, and thus the delay differentiation is referred to a main issue of the class-level QoS control. Realizing the tight relationship between the delay performance and the parameter AIFS, we derive an analytical expression of their relationship through an analysis of the MAC mechanism. Various simulations are examined which show the validity of our assertions, and a policy on the parameters usage is proposed based on those observations.