• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.10
• /
• pp.89-100
• /
• 2007

Consumer Portal is defined as "a combination of hardware and software that enables two-way communication between energy service provider(ESP, like KEPCO) and equipment within the consumer's premises". The portal provides both a physical link(between wires, radio waves, and other media) and a logical link(translating among language-like codes and etiquette-like protocols) between in-building and wide-area access networks. Thus, the consumer portal is an important, open public shared infrastructure in the future vision of energy services. In this paper, we describe a new methodology for local communication and computer network capacity design of consumer portal, and also presents capacity calculation method using a network system limitation factors. By the approach, we can check into the limitations of existing methods, and propose an improved data processing algorithm that can expand the maximum number of the networked end-use devices up to $30{\sim}40$ times. For validation, we applies the proposed methode to our real system design. Our contribution will help electrical power information network design.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.537-544
• /
• 2007

A home network is a residential local area network in which digital home appliances are connected with each other. Applying the mobile agent technology to the home network is expected to provide a new computing model. In particular, mobility and asynchronous ability of mobile agent can be used to reduce network traffic generated for managing home appliances. However, in order to apply the mobile agent concept to the home network, access control for mobile agents is necessary. In the existing home network system, there is one special server, sometimes called home server This server generally has mapping tables to be updated periodically, which describes access control lists between users' authorities and corresponding devices. In this paper, we propose a role-based access control framework with mobile agents in home networks. This framework, called Secure KAgent framework, is designed and implemented based on KAgent system. It has two main characteristics: to control access permissions based on Role-Based Access Control(RBAC) scheme and to safety assign roles to mobile agents by role tickets.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.519-524
• /
• 2007

One of the most important issues on the sensor network with resource limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achieve a long lived sensor network is the clustering mechanism which can be further classified into the single hop mode and the multi hop mode. The single hop mode requires that all sensor nodes in a cluster communicate directly with the cluster head(CH) via single hop md, in the multi hop mode, sensor nodes communicate with the CH with the help of other Intermediate nodes. One of the most critical factors that impact on the performance of the existing multi hop clustering mechanism is the cluster size and, without the assumption on the uniform node distribution, finding out the best cluster size is intractable. Since sensor nodes in a real sensor network are distributed non uniformly, the fixed size mechanism may not work best for real sensor networks. Therefore, in this paper, we propose a new dynamic size multi hop clustering mechanism in which the cluster size is determined according to the distance from the sink to relieve the traffic passing through the CHs near the sink. We show that our proposed scheme outperforms the existing fixed size clustering mechanisms by carrying out numerical analysis and simulations.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.691-700
• /
• 2003

Due to the fast development of wire&wireless internet and computer hardware, more and more internet services are being developed, such as Internet broadcast, VoD (Video On Demand), etc. So QoS (Qualify of Service) is essentially needed to guarantee the quality of these services. Traditional Internet is Best-Effort service in which all packets are transported in FIFO (First In First Out) style. However, FIFO is not suitable to guarantee the quality of some services, so more research in QoS router and QoS protocol are needed. Researched QoS router and protocol are high cost and inefficient because the existing infra is not used. To solve this problem, a new QoS control method, named Network Adaptive QoS, is introduced and applied to client/server-based streaming systems. Based on network bandwidth monitoring mechanism, network adaptive QoS control method can be used in wire&wireless networks to support QoS in real-time streaming system. In order to reduce application cost, the existing streaming service is used in NAQoS. A new module is integrated into the existing server and client. So the router and network line are not changed. By simulation in heavy traffic network conditions, we proved that stream cannot be seamless without network adaptive QoS method.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.461-470
• /
• 2005

This paper suggests a new policy for consolidating a company's profits by segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM, which is mainly applied to marketing. In this case, CRM refers to the strategy of consolidating a company's profits by efficiently managing the clients, providing them with a more effective, personalized service, and managing the resources more effectively. For the realization of a new service policy, this paper analyzes the level of contribution $vis-\acute{a}-vis$ the clients' service pattern (total number of visits to the homepage, service type, service usage period, total payment, average service period, service charge per homepage visit) and profits through the cluster analysis of clients' data applying the K-Means Method. Clients were grouped into 4 clusters according to the contribution level in terms of profits. Likewise, the CRFA (Client Request Filtering algorithm) was suggested per cluster to allocate media server resources. CRFA issues approval within the resource limit of the cluster where the client belongs. In addition, to evaluate the efficiency of CRFA within the Client/Server environment the acceptance rate per class was determined, and an evaluation experiment on network traffic was conducted before and after applying CRFA. The results of the experiments showed that the application of CRFA led to the decrease in network expenses and growth of the acceptance rate of clients belonging to the cluster as well as the significant increase in the profits of the company.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.627-636
• /
• 2005

