Pure all-optical packet-switched networks in which both header processing and packet routing are carried out in the optical domain overcome the bandwidth bottlenecks of optoelectronic conversions and therefore are expected to meet the needs of next generation high speed networks. Due to the limited capabilities of available optical logic devices, realizations of pure all-optical packet-switched networks in the near future will likely employ routing schemes that minimize the complexity of routing control. In this paper, we propose a novel self-routing scheme that identifies the output ports of the nodes in a network instead of the nodes themselves. The proposed address scheme requires single bit processing only and is applicable to small to medium size pure all-optical packet-switched networks with arbitrary topologies. Unlike traditional self-routing schemes, multiple paths between two nodes can be defined. Hierarchical address structure can be used in the proposed routing scheme to shorten the address.

Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discovery, overlay topology formation, fairness and incentive issues, etc. However, little attention has been paid to investigate the data distribution problem which is also a core component of any file sharing application. In this paper, we present the first effort in addressing this collaborative file distribution problem and formally define the scheduling problem in a simplified context. We develop several algorithms to solve the problem and study their performance. We deduce a theoretical bound on the minimum download time experienced by users and also perform simulations to evaluate our algorithms. Simulation results show that our graph-based dynamically weighted maximum-flow algorithm outperforms all other algorithms. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications.

This paper investigates optimal transmission of space-time block codes (STBCs) in distributed multiple-input multiple-output (D-MIMO) Rayleigh fading channels. The optimal diversity performance is achieved through transmit power allocation implemented at the receiver based on transmit and receive correlations to minimize the average symbol error rate (SER). Evaluation of SER performance of uncoded STBCs over a generalized distributed antenna (DA) topology is first presented, with exact analytical SER expressions derived for MQAM and MPSK symbols. SER upper bounds are also derived, based on which two criteria for complexity reduced antenna subset selection with sub-optimal power allocation are further proposed, whose performance approaches optimal over correlated D-MIMO channels. Moreover, a novel simplified but close SER approximation scheme is devised to significantly facilitate optimal SER calculation. We continue to thoroughly analyze how the optimal diversity is affected by large scale fading, targeted data rate, antenna correlations and transmit power. Finally, we develop a surprisingly close and useful analogy between open loop STBCs in co-located MIMO and optimal STBCs in D-MIMO with minimum feedback (i.e., n bits for n DAs in Criterion 2 with power allocation scheme 2 which equally allocates power to the selected DAs). Extensive simulation results have been presented to demonstrate the effectiveness of our analysis.