A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at most one channel from u to v. However, it is often desirable to have multiple channels between nodes. That is, for every pair of network nodes u and v, there may be multiple channels from u to v. In this paper, we con...

Although packet delay and loss are two important parameters of the Internet performance, to the best of our knowledge, the evolution of large-scale IPv6 delay and loss performance has previously not been studied. In this paper, we analyze more than 600 end-to-end IPv6 paths between about 26 testboxes of RIPE Network Coordination Centre over two years, and compare the delay and loss performance ...

Several access protocols are proposed to support different service classes in an optical burst switched ring. Their performance is evaluated through simulation. Various performance metrics such as throughput, utilization, burst loss rate, end-to-end delay and fairness are used to analyze the behaviour of each protocol.

A number of end-to-end verifiable voting schemes have been introduced recently. These schemes aim to allow voters to verify that their votes have contributed in the way they intended to the tally and in addition allow anyone to verify that the tally has been generated correctly. These goals must be achieved while maintaining voter privacy and providing receipt-freeness. However, most of these e...

In this paper we develop a new notion called the end-to-end capacity in terms of input and output processes of an end-to-end path. The end-to-end capacity is defined for a path of interest, and we show that the end-to-end path can be represented by a single-node model with the end-to-end capacity in the sense that the single-node model is equivalent to the original path in terms of the queue-le...

Following the gaze of people inside videos is an important signal for understanding people and their actions. In this paper, we present an approach for following gaze across views by predicting where a particular person is looking throughout a scene. We collect VideoGaze, a new dataset which we use as a benchmark to both train and evaluate models. Given one view with a person in it and a second...

Much of the current multimedia application deployment relies on composable service systems, where complex multimedia services are composed dynamically from multiple simpler ones that may be widely distributed. Related to such a scenario is the problem of finding feasible service paths that meet end-to-end requirements. Research has been done in discovering individual (unicast) service paths. In...

ABSTRACT Di‚erentially-private histograms have emerged as a key tool for location privacy. While past mechanisms have included theoretical & experimental analysis, it has recently been observed that much of the existing literature does not fully provide di‚erential privacy. Œe missing component, private parameter tuning, is necessary for rigorous evaluation of these mechanisms. Instead works fr...

This paper describes a new methodology for protocol design, using incremental construction of the protocol from elements called “protocol boosters” on an as-needed basis. Protocol boosters allow: (1) dynamic protocol customization to heterogeneous environments, and (2) rapid protocol evolution. Unlike alternative adaptation approaches, such as link layer, conversion, and termination protocols, ...

We examine the problem of an electronic end-to-end voting system that does not require paper. As a frst step, we defne two protocols based on the end-to-end protocols of Scantegrity and PunchScan respectively. Using either protocol, the voter votes on an electronic voting machine in a polling booth. We also assume the voter may bring with him a (personally trusted) voter computing device that a...