Covert Channel are the methods to conceal a message in the volatile medium carrier such as radio signal and network packets. Until now, covert channels based on the packet length produce abnormal packet length when the length of the message is long. Abnormal packet length, especially in the normal network will expose the covert channels to network security perimeter. Therefore, it motivates the...

In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences scheduling schemes in a way that each scheduled packet should be ensured to be completely transmitted within the scheduled frames. We formulate the PFS problem as an optimization problem. Based on the observations on the struc...

This paper analyzes the p e ~ o r m a n c e of unslotted CDMA random access schemes with heavy-tailed packet length distribution. Most of the previous work cover the analysis of the system with Poisson process and for infinite population and infinite buffer size where the results mainly depend on the mean values of the traffic. In this paper we remove these assumptions and analyze the behavior ...

This paper proposes a novel traffic engineering method for improving the throughput characteristics of optical packet forwarding in an optical packet / path integrated network. This method is based on bypassing optical packets rejected from a highly-loaded optical packet switch onto one of the adjacent packet switches via an optical path to increase the network throughput. Since the formation o...

Traffic flow classification has been attracting an increasing interest. Among the exploited flow features, a key role is played by the sequence of packet lengths. We aim at understanding if and how complex it is to obfuscate this information, referred to as packet length masking. Masking can be obtained by means of padding and fragmenting. We define formally what the ideal target of masking is,...

Most input buffered packet switches internally segment variable-length packets into fixed-length cells. The last cell in a segmented packet will contain overhead bytes if the packet length is not evenly divisible by the cell length. Switch speed-up is used to compensate for this overhead. In this paper, we develop an analytical model of a single-server queue where an input stream of packets is ...