Find the elements in a set-with-duplicates for top-\(K\) frequencies. Two approaches are proposed: sampling and coarse counting. Sampling is to take \(s\) samples from a pool of \(N\) and count for the frequencies in \(s\). The result is then scaled by \(N/s\). Afterwards, report those with scaled frequency larger than...
[more]
Welzl, Papadimitriou, Scharf, Briscoe (2008) Open Research Issues in Internet Congestion Control (Internet Draft)
In chapter 1 of the draft, an overview of the history of congestion control research of TCP/IP is presented.
[more]
Hei et al (2007) A Measurement Study of a Large-Scale P2P IPTV System (IEEE T. of Multimedia 9(8))
Measuring PPLive by setting up a couple clients and trace the packets by passive sniffing. Following information are harvested: (1) Diurnal and weekly trend; (2) Peer arrival and departures, i.e. flash crowd; (3) geographic distribution; (4) overheads of content; (5) redundancy; (6) upload-download ratio; (7) live time of each connections...
[more]
Feng and Xu (2008) TCP-Friendly CBR-Like Rate Control (ICNP)
Extend of my previous work. Consider stochastically TCP-friendliness that defined as:
[more]
Kohler, Handley and Floyd (2006) Designing DCCP: Congestion Control without Reliability (SIGCOMM)
DCCP = Datagram Congestion Control Protocol, an IETF proposed standard RFC4341. DCCP is to send unreliable datagrams with congestion control.
[more]