• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.774-782
• /
• 2003

Generally, in the Mobile IP technologies, the use of RSVP(Resource ReSerVation Protocol) is recommended in order to provide a mobile node real-time service. However, the handoff of a mobile node increases the registration delay, RSVP reservation delay and signalling overhead in the Mobile IP and RSVP interworking. Specially, the resource reservation on the path between a mobile node and a correspondent node is the duplicated reservation and then causes unnecessary creation of the signalling overhead and waste of the resource, since the majority of the path before handoff and after handoff is same. If the radius of a cell providing a wireless interface to a mobile node is small, the number of handoff will increase and also signalling overhead and duplicated resource reservation will increase. In this paper, we proposed the integration model of Cellular IP and RSVP with RSVP proxy scheme. Here, Cellular IP protocol minimizes registration delay, transfer delay, and loss by handoff in micro cell network, the RS VP proxy that minimizes the duplication of resource reservation prevents the path for RSVP session from change using the address for reservation of a mobile node. Proposed scheme was evaluated in comparison with the existing Mobile IP and RSVP interworking scheme using the probability of resource reservation fail to the radius of a cell and the handoff rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.435-444
• /
• 2002

In this paper, a novel packet scheduling algorithm, so-called the CSL algorithm is discussed, whereby the firewall property as well as the deterministic delay bound guarantee are supported in session level. Lots of simulation studies validate those properties of the CSL algorithm. The CSL algorithm is distingushable from the well- known EDD scheme in terms of the firewall property. Regarding the implementation complexity, the CSL algorithm turns out to be of 0(1) besides the sorting overhead. Owing to the maintained generic fair queueing structure in the CSL algorithm, a various fair queueing schemes can be applied with minor modification. For the TCP/IP network which is vulnerable to the misbehaving traffic sources, the firewall property of the CSL algorithm is quite useful for the advanced quality of services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3678-3698
• /
• 2017

With the rapid development of vehicular ad hoc Network (VANET), it has gained significant popularity and received increasing attentions from both academics and industry communities in aspects of security and efficiency. To address the security and efficiency issues, a self-authentication and deniable efficient group key agreement protocol is proposed in this paper. The scheme establishes a group between road side units (RSUs) and vehicles by using self-authentication without certification authority, and improves certification efficiency by using group key (GK) transmission method. At the same time, to avoid the attacker attacking the legal vehicle by RSUs, we adopt deniable group key agreement method to negotiation session key (sk) and use it to transmit GK between RSUs. In addition, vehicles not only broadcast messages to other vehicles, but also communicate with other members in the same group. Therefore, group communication is necessary in VANET. Finally, the performance analysis shows superiority of our scheme in security problems, meanwhile the verification delay, transmission overheard and message delay get significant improvement than other related schemes.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.699-717
• /
• 2020

Propagation time on permissionless blockchain plays a significant role in terms of stability and performance in the decentralized systems. A large number of activities are disseminated to the whole nodes in the decentralized peer-to-peer network, thus causing propagation delay. The stability of the system is our concern in the first place. The propagation delay opens up opportunities for attackers to apply their protocol. Either by accelerating or decelerating the propagation time directly without proper calculation, it brings numerous negative impacts to the entire blockchain system. In this paper, we thoroughly review and elaborate on several parameters related to the propagation time in such a system. We describe our findings in terms of data communication, transaction propagation, and the possibility of an interference attack that caused an extra propagation time. Furthermore, we present the influence of block size, consensus, and blockchain scalability, including the relation of parameters. In the last session, we remark several points associated with the propagation time and use cases to avoid dilemmas in the light of the experiments and literary works.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.339-346
• /
• 1999

When a multicast video conference system utilizes RTP (Real Time Protocol) and RTCP (Real Time Control Protocol), the loss rate and the synchronization of transfer in RTCP affect the scalability of the system. The random delay technique introduced to resolve the problems is so simple that leads the network to meet some congestion in synchronizing feedback information when lots of people transfer the feedback information simultaneously, which reduces the scalability of system. In this paper, we propose a new feedback control algorithm that provides priority levels with the RTCP packet, which cuts down the feedback delay and increases the scalability. The criteria of providing priority Based on the decided priority level, Agent forced the session participants to provide much more RTCP packets, positively controlled, and the possible bandwidth can be measured. The simulation on this technique decreases the delay, and the feedback messages are equally distributed on a given time period.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.11
• /
• pp.1045-1050
• /
• 2012

In this paper, we propose an effective routing protocol that can be particularly applied to SDDC (Sangmyung Direct Digital Controller) BAS. We have used NS (Network Simulator)-2 to simulate the real building for SDDC BAS. The static, session, DV (Distance Vector), and LS (Link State) algorithms are used and the protocols for performance comparison and evaluation are compared with respect to end to end delay, throughput, and routing overhead. The simulation results show that the DV algorithm is effective for SDDC BAS.

• East Asian Economic Review
• /
• v.20 no.3
• /
• pp.311-338
• /
• 2016

In the race for establishing trading architecture consistent with new landscape of the global economy, the US is ahead of the game by concluding the Trans Pacific Partnership Agreement with 11 countries. To make it reality, the ratification is essential. In the battle for ratification in the US, declining globalism confronts rising protectionism. This paper models the ratification process as contest between globalism and protectionism, and analyzes the optimal timing for ratification. Based on this framework, various ratification scenarios are analyzed. The paper argues less likelihood for the lame-duck session passage and more likelihood for prolonged and protracted delay, due to changing political dynamics and declining intellectual support for globalism. Hence, the future of Trans Pacific Partnership Agreement may prove different, compared to the North American Free Trade Agreement and the Korea-US Free Trade Agreement, both of which were renegotiated and ratified eventually. Then, the US would lose the first move advantage. The paper also discusses strategic implications of delayed ratification on the evolution of trading architecture in East Asia.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.82-102
• /
• 2008

Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.1017-1024
• /
• 2004

In this paper, we propose the progressed interworking method between H.323 and SlP, then explain the improved property. The VolP(Voice over Internet Protocol) technology which is able to use a voice service through internet is more cheaper then existing telephone charges, and is easil)· accept the various of multimedia services from internet. Previous connectionmethod of VoIP used H.323 protocol, but it is very complex to connection establishment. so, the SIP(Session Initiation Protocol) protocol that propose in SIP-Working Group is in use recently. Therefore, we need new interworking methodology between H.323 and SIP Products. In this thesis, the progress interworking method between H.323 and SIP are Propose, then interpret unnecessary packet delay for call setup and improved feature of message exchange.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.820-827
• /
• 2010

In these days, video applications for special purposes such as video conference systems among multiple users and video surveillance systems require multiple video connections and QoS guarantee. The video systems employ IEEE 802.11 Wireless LAN devices to support broadband wireless interfaces and easy internet accesses for cheaper prices. However, according to the current IEEE 802.11e HCCA standard, if more than three video sessions are established in WSTA services, some of them must share the TXOP because the available number of TSIDs for video transmission is two. In order to resolve the problem, we devised a method which can establish up to 15 video sessions by slightly modifying the frame structure while maintaining the compatibility with current standard. Our method is implemented on the NCTUns 4.0 network simulator, and evaluated not only numerically in terms of throughput, delay, and PSNR, but also experimentally in the sense of real video clips that are used as input to our simulation. The results showed that our method sufficiently guarantees the transmission bandwidth requested by each video session.