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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2427-2445
• /
• 2016

In contrast to traditional "store-and-forward" routing mechanisms, network coding offers an elegant solution for achieving maximum network throughput. The core idea is that intermediate network nodes linearly combine received data packets so that the destination nodes can decode original files from some authenticated packets. Although network coding has many advantages, especially in wireless sensor network and peer-to-peer network, the encoding mechanism of intermediate nodes also results in some additional security issues. For a powerful adversary who can control arbitrary number of malicious network nodes and can eavesdrop on the entire network, cryptographic signature schemes provide undeniable authentication mechanisms for network nodes. However, with the development of quantum technologies, some existing network coding signature schemes based on some traditional number-theoretic primitives vulnerable to quantum cryptanalysis. In this paper we first present an efficient network coding signature scheme in the standard model using lattice theory, which can be viewed as the most promising tool for designing post-quantum cryptographic protocols. In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols. Our scheme has many advantages, such as supporting multi-source networks, low computational complexity and low communication overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1207-1214
• /
• 2002

A scheduling scheme for high speed networks requires a low time complexity to schedule packets in a packet transmission time. High speed networks support a number of connections, different rates for each connection and variable packet length. Conventional round robin algorithms have a time complexity of O(1), but their short time fairness, latency and burstiness depend on the quantum of a connection due to serving several packets for a backlogged connection once a round. To improve these properties, we propose in this paper an efficient packet scheduling scheme which is based on the credits of a connection and has a time complexity of O(1). We also analyzed its performance in terms of short time fairness, latency and burstiness. The analysis results show that the proposed scheme can improve the performance compared with traditional round robin schemes. The proposed scheme can be easily utilized in high speed packet networks.