
180 Park Ave - Building 103
Florham Park, NJ
http://www.research.att.com/~jiawang
Jia joined AT&T Labs, Inc. - Research in February 2001. Her research focuses on network measurement and management, network security, performance analysis/ troubleshooting, IPTV, and Internet routing. She received her MS and PhD degrees in Computer Science from Cornell University in May 1999 and January 2001, respectively. She is currently a senior member of IEEE and a member of ACM.
Method For Network-Aware Clustering Of Clients In A Network,
August 9, 2005
A method for clustering together network clients for guiding of placement of network servers is disclosed. A number of routing table prefix/netmask entries are aggregated and unified into a tubular format. The routing table entries may be converted into a singular format. A network server log is used to extract a number of client IP addresses which are compared to the entries within the unified routing table. A common prefix shared by a number of the client IP addresses and an entry in the unified routing table is determined and used to cluster the clients together in a client cluster. Network servers, such as proxy server, cache servers, content distribution servers and mirror server may be placed in the network according to the client clusters.
Method for fast network-aware clustering,
May 15, 2007
A method for clustering together network IP addresses is disclosed. A number of IP addresses are received and processed to determine which IP addresses share a longest prefix matching. The longest prefix matching process is performed according to radix encoded trie which facilitates on-line clustering of the IP addresses. Client and/or server IP addresses may be clustered in accordance with the teachings herein.
Fast prefix matching of bounded strings,
March 13, 2007
The present invention increases the efficiency of performing longest prefix matching operations by selecting a radix-encoded trie structure optimized with respect to memory cost. The structure is optimized by determining memory costs for retrie structures indexed on different numbers of high-order characters, and then selecting the structure corresponding to the lowest memory cost. The optimization improves performance in IP look-up operations as well as longest-prefix matching operations performed on general alphabets.