Source anonymity in fair scheduling: A case for the proportional method

IEEE International Conference on Communications

Volumn , Issue , 2012, Pages 1118-1122

  Mishra, Abhishek ^a   Venkitasubramaniam, Parv ^a  

^a LEHIGH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; BUFFER SIZES; COMMON RESOURCES; DATA NETWORK; FAIR SCHEDULING; FAIR SCHEDULING ALGORITHM; FIRST COME FIRST SERVES; MULTIPLE SOURCE; MULTIPLE USER; ROUND ROBIN;

INFORMATION THEORY; SCHEDULING ALGORITHMS;

SCHEDULING;

EID: 84871986263     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2012.6364363     Document Type: Conference Paper

References (20)

1. P. Venkitasubramaniam and L. Tong, "Anonymous Networking amidst Eavesdroppers," Submitted to IEEE Transactions on Information Theory: Special Issue on Information-Thoeretic Security, Feb. 2007.
2. P. Venkitasubramaniam and V. Anantharam, "Anonymity of Mix Networks under Light Traffic Conditions," in Proceedings of the 36th Allerton Conf. on Communications, Control, and Computing, (Monticello, IL), October 2008.
3. H. Moulin and R. Stong, "Fair queuing and other probabilistic allocation methods," Mathematics of Operations Research, vol. 27, no. 1, pp. 1-30, 2002.
4. J. Nagel, "On Packet Switches with Infinite Storage ," IEEE Transactions on Communications, vol. 35, pp. 435-438, April 1987.
5. D. P. Bertsekas and R. Gallager, Data Networks. Prentice Hall, 1992.
6. A. Back, U. Moller, and A. Stiglic, "Traffic analysis attacks and tradeoffs in anonymity providing systems," in Proceedings of 4th International Information Hiding Workshop, (Pittsburg, PA), April 2001.
7. N. West, The SIGINT Secrets: The Signal Intelligence War: 1900 to Today. New York: William Morrow, 1988.
8. D. Chaum, "Untraceable electronic mail, return addresses and digital pseudonyms," Communications of the ACM, vol. 24, pp. 84-88, February 1981.
9. Q. Sun, D. R. Simon, Y. Wang, W. Russell, V. N. Padmanabhan, and L. Qiu, "Statistical identification of encrypted web browsing traffic," in Proceedings of the 2002 IEEE Symposium on Security and Privacy, (Berkeley, California), p. 19, May 2002.
10. N. Matthewson and R. Dingledine, "Practical traffic analysis: Extending and resisting statistical disclosure," in Privacy Enhancing Technologies: 4th International Workshop, May 2004.
11. D. X. Song, D. Wagner, and X. Tian, "Timing Analysis of Keystrokes and Timing Attacks on SSH," in Proc. 10th USENIX Security Symposium, 2001.
12. G. Danezis, R. Dingledine, and N. Mathewson, "Mixminion: design of a type iii anonymous remailer protocol," in Proceedings of 2003 Symposium on Security and Privacy, pp. 2-15, May 2003.
13. G. Danezis, "Mix-networks with restricted routes," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2003), Springer-Verlag, LNCS 2760, April 2003.
14. C. Díaz, S. Seys, J. Claessens, and B. Preneel, "Towards measuring anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002) (R. Dingledine and P. Syverson, eds.), Springer-Verlag, LNCS 2482, April 2002.
15. D. Kesdogan, J. Egner, and R. Buschkes, "Stop-and-go MIXes providing probabilistic security in an open system," in Second International Workshop on Information Hiding (IH'98), Lecture Notes in Computer Science, vol. 1525, (Portland, Oregon), pp. 83-98, April 1998.
16. A. Mishra and P. Venkitasubramaniam, "Anonymity of an Almost Fair Chaum Mix," in Proceedings of the 49th Allerton Conf. on Communications, Control, and Computing, October 2011.
17. A. Misra, "Anonymity in Packet Scheduling under Max-Min Criterion," in Accepted for publication in 46th Annual Conference on Information Sciences and Systems (CISS 2012), (Princeton, NJ), March 2012.
18. P. Venkitasubramaniam, "Anonymity under Buffer Constraints," in IEEE International Conference on Communications, (Cape Town, South Africa), May 2010.
19. T. Cover and J. Thomas, Elements of Information Theory. John Wiley & Sons, Inc., 1991.
20. A. Mishra, "Anonymity of the Proportional Method:Proof." http://www.lehigh.edu/~pav309/iccproof.