Fuxing Chen

LB-MSNC: A load-balanced multicast switching fabric with network coding

A good switching fabric should be endowed with the properties of no internal buffers, delay guarantee, low component complexity and high-speed multicast, which are difficult for conventional switching fabrics to achieve, fueling the great interest in designing a new switching fabric that can support large-scale extension and high-speed multicast. Motivated by this, we reuse the self-routing Boolean concentrator network and embed a Multicast Packets Copy Separation (MPCS) in front to construct a load-balanced multicast switching fabric. Concretely, MPCS module replicates the multicast packets and forwards them according to the multicast addresses. The first phase of LB-MSNC is responsible for balancing the incoming traffic into uniform cells while the second phase is in charge of self-routing the cells to their final destinations. Differing from the existing fabrics, LB-MSNC is combined with the merits of network coding against the packet loss. Experimental results and analysis have verified that the proposed fabric is able to achieve high-speed multicast switching and suitable for building super large-scale switching fabric in Next Generation Network(NGN) with all the advantages mentioned above.

Prologue: Unified Polymorphic Routing Towards Flexible Architecture of Reconfigurable Infrastructure

Today’s Internet architecture was designed and proposed in the 60s and 70s with the intention to interconnect several computing resources across a geographically distributed user group. With the advent of substantially various Internet businesses, traditional Internet is increasingly powerless to satisfy the unprecedented demands. This paper probed the polymorphic routing prototype based on proposed Flexible Architecture of Reconfigurable Infrastructure (FARI) which attempts to emerge as a clean-slate revolution of future Internet and resorts to centralized control manner. Routers in FARI were reconfigurable to adapt to different businesses in terms of identifier type. Moreover, a preliminary framework of FARI is proposed in the end of the article.

Exploring Cache Coding Scheme for Information-centric Networking

The tremendous growth of the Internet application has driven wider efforts to advanced future Internet architecture especially Content-Centric Networking. In this paper we propose a Centralized Architecture for ICN (CAN), which efficiently combines Content-Centric Networking and network coding (NC). In order to achieve optimal coding performance, we design a global controller which is mainly responsible for calculating entire network routing tables and controlling optimal trade off among cache coding schemes. Specifically, we propose a coding chunk naming scheme and an efficient network coding management approach, which apply to recover the lost native content packets according to NC. Experiment results show that NC in CAN has a great performance for content packet loss recovery. In particular, it can reach nearly 100% recovery in sufferable packet loss rate. Meanwhile, the efficiency and performance of which are superior to the conventional CCN.

Improving TCP responsiveness with connection history in data center networks

Data center networks are high-bandwidth, low-latency networks with clear-defined topology and busy internal data exchange traffic. TCP is widely used in data centers to transport data, however its default behavior during the flow initialization phase may be unsuitable for data center networks and affect the responsiveness of data transmission, especially when the flow is short. Considering that data center flows happen frequently but only between limited number of data center servers connected by a rather stable physical topology, in this paper we propose to use the RTT records from previous transmissions to help TCP calculate more suitable initialization parameters when a new flow starts, so as to avoid unnecessary lengthy timeouts that has heavy consequences on the overall performance, especially on short flows. Experiments show that our algorithms can indeed eliminate the long timeouts caused by early packet losses, and improve the responsiveness and stability of data transmission in a data center networking environment.

Multicast Switching Fabric Based on Network Coding and Algebraic Switching Theory

Scheduling algorithms are crucial for most existing switches to improve the throughput. However, the delay of the switching fabric cannot be guaranteed with such scheduling algorithms. This paper aims to design a novel load-balanced wire-speed multicast switching fabric along with the attractive merits of network coding. We adopt a two-phase self-routing switching fabric constructed by Boolean-multicast concentrators (SRBMCs), where the first SRBMC distributes the incoming cells to its outputs uniformly and the second allows the distributed cells to be self-routed and multicast to their destinations concurrently. To further improve the switching performance, linear network coding is smoothly combined with SRBMC to reduce the packet loss rate. Theoretical analysis and numerical simulation demonstrate that the proposed switching fabric cannot only achieve wire-speed multicast switching but also be recursively constructed into an indefinite large-scale one with such merits as no internal buffers, low complexity, and guarantee in switching delay. Finally, we implement the proposed fabric on Field-Programmable Gate Array and verify its performance in multicast switching.

Optimization-Based Atomic Capability Routing Model for Flexible Architecture of Reconfigurable Infrastructure

There are more and more emerging problems in today’s Internet, indicating today’s Internet architecture can not meet the quality requirement of various applications and service. With conventional Internet under mounting pressure, a new future Internet architecture named as Flexible Architecture of Reconfigurable Infrastructure (FARI) has been developed and implemented in China. Aiming at designing a routing mechanism which is one of the most essential issue in any Internet architecture, this paper explores to establish an optimization-based atomic capability routing model that is able to optimally select or generate a routing protocol based on the current network quality of service (QoS) requirement. In experiments, the feasibility of this routing model is verified and results of complexity analysis are satisfying.

Semi-Centralized Name Routing Mechanism for Reconfigurable Network

Dedicated to overcoming weakness of current Internet architecture, some novel internet architectures have been proposed recently. Examples of these architectures contain Information Centric Networking (ICN), Name Data Networking (NDN), reconfigurable networking etc. As far as we know, the most efficient name based routing mechanism which suites the new architectures has not been found yet. This paper proposed a Semi-Centralized Name Routing (SCNR) protocol for reconfigurable network to enhance the routing efficiency. Results of this paper show that SCNR has good performance in ICN, which can be regarded as one of the many sub-networks in reconfigurable network.

MDC-Ca: Efficient Caching Management Strategy for CCN Using Multiple Description Coding

Due to the explosive growth of multimedia content (especially videos) over the Internet, content-centric networking (CCN) is proposed to remit the problems of modern bandwidth-intensive Internet usage patterns. Additionally, the current streaming media coding is designed for video service for IP networks. However, there are few researches who concentrate on efficient streaming media coding for the CCN pattern. It motivates us to find a suitable video coding to improve the performance of CCN. This paper proposes an advanced caching management strategy by combining the Multiple Description Coding (MDC) to the content items, termed as MDC-Ca. The core parts of CCN, e.g., location-independent naming, name-based routing and in-network caching strategy, are all adjusted to the content communication. Moreover, MDC-Ca can deal with the ruleless content chunk distribution in the caching of network nodes. MDC-Ca was studied in a mathematical analysis model and the scheme performs well in the simulation. Further, we perform the emulation in a practical network. The experimental results from both simulations and practical emulations show the superiority of the proposed caching management strategy.

Large-scale Wire-speed Multicast Switching Structure Based on Multipath Self-routing Switching Structure and Implemented on FPGA

Ensuring high quality of service (QoS) of multicast video stream over next generation network is a challenging issue, and how to implement the wire-speed multicast with hardware logical support in the network nodes of every hierarchy is a key solution to achieve high QoS multicast. Currently, the multicast packets are processed in this way, in which they are copied and then scheduled by ports, lastly, sent respectively. But this approach cannot ensure high QoS in real-time applications. Moreover, the traditional hardware solutions do not possess excellent large-scale scalability owning to their own bottlenecks. In this project, we have constructed a wire-speed multicast switching structure based on Multipath Self-routing Switching Structure, and implemented it on a Stratix IV FPGA chip. Additionally, we have designed the signaling system and control mechanism to support the process of self-routing and wire-speed fan-out copy of multicast packets.