• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.70-84
• /
• 2006

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.75-81
• /
• 2012

This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.412-415
• /
• 2004

As computers and networks become popular, corporation or country organization composes security network including various kinds information protection system to protect informations and resources from internet and is operating system and network. But current firewall and IDS(Intrusion Detection System) of the network level suffers from many vulnerabilities in internal computing informations and resources. In this paper, we design of ICMP-based Traceback System using a ICMP Traceback Message for efficiently traceback without change structure of routers. ICMP-based Traceback System. Create of ICMP message is managed by “Traceback Agent” mirroring port for router. Victim's systems that are received the message store it and “Traceback Manager” is detect a attack(like a DDoS). Using a information of this message starting a traceback and detecting a source of attacker, so response a attack.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.409-416
• /
• 2006

Real-time traveler information disseminated through Variable Message Signs (VMS) is known to have effects on driver route choice decisions. In the past, many studies have attempted to optimize the system performance using VMS message content as the primary control variable of driver route choice. This research proposes a VMS information provision optimization model which searches the best combination of VMS message contents and display sequence to minimize the total travel time on a highway network considered. The driver route choice models under VMS information provision are developed using a stated preference (SP) survey data in order to realistically capture driver response behavior. The genetic algorithm (GA) is used to find the optimal VMS information provision strategies which consists of the VMS message contents and the sequence of message display. In the process of the GA module, the system performance is measured using micro traffic simulation. The experiment results highlight the capability of the proposed model to search the optimal solution in an efficient way. The results show that the traveler information conveyed via VMS can reduce the total travel time on a highway network. They also suggest that as the frequency of VMS message update gets shorter, a smaller number of VMS message contents performs better to reduce the total travel time, all other things being equal.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1874-1885
• /
• 2000

When a receiver of ciphertext message can not decrypt a message because he has lost his private-key, the private-key of receiver and session-key of the message should be recovered. In this paper, we developed an Encapsulation based Key Recovery System (EKRS). EKRS is a new key encapsulation based key recovery system which is characterized by secretly choice of KRA, randomized target keys. n-way recovery type, and useful for commercial key recovery. EKRS is formally specified by a pictorial model, an Extended Cryptographic Timed Petri Net (ECTPN). Secure information flow and reachability of a session-key are verified by using reachability graph of ECTPN. EKRS, executing over a Public Key Infrastructure, can be used as a security solution in Web based applications such as CALS, EC an EDI.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.5
• /
• pp.21-29
• /
• 1992

This paper proposes a new MAC propocol for high-speed MAN. The proposed protocol is based on the P$_1$-persistent tranmission scheme and each node calculates the transmission probability periodically by using delay information(DI). A window mechanism for the calculation of message delay in each node is proposed to improve the adaptability of the proposed protocol to traffic changes. The capactiy of the proposed protocol is analyzed. The simulation results show that the proposed protocol gives fair message delay under heavy load conditions and, when the transmission speed or distance is increased, the message delay variation of the proposed protocol is less than that of IEEE 802.6 DQDB.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.336-337
• /
• 2016

FHIR is a protocol that enables easy data exchange from the time the event occurred in health care settings as a standard for next-generation message exchange of HL7. Create a meaningful message from the ECG and medical equipment, and express the messages generated by standardized FHIR message it will be used in various medical institutions to ensure delivery to EMR, such as hospital information systems can query the results via a smartphone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.926-938
• /
• 1996

In this paper, we proposed a new multicast algorithm which is efficiently applicable to overlapped process group environments where one process may be involved in several process groups. Unlike the esisting algorithms, the proposed one provides an efficient group communication mechanism by generating the processgroup information in two-level tree. Using this algorithm, we improved the shortcoming of the existing algorithms by reducing the overhead in passing through unnecessary processes for message ordering. We have provided the causal ordering method as well as the total ordering method in group communication environments. As a result, we allow one process to deliver message to other processes with a short delay time, and reduced the overhead required for the message ordering. Also, we logically proved the proposed causal ordering method, and compared the performance of the proposed algorithm with ones of other existing algorithms by computer simulation.

• Journal of information and communication convergence engineering
• /
• v.19 no.1
• /
• pp.16-21
• /
• 2021

In this paper, to prevent accidents of school vehicles used by students, which have emerged as a continuous social problem, a boarding and leaving notification system using Bluetooth beacons is proposed. The platform structure uses Bluetooth, a smartphone, and an application, and provides real-time message reception between parents and teachers. It is not simply a system with Bluetooth capability alone, but also an IcT technology that is closely related to real life using two-way communication. The purpose is to provide user-friendly ICT technology as an integrated system for more practical effects. Two-way exchange of information between parents and teachers using cloud servers is made possible. By using this Bluetooth beacon notification system, safety accidents in student vehicles are reduced, which brings confidence from traffic accidents to schoolchildren of parents and teachers. Therefore, it is expected that parents and teachers are expected to improve their mental stability and quality of life from traffic accidents.

• Annual Conference of KIPS
• /
• 2009.11a
• /
• pp.223-224
• /
• 2009

A wireless ad hoc network is a decentralized wireless network. The network is ad hoc because each node is willing to forward data for other nodes, and so the determination of which nodes forward data is made dynamically based on the network connectivity. In this paper, we proposed new route maintenance algorithm to improve the efficiency and effective in order to reach destination node. In this algorithm we improve existing route maintenance in Dynamic Source Routing protocol, to improve the algorithm we make a new message we call Emergency Message (EMM). The emergency message used by the node moved to provide information of fault detection.