T.D. Neame

557 total citations
14 papers, 349 citations indexed

About

T.D. Neame is a scholar working on Computer Networks and Communications, Management Information Systems and Electrical and Electronic Engineering. According to data from OpenAlex, T.D. Neame has authored 14 papers receiving a total of 349 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Networks and Communications, 12 papers in Management Information Systems and 4 papers in Electrical and Electronic Engineering. Recurrent topics in T.D. Neame's work include Advanced Queuing Theory Analysis (12 papers), Network Traffic and Congestion Control (12 papers) and Complex Network Analysis Techniques (3 papers). T.D. Neame is often cited by papers focused on Advanced Queuing Theory Analysis (12 papers), Network Traffic and Congestion Control (12 papers) and Complex Network Analysis Techniques (3 papers). T.D. Neame collaborates with scholars based in Australia, Hong Kong and Austria. T.D. Neame's co-authors include Moshe Zukerman, Ron Addie, Gerhard J. Woeginger, M. Ivanovich, Jonathan Li, Paul Fitzpatrick and N.F. Maxemchuk and has published in prestigious journals such as IEEE Communications Magazine, IEEE Communications Letters and Computer Networks.

In The Last Decade

T.D. Neame

12 papers receiving 325 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
T.D. Neame Australia 10 292 161 90 24 23 14 349
J.W. Roberts France 8 389 1.3× 209 1.3× 143 1.6× 15 0.6× 21 0.9× 13 458
Stephan Robert Switzerland 8 148 0.5× 75 0.5× 51 0.6× 30 1.3× 20 0.9× 30 225
Mart Molle United States 10 281 1.0× 129 0.8× 29 0.3× 10 0.4× 14 0.6× 39 339
Marco Lohmann Germany 6 263 0.9× 161 1.0× 107 1.2× 4 0.2× 38 1.7× 8 331
Annie Gravey France 10 427 1.5× 236 1.5× 284 3.2× 5 0.2× 38 1.7× 44 560
Appie van de Liefvoort United States 11 190 0.7× 95 0.6× 157 1.7× 4 0.2× 16 0.7× 40 283
Kiran M. Rege United States 11 354 1.2× 303 1.9× 172 1.9× 3 0.1× 11 0.5× 54 478
A. Khamisy Israel 12 399 1.4× 205 1.3× 271 3.0× 5 0.2× 4 0.2× 28 485
Yaakov Kogan United States 10 182 0.6× 128 0.8× 177 2.0× 7 0.3× 7 0.3× 29 291
Zhang Zhili United States 4 365 1.3× 90 0.6× 31 0.3× 11 0.5× 86 3.7× 6 394

Countries citing papers authored by T.D. Neame

Since Specialization
Citations

This map shows the geographic impact of T.D. Neame's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by T.D. Neame with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites T.D. Neame more than expected).

Fields of papers citing papers by T.D. Neame

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by T.D. Neame. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by T.D. Neame. The network helps show where T.D. Neame may publish in the future.

Co-authorship network of co-authors of T.D. Neame

This figure shows the co-authorship network connecting the top 25 collaborators of T.D. Neame. A scholar is included among the top collaborators of T.D. Neame based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with T.D. Neame. T.D. Neame is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

14 of 14 papers shown
1.
Addie, Ron, et al.. (2014). Performance Evaluation of a Queue Fed by a Poisson Lomax Burst Process. IEEE Communications Letters. 19(3). 367–370. 14 indexed citations
2.
Addie, Ron, T.D. Neame, & Moshe Zukerman. (2008). Performance analysis of a Poisson–Pareto queue over the full range of system parameters. Computer Networks. 53(7). 1099–1113. 9 indexed citations
3.
Neame, T.D., Moshe Zukerman, & Ron Addie. (2005). Application of the M/Pareto process to modeling broadband traffic streams. 53–58. 9 indexed citations
4.
Ivanovich, M., Jonathan Li, T.D. Neame, & Paul Fitzpatrick. (2005). Modelling GPRS data traffic. 5. 3300–3304. 3 indexed citations
5.
Zukerman, Moshe, T.D. Neame, & Ron Addie. (2004). Internet traffic modeling and future technology implications. 1. 587–596. 87 indexed citations
6.
Addie, Ron, T.D. Neame, & Moshe Zukerman. (2003). Modeling superposition of many sources generating self similar traffic. 387–391. 10 indexed citations
7.
Neame, T.D., Moshe Zukerman, & Ron Addie. (2003). Modelling broadband traffic streams. 1b. 1048–1052. 11 indexed citations
8.
Addie, Ron, Moshe Zukerman, & T.D. Neame. (2002). Performance of a single server queue with self similar input. 1. 461–465. 9 indexed citations
9.
Addie, Ron, Moshe Zukerman, & T.D. Neame. (2002). Fractal traffic: measurements, modelling and performance evaluation. 977–984. 54 indexed citations
10.
Neame, T.D., Moshe Zukerman, & Ron Addie. (2002). A tradeoff between increased network speed and reduced effective bandwidths. 4. 979–984. 1 indexed citations
11.
Addie, Ron, T.D. Neame, & Moshe Zukerman. (2002). Performance evaluation of a queue fed by a Poisson Pareto burst process. Computer Networks. 40(3). 377–397. 37 indexed citations
12.
Zukerman, Moshe, et al.. (2001). A polynomially solvable special case of the unbounded knapsack problem. Operations Research Letters. 29(1). 13–16. 14 indexed citations
13.
Neame, T.D., Moshe Zukerman, & N.F. Maxemchuk. (2001). On link dimensioning based on estimating the mean rate by the sustainable rate. IEEE Communications Letters. 5(2). 73–75.
14.
Addie, Ron, Moshe Zukerman, & T.D. Neame. (1998). Broadband traffic modeling: simple solutions to hard problems. IEEE Communications Magazine. 36(8). 88–95. 91 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026