Since the inception of BraTS challenge, a series of methods has been developed for brain tumor segmentation over the past years. Although these methods achieved promising results, they mostly focus on glioma segmentation, largely due to their relatively high incidence. These fully-supervised methods may not be applicable as they rely on abundant labeled data, which is intrinsically inaccessible for rarer types of brain tumors. Data-efficient transfer learning approaches like few-shot learning and domain adaptation assume full access to source data, which may not be feasible in real-life scenarios due to privacy and confidentiality concerns. In this work, we propose a new source-free few-shot learning framework for rarer brain tumor segmentation that adapts source model trained on gliomas to other less common brain tumors such as meningioma, metastasis and pediatric tumors with only a few labeled target data. The proposed framework follows a dual-branch prototypes learning structure that harmonize preservation of common knowledge from source class and learning new features from target. We show that our method gains a 6% increase in Dice score over representative source-free domain adaptation methods, and achieves comparable performance against its fully-supervised counterpart.

The introduction of wireless transmissions into the data center has shown to be promising in improving cost effectiveness of data center networks (DCNs). For high transmission flexibility and performance, a fundamental challenge is to increase the wireless availability and enable fully hybrid and seamless transmissions over both wired and wireless DCN components. Rather than limiting the number of wireless radios by the size of top-of-rack switches, we propose a novel DCN architecture, Diamond, which nests the wired DCN with radios equipped on all servers. To harvest the gain allowed by the rich reconfigurable wireless resources, we propose the low-cost deployment of scalable 3-D ring reflection spaces (RRSs) which are interconnected with streamlined wired herringbone to enable large number of concurrent wireless transmissions through high-performance multi-reflection of radio signals over metal. To increase the number of concurrent wireless transmissions within each RRS, we propose a precise reflection method to reduce the wireless interference. We build a 60-GHz-based testbed to demonstrate the function and transmission ability of our proposed architecture. We further perform extensive simulations to show the significant performance gain of diamond, in supporting up to five times higher server-to-server capacity, enabling network-wide load balancing, and ensuring high fault tolerance.

Energy consumption has become a key issue for running large-scale data center networks (DCN) nowadays. Previous studies mainly focus on energy saving through reducing the number of active servers or network switches with traffic consolidation. However, since this mechanism benefits from the routing flexibility, both the gained energy savings and flow performance are limited by the conventional static network topology. Recent advances in DCN architecture propose to implement an adaptive network topology with reconfigurable optical/wireless links (i.e., topology-adaptive DCNs), which has shown a great potential to improve the transmission performance of existing static wired network. In this paper, we propose GreenWay, an energy-efficient solution to jointly optimize the virtual machine (VM) placement and flow transmissions under the new paradigm of topology adaption. Based on the VM traffic demands, it can construct a proper run-time network topology to lower both the energy cost and communication cost among VMs. We first formulate the energy optimization problem in topology-adaptive DCNs. After showing the its NP-hardness, we then develop heuristic algorithms to address the VM placement and topology adaption effectively. Extensive trace-based simulations show that GreenWay consumes much less energy than other state-of-the- art solutions while ensuring better flow performance. We finally implement an OpenvSwitch- based testbed and demonstrate the efficiency of our solution.

Virtual machine (VM) migration is a key technique for network resource optimization in modern data center networks. Previous work generally focuses on how to place the VMs efficiently in a static network topology by migrating the VMs with large traffic demands to close servers. As the flow demands between VMs change, however, a great cost will be paid for the VM migration. In this paper, we propose a new paradigm for VM migration by dynamically constructing adaptive topologies based on the VM demands to lower the cost of both VM migration and communication. We formulate the traffic-aware VM migration problem in an adaptive topology and show its NP-hardness. For periodic traffic, we develop a novel progressive-decompose-rounding algorithm to schedule VM migration in polynomial time with a proved approximation ratio. For highly dynamic flows, we design an online decision-maker (ODM) algorithm with proved performance bound. Extensive trace-based simulations show that PDR and ODM can achieve about four times flow throughput among VMs with less than a quarter of the migration cost compared to other state-of-art VM migration solutions. We finally implement an OpenvSwitch-based testbed and demonstrate the efficiency of our solutions.

Virtual machine (VM) migration is a key technique for network resource optimization in modern data center networks (DCNs). Previous work generally focuses on how to place the VMs efficiently in a static network topology by migrating the VMs with large traffic demands to close servers. When the VM demands change, however, a great cost will be paid on the VM migration. With the advance of software-defined network (SDN), recent studies have shown great potential to implement an adaptive network topology at a low cost. Taking advantage of the topology adaptability, in this paper, we propose a new paradigm for VM migration by dynamically constructing a topology based on the VM demands to lower the cost of both VM migration and communication. We formulate the traffic-aware VM migration problem in an adaptive topology and show its NP-hardness. Then we develop a novel progressive-decompose-rounding (PDR) algorithm to solve this problem in polynomial time with a proved approximation ratio. Extensive trace-based simulations show that PDR can achieve higher flow throughput among VMs with only a quarter of the migration cost compared to other state-of-art VM migration solutions. We finally implement an OpenvSwitch-based testbed and demonstrate the efficiency of our solution.