Anonymity in packet scheduling under the max-min fairness criterion

2012 46th Annual Conference on Information Sciences and Systems, CISS 2012

Volumn , Issue , 2012, Pages

  Mishra, Abhishek ^a   Venkitasubramaniam, Parv ^a  

^a LEHIGH UNIVERSITY   (United States)

Author keywords

Anonymity; Chaum Mix; Fair Queueing

Indexed keywords

ANONYMITY; BUFFER CAPACITY; CHAUM MIX; DATA PACKET; FAIR QUEUEING; FAIR QUEUEING ALGORITHMS; FAIR QUEUING; FAIR SCHEDULING; MAX-MIN; MAX-MIN FAIRNESS; NETWORK ACTIVITIES; PACKET SCHEDULING; SCHEDULING POLICIES; TRADE OFF; USER ANONYMITY;

INFORMATION SCIENCE; SCHEDULING ALGORITHMS;

QUEUEING NETWORKS;

EID: 84868531746     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2012.6310742     Document Type: Conference Paper

References (20)

1. Herv Moulin and Richard Stong, "Fair queuing and other probabilistic allocation methods," Mathematics of Operations Research, vol. 27, no. 1, pp. 1-30, 2002.
2. J. Nagel, "On Packet Switches with Infinite Storage ," IEEE Transactions on Communications, vol. 35, pp. 435-438, April 1987.
3. D. P. Bertsekas and R. Gallager, Data Networks, Prentice Hall, 1992.
4. Ellen L. Hahne, "Round Robin Scheduling for Max-Min Fairness in Data Networks," IEEE Journal on selected areas in communication, vol. 9, no. 7, pp. 1024-1039, Sept. 1991.
5. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," SIGCOMM Comput. Commun. Rev., vol. 19, pp. 1-12, August 1989.
6. A. Back, U. Moller, and A. Stiglic, "Traffic analysis attacks and trade-offs 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, William Morrow, New York, 1988.
8. David Kahn, The Codebreakers: The Story of Secret W riting, New York : Scribner, c1996, New York, NY, 1974.
9. Michael Herman, Intelligence Power in Peace and War, Cambridge University Press, 1996.
10. Dawn Xiaodong Song, David Wagner, and Xuqing Tian, "Timing analysis of keystrokes and timing attacks on ssh," in Proceedings of the 10th conference on USENIX Security Symposium-Volume 10, Berkeley, CA, USA, 2001, SSYM'OI, pp. 25-25, USENIX Association.
11. D. Chaum, "Untraceable electronic mail, return addresses and digital pseudonyms," Communications of the ACM, vol. 24, no. 2, pp. 84-88, February 1981.
12. M. G. Reed, P. F. Syverson, and D. M. Goldschlag, "Anonymous connections and onion routing," IEEE Journal on Selected Areas in Communications, vol. 16, no. 4, pp. 482-494, May 1998.
13. Steven J. Murdoch and George Danezis, "Low-cost traffic analysis of tor," in Proceedings of the 2005 IEEE Symposium on Security and Privacy, Washington, DC, USA, 2005, pp. 183-195, IEEE Computer Society.
14. P. Venkitasubramaniam and V. Anantharam, "Anonymity of Mix Networks under Light Traffic Conditions," in Proceedings of the 36th Allerton Coni on Communications, Control, and Computing, Monticello, IL, October 2008.
15. John F. Shortie and Martin J. Fischer, "Approximation for a two-class weighted fair queueing discipline," Petform. Eval., vol. 67, pp. 946-958, October 2010.
16. Dimitrios Stiliadis and Anujan Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," Tech. Rep., Santa Cruz, CA, USA, 1995.
17. 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.
18. P. Venkitasubramaniam and A. Mishra, "Anonymity in Military Networks under Memory Restrictions," submitted to IEEE Transactions on Communications, Feb. 2012.
19. John D. C. Little, "A Proof for the Queuing Formula L = '\'W," Operations Research: A Journal of the Institute for Operations Research and the Management Sciences, vol. 9, no. 3, pp. 383-387, May 1961.
20. A. Mishra and P. Venkitasubramaniam, "Source Anonymity in Fair Scheduling: A case for the Proportional Method," Accepted to IEEE ICC 2012.