Estimation of message source and destination from network intercepts

IEEE Transactions on Information Forensics and Security

Volumn 1, Issue 3, 2006, Pages 374-385

  Justice, Derek ^b   Hero III, Alfred O ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Channel and network models; Data acquisition and sensor models; Detection and identification of anomalous events; Network tomography and surveillance

Indexed keywords

CHANNEL AND NETWORK MODELS; MAXIMUM A POSTERIORI (MAP) ESTIMATION; NETWORK TOMOGRAPHY; SENSOR MODELS;

COMPUTER NETWORKS; DATA ACQUISITION; INFORMATION ANALYSIS; MONTE CARLO METHODS; SENSORS; TOPOLOGY;

DATA COMMUNICATION EQUIPMENT;

EID: 33748120908     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2006.879291     Document Type: Article

References (33)

1. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
2. L. Lovasz and A. Schrijver, "Cones of matrices and set-functions and 0-1 optimization," SIAM J. Optim., vol. 1, no. 2, pp. 166-190, 1991.
3. R. Saigal, Linear Programming: A. Modern Integmted Analysis. Nor-well, MA: Kluwer, 1995.
4. C. Helmberg, F. Rendl, R. Vanderbei, and H. Wolkowicz, "An interior-point method for semideflnite programming," SIAM J. Optim., vol. 6, no. 2, pp. 342-361, May 1996.
5. F. Alizadeh, "Interior point methods in semidefinite programming with applications to combinatorial optimization," SIAM J. Optim., vol. 5, no. 1, pp. 13-51, 1995.
6. M. Goemans and D. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," J. ACM. vol. 42, no. 6, pp. 1115-1145, Nov. 1995.
7. M. Goemans and F. Rendl, "Semidefinite programming in combinatorial optimzation," in Handbook of Semidefinite Programming, H. Wolkowicz, R. Saigal, and L. Venberghe, Eds. Norwell, MA: Kluwer, 2000, pp. 343-360.
8. C. Helmberg, "Fixing variables in semidefinite relaxations," SIAM J. Matrix Anal. Apps., vol. 21, no. 3, pp. 952-969, 2000.
9. A. Tanenbaum, Computer Networks, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 1996.
10. Y. Vardi, "Network tomography: Estimating the source-destination traffic intensities from link data," J. Amer. Statist. Assoc., vol. 91, pp. 365-377, 1996.
11. G. Liang and B. Yu, "Maximum pseudo likelihood estimation in network tomography," IEEE Trans. Signal Process., vol. 51, no. 8, pp. 2043-2053, Aug. 2003.
12. M.-F. Shih and A. Hero, "Unicast-based inference of network link delay distributions with finite mixture models," IEEE Trans. Signal Process., vol. 51, no. 8, pp. 2219-2228, Aug. 2003.
13. Y. Tsang, M. Coates, and R. Nowak, "Network delay tomography," IEEE Trans. Signal Process., vol. 51, no. 8, pp. 2125-2136, Aug. 2003.
14. R. Caceres, N. Duffield, J. Horowitz, and D. Towsley, "Multicast-based inference of network-internal loss characteristics," IEEE Trans. Inform. Theory, vol. 45, no. 7, pp. 2462-2480, Nov. 1999.
15. M. Coates, R. Castro, and R. Nowak, "Maximum likelihood network topology identification from edge-based unicast measurements," ACM Sigmetric, Jun. 2002.
16. N. Duffield, J. Horowitz, F. L. Presti, and D. Towsley, "Multicast topology inference from measured end-to-end loss," IEEE Trans. Inform. Theory, vol. 48, no. 1, pp. 26-45, Jan. 2002.
17. M. Coates, A. Hero, R. Nowak, and B. Yu, "Internet tomography," IEEE Signal Process. Mag., vol. 19, no. 3, pp. 47-65, May 2002.
18. J. Treichler, M. Larimore, S. Wood, and M. Rabbat, "Determining the topology of a telephone system using internally sensed network tomography," in Proc. 11th Digital Signal Processing Workshop, Aug. 2004.
19. M. Rabbat and R. Nowak, Telephone Network Topology Inference, Univ. Wisconsin, Madison, 2004, Tech. Rep.
20. M. Newman, "The structure and function of complex networks," SIAM Rev., vol. 45, pp. 167-256, 2003.
21. Q. Morris, B. Frey, and C. Paige, "Denoising and untangling graphs using degree priors," Proc. Neural Info. Process. Sys., no. 16, 2003.
22. A. Pasztor and D. Veitch, "A precision infrastructure for active probing," in Proc. Workshop on Passive and Active Networking, Apr. 2001.
23. _, "PC based precision timing without GPS," in Proc. ACM SIGMETRICS, Jun. 2002.
24. A.-L. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, Oct. 1999.
25. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology," in Proc. CM SIGCOMM, Aug. 1999, pp. 251-262.
26. S. Gomez and A. Rzhetsky, "Towards the prediction of complete protein-protein interaction networks," in Proc. Pacific Symp. Biocomputing, 2002, pp. 413-424.
27. E. Moore, "Gedanken-experiments on sequential machines," in Automata Studies, Annals of Mathematics Studies. Princeton, NJ: Princeton Univ. Press, 1956, pp. 129-153.
28. D. Lee and M. Yannakakis, "Principles and methods of testing finite state matchines - A survey," Proc. IEEE, vol. 84, no. 8, pp. 1090-1123, Aug. 1996.
29. M. Garey and D. Johnson, Computers and Intractability: A Guide, to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
30. S. Milgram, "The small world problem," Psychol Today, vol. 2, pp. 60-67, 1967.
31. C.-J. Lin and R. Saigal, A Predictor Corrector Method for Semidefinite Linear Programming Dept. Industrial and Operations Engineering, Univ. Michigan, Ann Arbor, MI, 1995, Tech. Rep. TR95-20.
32. M. Nayakkankuppam and Y. Tymofyeyev, "A parallel implementation of the spectral bundle method for large-scale semidefinite programs," in Proc. 8th SIAM Conf. App. Un. Alg., 2003.
33. B. Borchers, "CSDP: A C library for semidefinite programming," Optim. Meth. Softw., vol. 11, no. 1, pp. 613-623, 1999.