20 January 2021 in IEEE Transactions on Mobile Computing
Edge devices with sensing, storage, and communication resources are penetrating our daily lives. These resources make it possible for edge devices to conduct data transactions (e.g., micro-payments, micro-access control). The blockchain technology can be used to ensure transaction unmodifiable and undeniable. In this paper, we propose a blockchain system that adapts to the limitations of edge devices. The new blockchain system can fairly and efficiently allocate storage resources on edge devices, which makes it scalable. We find the optimal peer nodes for transaction data storage and propose a recent block storage allocation scheme for quick retrieval of missing blocks. We develop data migration algorithms to dynamically reallocate data and block storage to adapt topology changes in the network. The proposed blockchain system can also reach consensus with low energy consumption in edge devices with a new Proof of Stake mechanism. Extensive simulations show that our proposed blockchain system works efficiently in edge environments. On average, the new system uses 18.4 percent less time and consumes 87 percent less battery power when compared with traditional blockchain systems.
21 March 2018 in IEEE Transactions on Parallel and Distributed Systems
Interconnection networks lie in the heart of all types of parallel architectures, because how processors or memory modules are connected to each other has a significant impact on the scalability, reliability, cost and performance. For example, a nonblocking interconnection network delivers guaranteed path availability to any connection requests, without interference to existing connections. Also, an interconnection network with multicast capability can distribute data from a single source to all the destinations in a one-shot manner, eliminating unnecessary duplications and minimizing communication delays. However, implementing nonblocking multicast networks imposes great challenges to designers because both of them demand high hardware cost. To deal with this problem, in this paper we propose a novel interconnection network, named Multicast Capable Low-cost Network (MCL), which is both nonblocking for multicast traffic and cost-efficient. We first design the topologies and routing algorithms for MCL, and then prove its nonblocking multicast properties. Most importantly, we show that MCL achieves the lowest hardware cost in terms of asymptotic number of crosspoints. Specifically, the theoretical upper bound on the crosspoints of an $N \times N$ MCL is $O(N\;\text{log}^{3.39}\;N)$). The explicitly constructed instance of an $N \times N$ MCL has a cost of $O(N^{\frac{5}{4}})$ and constant delay from the input ports to the output ports. These hardware costs are the lowest compared to previous schemes which deliver the same performance.
24 February 2019 in IEEE Transactions on Cloud Computing
In this paper, we propose a versatile network architecture, named VFTree, for data centers. VFTree provisions unique versatility in the sense that its topology and performance can be tailored with great freedom. The wide dynamic range and fine granularity of its configurations allow this architecture to closely follow the demands of the running traffic. Also, this versatility facilitates the reuse of network devices, so that upgrades could be achieved by rearranging existing devices, avoiding the expenditure on new generations of hardware in each upgrade cycle. Furthermore, this versatility allows VFTree to be elaborately tuned into cost efficient zones. This way, compared to widely adopted industrial solutions including fat-tree, VFTree can provide even higher aggregate bandwidth and richer path availability at the same cost. In this paper, we first design the network topology of VFTree. We parameterize the topology so that it is flexible and generalized. For example, we can configure the numbers of upward and downward ports for the switches, which are fixed in the classic fat-tree. Based on that, we propose routing algorithms, implement the abstraction from packet level to the flow level, and handle the flow collisions. We also analyze VFTree’s performance, demonstrate its aforementioned features, and compare it with its predecessors. VFTree can be seen as a generalization of, and is backward-compatible to fat-tree. We believe it is ready to be deployed in industry, as a perfect replacement of the fat-tree DCNs.