• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.441-450
• /
• 2008

Recently, access control on form-based web information systems has become one of the useful methods for implementing client systems in a service-oriented architecture. In particular, XForms language is being adopted in many systems as a description language for XML-based user interfaces and server interactions. In this paper, we propose an efficient algorithm for the evaluation of XPath-based access rules for XForms pages. In this model, an XForms page is a sequence of queries and the client system performs user interface realization along with XPath rule evaluations. XPath rules have instance-dependent predicates, which for the most part are shared between rules. For the efficient evaluation of shared predicate expressions in access control rules, we proposed a predicate graph model that reuses the previously evaluated results for the same context node. This approach guarantees that each predicate expression is evaluated for the relevant xml node only once.

• Journal of the Korean Society for Railway
• /
• v.19 no.2
• /
• pp.159-169
• /
• 2016

The current railway control system in Korea is comprised of signaling, electric rail power, communication, and maintenance systems that are independent of each other. Further, these systems have different mediums and protocols for transmitting the field equipment data to the central control system. The Safety Supervision System has as its purpose the collecting of safety-related data from each system to predict and prevent accidents, this system utilizes standard protocol. Safety-related data need to be collected from field data transmission devices of the existing control system, the data should be collected without affecting the communication of the existing system. In this study, sniffing skill, which is typically used for network traffic monitoring or security, is used to collect data. The problems arising from the use of sniffing devices are noted, and the Packet Conversion Node is proposed as a solution to the problems. Further, functional and performance testing were completed for the prototype, and the software architecture and packet conversion process were verified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1A
• /
• pp.24-35
• /
• 2008

We propose a tree-based integrated network of infrastructure network and mobile ad hoc network to effectively support Mobile IP for mobile ad hoc networks and also proposed a network management protocol for formation and management of the integrated network and a tree-based routing protocol suitable for the integrated network. The integrated network has fixed gateways(IGs) that connect two hybrid networks and the mobile nodes in the network form a small sized trees based on the mobile nodes that are in the communication distance with a IG. A new node joins an arbitrary tree and is registered with its HA and FA along tree path. In addition, the proposed protocol establishes a route efficiently by using the tree information managed in every node. We examined the effectiveness of the tree-based integrated network for some possible network deployment scenarios and compared our routing protocol against the Mobile IP supported AODV protocol.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.193-204
• /
• 2012

This paper specifies a low-cost global mobility management architecture and protocol procedure called LC-$GM^2$, which is based on Proxy Mobile IPv6. In LC-$GM^2$, mobility management is performed by the network entity. The benefit is the elimination of the wireless link data delivery tunnel overhead between a mobile node and the access router. To compare with the well-known Hierarchical Mobile IPv6 mobility management protocol and GPMIP, the location update, packet delivery, and total cost functions generated by a mobile node during its average domain residence time are formulated for each protocol based on Fluid-flow mobility model. Then, the impacts of various system parameters on the cost functions are analyzed. The analytical results indicate that the proposed global mobility management protocol can guarantee lower total costs.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.363-372
• /
• 2009

For large scale VOD service, cluster servers are spotlighted to their high performance and low cost. A cluster server usually consists of a front-end node and multiple back-end nodes. Though increasing the number of back-end nodes can result in the more QoS streams for clients, the possibility of failures in back-end nodes is proportionally increased. The failure causes not only the stop of all streaming service but also the loss of the current playing positions. In this paper, when a back-end node becomes a failed state, the recovery mechanisms are studied to support the unceasing streaming service. For the actual VOD service environment, we implement a cluster-based VOD servers composed of general PCs and adopt the parallel processing for MPEG movies. From the implemented VOD server, a video block recovery mechanism is designed on parity algorithms. However, without considering the architecture of cluster-based VOD server, the application of the basic technique causes the performance bottleneck of the internal network for recovery and also results in the inefficiency CPU usage of back-end nodes. To address these problems, we propose a new failure recovery mechanism based on the pipeline computing concept.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.729-741
• /
• 1999

