Jinbang Chen

East China Normal University | ECNU · Department of Computer Science & Technology

Link failures are commonly observed in computer networks, including the newly emerging Software Defined Network (SDN). Considering that failure recovery methods used in traditional networks cannot be applied to SDN networks directly, we propose a method named pro-VLAN in this paper, which calculates a backup path and assigns a unique VLAN id for ea...

As the fast growth of users, matching a given fingerprint with the ones in a massive database precisely and efficiently becomes more and more difficult. To fight against this challenging issue in “big data” era, we have designed in this paper a novel large-scale distributed Redis-based fingerprint recognition system called DFRS that introduces an i...

Size-based scheduling is an appealing solution to manage bottleneck links as the interactive (short) flows of users are offered almost constant service times, whatever the level of congestion of the link is. Size-based schedulers like LAS, Run2C or LARS offer different additional features, for instance the ability to protect low/medium rate long la...

Software Defined Network (SDN) is emerging as a novel network architecture which decouples the control plane from the data plane. However, SDN is unable to survive when facing failure, in particular in large scale data-center networks. Due to the programmability of SDN, mechanism could be designed to achieve fault tolerance. In this survey, we broa...

Cloud storage system provides reliable service to users by widely deploying redundancy schemes in its system – which brings high reliability to the data storage, but inversely introduces significant overhead to the system, consisting of storage cost and energy consumption. The core behind this issue is how to leverage the relationship between data...

While Internet traffic has received a lot of attention, little is known about enterprise traffic. In this paper, we shed light on the basic characteristics of modern enterprise networks using a 24-hour long packet trace captured in a mid-size academic network. Our approach is to contrast the external and internal activities of the enterprise networ...

We focus on a deterministic opportunistic network in which the mobility of the nodes is exploited to carry the information and the contact times between nodes are known in advance or can be predicted. We consider specifically two classes of traces collected in real life: public transportation system and human mobility. Our contribution mainly consi...

A lot of work has been devoted to the problem of dimensioning buffers at routers/switches or access points in the Internet. In this paper, we address the issue of buffer unit (granularity), and discuss its impact on the performance of scheduling policies over 802.11 Wireless LANs. We investigate the bottleneck link capacity sharing at the buffer of...

As the Internet evolves over the years, a large number of applications emerge with varying service requirements in terms of bandwidth, delay, loss rate and so on. Still, the Internet traffic exhibits a high variability property – the majority of the flows are of small sizes while a small percentage of very long flows contribute to a large portion o...

Size-based scheduling improves data transfer response times by favoring flows at an early stage. Although appealing, these techniques raise concerns as they require to keep track of the volume of data sent by each and every ongoing connections and they may starve long-lived flows even if they use up limited bandwidth. Early Flow Discard (EFD) sched...

Size-based scheduling methods receive a lot of attention as they can greatly enhance the responsiveness perceived by the users. In effect, they give higher priority to small interactive flows which are the important ones for a good user experience. In this paper, we propose a new packet scheduling method, Early Flow Discard (EFD), which belongs to...