This paper presents a new approach to global clock distribution in which traditional tree-driven grids are augmented with onchip inductors to resonate the clock capacitance at the fundamental frequency of the clock node. Rather than being dissipated as heat, the energy of the fundamental resonates between electric and magnetic forms. The clock drivers must only provide the energy necessary to o...

This paper studies a generic model for cooperative cognitive radio networks where the secondary user is equipped with a finite length relaying queue as well as a finite length battery queue. Our prime objective is to characterize the stable throughput region. Nevertheless, the complete characterization of stable throughput region is notoriously difficult, since the computation of the steady sta...

This paper considers the comparison of two ðs; SÞ production inventory systems with retrials of unsatisfied customers. The time for producing and adding each item to the inventory is exponentially distributed with rate b. However, a production rate ab higher than b is used at the beginning of the production. The higher production rate will reduce customers’ loss when inventory level appro...

We propose a systematic method to determine the lower bound for internal buffering of practical CIOQ switching systems. To this end we introduce a deterministic traffic scenario that stresses the global stability of finite output queues. We demonstrate its usefulness by dimensioning the buffer capacity of the CIOQ under such traffic patterns. Compliance with this property maximizes the performa...

We study DMC and AWGN channels when the transmitter harvests energy from the environment. These can model wireless sensor networks as well as Internet of Things. We study such channels with infinite energy buffer in the finite blocklength regime and provide the corresponding achievability and converse results. Index Terms Achievable rates, Converse, Channel Capacity, Finite Blocklength, EH-AWGN...

Banyan networks are being proposed for interconnecting memory and processor modules in multiprocessor systems as well as for packet switching in communication networks. This paper describes an analysis of the performance of a packet switch based on a single-buffered Banyan network. A model of a single-buffered Banyan network provides results on the throughput, delay, and internal blocking. Resu...

This paper presents a scalable caching algorithm of proxy server with the finite storage size minimizing client s buffer size and constant-bit-rate channel bandwidth. Under the general video traffic condition, it is observed that the amount of decreased client s buffer size and channel bandwidth after caching a video frame depends on the relative frame position in the time axis as well as the f...

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

—We propose a systematic method to determine the lower bound for internal buffering of practical CIOQ switching systems. To this end we introduce a deterministic traffic scenario that stresses the global stability of finite output queues. We demonstrate its usefulness by dimensioning the buffer capacity of the CIOQ under such traffic patterns. Compliance with this property maximizes the perform...