• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.253-253
• /
• 1999

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.51-54
• /
• 2003

This paper describes the design and implementation of HNCP bundle in the OSGi framework targeted to the home network system. The developed home network system is composed of a home server and several networked home appliances, and is connected via residential gateway to the external access network. The developed HNCP bundle allows a user to control and monitor home appliances in HNCP domain. We show the feasibility of the implemented HNCP bundle in the OSGi framework.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.29-46
• /
• 1998

In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network(LATN) design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot. an entering variable is selected by detecting the Locally Most Violated(LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN design problem can be solved in O(n$^2$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN design problem with n＝150 and H＝1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.54-68
• /
• 1995

In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network (LATN) Design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column. Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot, an entering variable is selected by detecting the Locally Most Violated (LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN Design problem can be solved in O(n$^{2}$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN Design problem with n = 150 and H = 1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.35-57
• /
• 2014

Multi-criteria decision making (MCDM) algorithms play an important role in ensuring quality of service in an integrated HetNets (Heterogeneous Networks). The primary objective of this paper is to develop a multi-criteria vertical handoff decision algorithm (VHDA) for best access network selection in an integrated Wireless Local Area Network (WLAN)/Universal Mobile Telecommunications System (UMTS)/Worldwide Interoperability for Microwave Access (WiMAX) system. The proposed design consists of two parts, the first part is the evaluation of an Analytic Hierarchy Process (AHP) to decide the relative weights of handoff decision criteria and the second part computes the final score of the weights to rank network alternatives using Simple Additive Weighting (SAW). SAW ranks the network alternatives in a faster and simpler manner than AHP. The AHP-SAW mathematical model has been designed, evaluated and simulated for streaming video type of traffic. For other traffic type, such as conversational, background and interactive, only simulation results have been discussed and presented in brief. Simulation results reveal that the hierarchical modelling and computing provides optimum solution for access network selection in an integrated environment as obtained results prove to be an acceptable solution to what could be expected in real life scenarios.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.10a
• /
• pp.7-10
• /
• 1984

In this paper, the advantages of buffer insertion access method in comparison with other access methods to local area networks are analyzed. Sending and Receiving protocols in a data link layer are designed by a software method, We have derived both qeueing delays and the response time for the performance model that is proposed in this paper, and using the computer simulation, analyzed the performance for the proposed model in terms of the throughput rate- response time characteristrics. Based on the proposed model, the hardware design is implemented.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.493-501
• /
• 2016

In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.

• ETRI Journal
• /
• v.24 no.3
• /
• pp.251-254
• /
• 2002

We developed a method for optimal superframe design in the multi-frequency time division multiple access (MF-TDMA) return-link of a satellite multimedia interactive network called a digital video broadcasting return channel over satellite (DVB-RCS) sub-network. To find the optimal superframe pattern with the maximum data throughput, we formulated the design problem as a non-linear combinatorial optimization problem. We also devised the proposed simple method so that it would have field applicability for improving radio resource utilization in the MF-TDMA return link.

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

• Convergence Security Journal
• /
• v.5 no.1
• /
• pp.35-43
• /
• 2005

It is need to control network access that a user personally change own IP or network devices in managing network address. Also, When we use new network devices or assign network address, we do them by design, not arbitrarily. And then, we can immediately control network's problems. It could be used network management and security in low level. But most of managers do this works by hand not automatically. This paper propose the solutions that improve the security by network address authentication in VLAN environment, such as corporations and public offices.