This paper presents a PC cluster-based distributed video on demand (VOD) server that minimizes the load of the interconnection network by adopting channel bonding-based MVIA and the interval cache algorithm Video data is distributed to the disks of each server node of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large volume of video data transferred. We adopt two techniques to reduce the load of the interconnection network. First, an Msupporting channel bonding technique is adopted for the interconnection network. n which is a user-level communication protocol that reduces the overhead of the TCP/IP protocol in cluster systems, minimizes the time spent in communicating. We increase the bandwidth of the interconnection network using the channel bonding technique with MThe channel bonding technique expands the bandwidth by sending data concurrently through multiple network cards. Second, the interval cache reduces traffic on the interconnection network by caching the video data transferred from the remote disks in main memory Experiments using the distributed VOD server of this paper showed a maximum performance improvement of $30\%$ compared with a distributed VOD server without channel bonding-based MVIA and the interval cache, when used with a four-node PC cluster.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.219-226
• /
• 2006

The shortest path is only maintained during short time because network topology changes very frequently and each mobile nodes communicate each other by depending on battery in MANET(Mobile Ad-hoc Network). So many researches that are to overcome a limitation or consider a power have executed actively by many researcher. But these protocols are considered only one side of link stability or power consumption so we can make high of stability but power consumption isn't efficient. And also we can reduce power consumption of network but the protocol can't make power consumption of balancing. For that reason we suggest RBSSPR(Residual Battery Capacity and Signal Strength Based Power-aware Routing Protocol in MANET). The RBSSPR considers residual capacity of battery and signal strength so it keeps not only a load balancing but also minimizing of power consumption. The RBSSPR is based on AODV(Ad-hoc On-demand Distance Vector Routing). We use ns-2 for simulation. This simulation result shows that RBSSPR can extense lifetime of network through distribution of traffic that is centralized into special node and reducing of power consumption.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.881-890
• /
• 2005

Over for the past 10 years, the increase in geometric progression for the internet traffic, has allowed the IP protocol framework to be the most important network technology. In addition, the internet service is being developed as a service mode differentiated, aiming to support the new-mode real-time multimedia services such as internet phone, video conference, cyber reality, and internet game, focusing on offering a latest service. These days, aiming to solve the need for broad bandwidth along with guaranteeing QoS, the WDM technology of offering multiple gigabit wavelengths is emerging as the core technology of next-generation optical internet backbone network. In the next-generation optical internet backbone network based on WDM, the QoS framework is one of fore subjects aiming to offer a service of guaranteeing QoS This study analyzes the requirements of performance related to QoS framework in IP Subnet and in WDM optical backbone network, and suggests optical QoS service framework differentiated. in order to guarantee end-to-end QoS through the next-generation optical internet backbone network, using GMPLS control protocol.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.53-60
• /
• 2008

Streaming media has contributed to a significant amount of today's Internet Traffic. Like traditional web objects, rich media objects can benefit from proxy caching, but caching streaming media is more of challenging than caching simple web objects, because the streaming media have features such as huge size and high bandwidth. And to support various bandwidth requirements for the heterogeneous ubiquitous devices, a transcoding proxy is usually necessary to provide not only adapting multimedia streams to the client by transcoding, but also caching them for later use. The traditional proxy considers only a single version of the objects, whether they are to be cached or not. However the transcoding proxy has to evaluate the aggregate effect from caching multiple versions of the same object to determine an optimal set of cache objects. And recent researches about multimedia caching frequently store initial parts of videos on the proxy to reduce playback latency and archive better performance. Also lots of researches manage the contents with segments for efficient storage management. In this paper, we define the 9-events of transcoding proxy using 4-atomic events. According to these events, the transcoding proxy can define the next actions. Then, we also propose the segment-based caching policy for the transcoding proxy system. The performance results show that the proposing policy have a low delayed start time, high byte-hit ratio and less transcoding data.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.615-622
• /
• 2006

Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.