ATM networks are widely deployed as the network that is capable of supporting multimedia services efficiently now. To date, a large portion of ATM connections, particularly in the WAN environment, have been of a permanent virtual circuits-requiring management intervention for set-up and tear-down. However, switched virtual circuits are required to support a range of desired characteristics on demand, to a reachable end user. To establish, maintain and release on-demand call/connections, the user-network interface(UNI) and node-node interface(NNI) signalling capabilities are required. Two protocols have been specified for NNI signalling within a public network: the broadband integrated-services user part(B-ISUP) protocol specified by the ITU-T, and the private network-network interface(PNNI) protocol specified by the ATM Forum. PNNI offers different type of internetwork or internodal interface from the traditional B-ISUP approach favored to date public network operators. In spite of its name, PNNI may find its place in network service provide networks as well as in private networks. Thus many public network operators and ATM equipment manufacturers are still unable to choose the NNI interface architecture of their system. In this paper, we survey the characteristics of the B-ISUP and PNNI protocols, and investigate the applicability issue of these specifications to the ATM-based Information Infra-Network of Korea. Analyzing the characteristics of the two protocols and clarifying the NNi requirements of the ATM-based Information Infra-Network of Korea, we propose that the B-ISUP protocol is more suitable than PNNI.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.733-742
• /
• 2002

It has been known that the host mobility feature has very significant impact on the QoS (Quality of Service), which is usually required to a real-time multimedia application. The existing QoS support mechanisms to provide the real-time services to fixed network environment, like as RSVP, are inadequate to accommodate the mobile hosts which can frequently change their point of attachments to the fixed network. So, MRSVP (Mobile RSVP) protocol has been proposed to reduce the impacts of host mobility on QoS guarantees, in which a mobile host needs to make advance resource reservations at multiple locations it may possibly visit during the lifetime of the connection. This paper proposes a dynamic dual anchor node (DDAN) architecture which integrates the MRSVP and RSVP tunnel, in addition to the Mobile IP Regional Registration protocol. By limiting the resource reserved in local area, it preserves the lower level of resource reservation, but provides approximately the same degree of QoS support as the existing MRSVP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.796-806
• /
• 2003

Mobile Node usually communicate with CN bia only it's own HA but Nested Mobile Networks correspond with CN bia all HA involved with them. when Mobile Network of a MR moves from its home link to a foreign link in the stationary network. then Mobile Network of another MR moves from its home link in stationary network to foreign link in previous mobile network. CN send Packet destined to the latter MR via both Home Agent of the former MR and the latter MR. There are two problem in this scenario. One is inefficient routing path that bypass via several HA. the other is waste of transmission resource and delay of Registration process which change of Nested Mobile Network Architecture cause Mobile Router. so We propose MRA(Mobile Relay Agent) to support effective routing by local mobility management.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.465-476
• /
• 2005

The wireless sensor network consists of a number of sensor nodes which have physical constraints. Each sensor node senses surrounding environments and sends the sensed information to Sink. In order to alleviate the inherent vulnerability in security of the wireless sensor nodes with the hardware constraints, the lightweight security protocol is needed and a variety of research is ongoing. In this paper, we propose a non-hierarchical sensor network and a security protocol that is suitable for monitoring man-made objects such as bridges. This paper, furthermore, explores a two-layer authentication, key distribution scheme which distributes the key and location of a sensor node in advance, and an effective security routing protocol which can take advantage of the Sleep and Awake state. This also results in the increased data transfer rate by increasing the number of alternative routing paths and the reduced energy consumption rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.942-947
• /
• 2008

A cluster server usually consists of a front end node and multiple backend nodes. Though increasing the number of bookend nodes can result in the more QoS(Quality of Service) streams for clients, the possibility of failures in backend nodes is proportionally increased. The failure causes not only the stop of all streaming service but also the loss of the current playing positions. In this paper, when a backend node becomes a failed state, the recovery mechanisms are studied to support the unceasing streaming service. The basic techniques are hewn as providing very high speed data transfer rates suitable for the video streaming. However, without considering the architecture of cluster-based VOD server, the application of these basic techniques causes the performance bottleneck of the internal network for recovery and also results in the inefficiency CPU usage of backend nodes. To resolve these problems, we propose a new failure recovery mechanism based on the pipeline computing concept.