1 January 2006 in Photonic Network Communications
1 August 2010 in Computer Networks
4 March 2010 in IEEE Transactions on Vehicular Technology
Network coding has the potential to greatly improve the throughput of wireless networks. In the current proposals for wireless network coding, network nodes transmit packets at a fixed transmission rate. It is notable, however, that by dynamically selecting the rate, we can effectively improve the node transmission efficiency. In this paper, we study the application of a rate-adaptive transmission mechanism in network-coding-based multihop wireless networks. In such networks, whether a coding solution is satisfactory or not depends not only on the number of involved native packets but on the packet loss probabilities of its intended next hops and its transmission time as well, both of which depend on the transmission rate. Therefore, we aim to jointly design the coding operation and rate selection to maximize the transmission efficiency. Specifically, we first describe and mathematically formulate the optimal packet coding and rate-selection problem. Then, we prove the NP-completeness of this optimization problem. Finally, we propose an efficient algorithm for finding good combinations of the coding solution and the transmission rate. Simulation results demonstrate that compared with the rate-fixed transmission, the rate-adaptive transmission based on our algorithm can significantly improve the node transmission efficiency.
1 September 2005 in IEICE Transactions on Information and Systems
14 April 2009 in Journal of Lightwave Technology
We consider traffic scheduling in performance guaranteed switches with optical fabrics to ensure 100% throughput and bounded packet delay. Each switch reconfiguration consumes a constant period of time called reconfiguration overhead, during which no packet can be transmitted across the switch. To minimize the packet delay bound for an arbitrary traffic matrix, the number of switch configurations in the schedule should be no larger than the switch size N . This is called minimum delay scheduling, where the ideal minimum packet delay bound is determined solely by the total overhead of the N switch reconfigurations. A speedup in the switch determines the actual packet delay bound, which decreases toward the ideal bound as the speedup increases. Our objective is to minimize the required speedup S schedule under a given actual packet delay bound. We propose a novel minimum delay scheduling algorithm quasi largest-entry-first (QLEF) to solve this problem. Compared with the existing minimum delay scheduling algorithms MIN and alphai-SCALE, QLEF dramatically cuts down the required S schedule bound. For example, QLEF only requires S schedule=17.89 for N=450, whereas MIN and alphai -SCALE require S schedule=37.13 and 27.82, respectively. This gives a significant performance gain of 52% over MIN and 36% over alphai-SCALE.
1 June 2006 in The Journal of Supercomputing