Zobrazeno 1 - 10
of 344
pro vyhledávání: '"A. T. Ogielski"'
Transcript of an oral history conducted 2021 by Patrick Charbonneau and Francesco Zamponi and recorded over Zoom, from Prof. Ogielki's home in Hanover, New Hampshire, USA
Transcription de l'entretien conduit en 2021 par Patrick Charbonneau et Fr
Transcription de l'entretien conduit en 2021 par Patrick Charbonneau et Fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e56be5aafad0085a4e83df165be687d
Autor:
Andy T. Ogielski, Michael Liljenstam
Publikováno v:
ACM SIGCOMM Computer Communication Review. 32:89-100
We critically examine the claims that TCP congestion control contributes to the observed self-similar traffic rate correlations. A simulation model is designed to analyze aggregated traffic of many TCP file transfers, with network topologies large en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dac824857b6f994331a0a37c9d95908
https://doi.org/10.1145/774749.774761
https://doi.org/10.1145/774749.774761
Autor:
Jignesh S. Panchal, Narayan B. Mandayam, Jie Lai, Roy D. Yates, Andrew T. Ogielski, O. E. Kelly
Publikováno v:
Mobile Networks and Applications. 5:199-208
We review the design, selected applications and performance of WiPPET lWireless Propagation and Protocol Evaluation Testbedr, a general parallel simulation testbed for various types of wireless networks. WiPPET has been written in TeDsCpp, an objectd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2064860bd4a282eeecb28b03b0fcce48
https://doi.org/10.1023/a:1019112713217
https://doi.org/10.1023/a:1019112713217
Publikováno v:
Computing in Science & Engineering. 1:42-50
A new scalable modeling framework and scalable parallel simulations make it possible to analyze the detailed behaviour of large, multidomain multiprotocol Internet models. The article focuses on simulation research. It describes the software designs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92ec1c16418596aea115958abab3f173
https://doi.org/10.1109/5992.743621
https://doi.org/10.1109/5992.743621
Publikováno v:
ACM SIGMETRICS Performance Evaluation Review. 25:4-11
TeD is a language designed mainly for modeling telecommunication networks. The TeD language specification is separated into two parts --- (1) a meta language (2) an external language. The meta language specification is concerned with the high-level d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc3dd0af9c3efaeb84dfef8532a86766
https://doi.org/10.1145/274084.274085
https://doi.org/10.1145/274084.274085
Publikováno v:
IEEE Communications Magazine. 36:42-47
Simulation has always been an indispensable tool in the design and analysis of telecommunication networks. Due to performance limitations of the majority of simulators, usually network simulations have been done for rather small network models and fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05e1484a7f25159949a1266a9b0221b4
https://doi.org/10.1109/35.707816
https://doi.org/10.1109/35.707816
Publikováno v:
Digital Signal Processing. 5:118-129
Special purpose hardware has been traditionally viewed as the only practical solution for high speed video signal processing (VSP). However, new parallel computing technologies may provide a much more flexible alternative. In this paper we discuss te
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7699fadef697218a28c058fb3b19b1ce
https://doi.org/10.1006/dspr.1995.1011
https://doi.org/10.1006/dspr.1995.1011
Autor:
Andrew T. Ogielski
Publikováno v:
Information and Computation. 113:220-229
A consistent learning algorithm can reconstruct any Boolean function belonging to a given class from a sufficiently large number of examples; therefore such samples may be interpreted as an encoding of functions. We investigate the complexity of enco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8681dd49dab4a43b94b4d768d479ddc4
https://doi.org/10.1006/inco.1994.1070
https://doi.org/10.1006/inco.1994.1070
Autor:
William Aiello, Andrew T. Ogielski
Publikováno v:
SIAM Journal on Scientific Computing. 14:519-530
This paper investigates the balancing of distributed compressed storage of large sparse matrices on a massively parallel computer. For fast computation of matrix–vector and matrix–matrix products on a rectangular processor array with efficient co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca0b8686d1e9997c286e17b0e2ec0023
https://doi.org/10.1137/0914033
https://doi.org/10.1137/0914033