• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.2
• /
• pp.83-92
• /
• 2007

In connectionless packet network, if a sender encrypts packets by block chaining mode and send it to receiver, the receiver should decrypt packets in encrypted order that is not received order. Therefore, the performance and efficiency are lowered for crypto communication system. To solve this problem, we propose packet encryption scheme for connectionless packet network that can decrypt the packets independently, even if the received order of packets are changed or packets are missed. The scheme makes new IV(Initial Vector) using IV that created by key exchange process and salt that made by random number. We propose extended Cryptoki API that added packet encryption/decryption functions and mechanism for improving convenience and performance. We implement the scheme and get result that the performance increased about $1.5{\sim}l5.6$ times compare with in case of implementing using Cryptoki API in the test environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.103-118
• /
• 1996

With the advent of B-ISDN based on ATM technonlogy, ther are increasing needs for the interconnection of existing LAN/MAN's through ATM networks. ATM networks, therefore, must provide connectionless service. In this paper, the traffic distributio scheme using multi-path is proposed to support efficient connectionless service in ATM networks. Because the proposed scheme distributed the bursty traffic arrived in the interworking unit (IWU) and the connectionless server (CLS) from LAN-terminals, it alleviates the packet loss ratio caused by buffer overflow at IWU/CLS and is able to use nettowrk resources efficiently according to the network conditions and the amount of the traffic arrived at IWU/CLS. This paper presents the distribution algorithm and the IWU/CLS, CLS-CLS closed-loop rate control scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.648-652
• /
• 2003

In the GPRS(General Packet Radio Service) network, the transport layer between SGSN(Serving GPRS Support Node) and GGSN (Gateway GPRS Support Node) is based on IP-Over ATM Network. which means that the connectionless IP traffic is transmitted through connection oriented ATM transport layer. Efficient resource management is needed to perform connection and disconnection of the pertinent VC because of the connectionless IP traffic being passed through ATM transport layer In this paper, Internet Web service traffic model in the GPRS network is applied to the various VC holding Cost Pricing Model. each method is compared through analyzing each VC utilization and setup rate.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.316-330
• /
• 2008

This paper proposes a novel method for transporting various types of user traffic effectively over the next generation network called integrated services digital network 3 (ISDN3) (or quantum network) using quantum packets. Basically, a quantum packet comprises one or more 53-byte quanta as generated by a "quantumization" process. While connection-oriented traffic is supported by fixed-size quantum packets each with one quantum to emulate circuit switching, connectionless traffic (e.g., IP packets and active packets) is carried by variable-size quantum packets with multiple quanta to support store-and-forward switching/routing. Our aim is to provide frame-like or datagram-like services while enabling cell-based multiplexing. The quantum packet method also establishes a flexible and extensible framework that caters for future packetization needs while maintaining backward compatibility with ATM. In this paper, we discuss the design of the quantum packet method, including its format, the "quantumization" process, and support for different types of user traffic. We also present an analytical model to evaluate the consumption of network resources (or network costs) when quantum packets are employed to transfer loss-sensitive data using three different approaches: cut-through, store-and-forward and ideal. Close form mathematical expressions are obtained for some situations. In particular, in terms of network cost, we discover two interesting equivalence phenomena for the cut-through and store-and-forward approaches under certain conditions and assumptions. Furthermore, analytical and simulation results are presented to study the system behavior. Our analysis provides valuable insights into the. design of the ISDN3/quantum network.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.