scispace - formally typeset
Search or ask a question
Institution

AT&T Labs

Company
About: AT&T Labs is a based out in . It is known for research contribution in the topics: Network packet & The Internet. The organization has 1879 authors who have published 5595 publications receiving 483151 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This work asks what is possible in the information-theoretic setting when the adversary is very strong and the network connectivity is very low (minimum needed for crash-tolerance), and shows a sizable gap between the connectivity required for perfect security and for almost perfect security.
Abstract: Problems of secure communication and computation have been studied extensively in network models. In this work we ask what is possible in the information-theoretic setting when the adversary is very strong (Byzantine) and the network connectivity is very low (minimum needed for crash-tolerance). We concentrate on a new model called ``multicast lines,'' and show a sizable gap between the connectivity required for perfect security and for almost perfect security. Our results also have implications to the commonly studied simple channel model and to general secure multiparty computation.

166 citations

Journal ArticleDOI
11 Aug 2006
TL;DR: This work conducts extensive measurement that involves both controlled routing updates through two tier-1 ISPs and active probes of a diverse set of end-to-end paths on the Internet and finds that routing changes contribute to end- to-end packet loss significantly.
Abstract: Extensive measurement studies have shown that end-to-end Internet path performance degradation is correlated with routing dynamics. However, the root cause of the correlation between routing dynamics and such performance degradation is poorly understood. In particular, how do routing changes result in degraded end-to-end path performance in the first place? How do factors such as topological properties, routing policies, and iBGP configurations affect the extent to which such routing events can cause performance degradation? Answers to these questions are critical for improving network performance.In this paper, we conduct extensive measurement that involves both controlled routing updates through two tier-1 ISPs and active probes of a diverse set of end-to-end paths on the Internet. We find that routing changes contribute to end-to-end packet loss significantly. Specifically, we study failover events in which a link failure leads to a routing change and recovery events in which a link repair causes a routing change. In both cases, it is possible to experience data plane performance degradation in terms of increased long loss burst as well as forwarding loops. Furthermore, we find that common routing policies and iBGP configurations of ISPs can directly affect the end-to-end path performance during routing changes. Our work provides new insights into potential measures that network operators can undertake to enhance network performance.

166 citations

Journal ArticleDOI
Xiang Zhou1
TL;DR: It is shown that by introducing multiple cascaded feed-forward carrier recovery stages, the required compute power can be significantly reduced compared to the prior art using the single-stage-based blind phase search method.
Abstract: An improved feed-forward carrier phase recovery method is proposed for coherent receivers using M-ary quadrature amplitude modulation-based modulation formats. It is shown that by introducing multiple cascaded feed-forward carrier recovery stages, the required compute power can be significantly reduced compared to the prior art using the single-stage-based blind phase search method.

166 citations

Proceedings ArticleDOI
Yoav Freund1
06 Jul 1999
TL;DR: A new boosting algorithm is proposed that is an adaptive version of the boost by majority algorithm and combines bounded goals of the boosted algorithm with the adaptivity of AdaBoost.
Abstract: We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorithm with the adaptivity of AdaBoost.

166 citations

Proceedings ArticleDOI
20 Apr 2009
TL;DR: This analysis tackles numerous challenges posed by modern web applications including asynchronous communication, frameworks, and dynamic code generation, and builds an intrusion-prevention proxy for the server that intercepts client requests and disables those that do not meet the expected behavior.
Abstract: We present a static control-flow analysis for JavaScript programs running in a web browser. Our analysis tackles numerous challenges posed by modern web applications including asynchronous communication, frameworks, and dynamic code generation. We use our analysis to extract a model of expected client behavior as seen from the server, and build an intrusion-prevention proxy for the server: the proxy intercepts client requests and disables those that do not meet the expected behavior. We insert random asynchronous requests to foil mimicry attacks. Finally, we evaluate our technique against several real applications and show that it protects against an attack in a widely-used web application.

166 citations


Authors

Showing all 1881 results

NameH-indexPapersCitations
Yoshua Bengio2021033420313
Scott Shenker150454118017
Paul Shala Henry13731835971
Peter Stone130122979713
Yann LeCun121369171211
Louis E. Brus11334763052
Jennifer Rexford10239445277
Andreas F. Molisch9677747530
Vern Paxson9326748382
Lorrie Faith Cranor9232628728
Ward Whitt8942429938
Lawrence R. Rabiner8837870445
Thomas E. Graedel8634827860
William W. Cohen8538431495
Michael K. Reiter8438030267
Network Information
Related Institutions (5)
Microsoft
86.9K papers, 4.1M citations

94% related

Google
39.8K papers, 2.1M citations

91% related

Hewlett-Packard
59.8K papers, 1.4M citations

89% related

Bell Labs
59.8K papers, 3.1M citations

88% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20225
202133
202069
201971
2018100
201791