![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Timothy D. Neame
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j6]Jiongze Chen, Ronald G. Addie
, Moshe Zukerman
, Timothy D. Neame:
Performance Evaluation of a Queue Fed by a Poisson Lomax Burst Process. IEEE Commun. Lett. 19(3): 367-370 (2015)
2000 – 2009
- 2009
- [j5]Ron Addie
, Timothy D. Neame, Moshe Zukerman
:
Performance analysis of a Poisson-Pareto queue over the full range of system parameters. Comput. Networks 53(7): 1099-1113 (2009) - 2003
- [c6]Moshe Zukerman
, Timothy D. Neame, Ron Addie:
Internet Traffic Modeling and Future Technology Implications. INFOCOM 2003: 587-596 - 2002
- [j4]Ron Addie
, Timothy D. Neame, Moshe Zukerman
:
Performance evaluation of a queue fed by a Poisson Pareto burst process. Comput. Networks 40(3): 377-397 (2002) - 2001
- [j3]Timothy D. Neame, Moshe Zukerman
, Nicholas F. Maxemchuk:
On link dimensioning based on estimating the mean rate by the sustainable rate. IEEE Commun. Lett. 5(2): 73-75 (2001) - [j2]Moshe Zukerman
, Long Jia, Timothy D. Neame, Gerhard J. Woeginger:
A polynomially solvable special case of the unbounded knapsack problem. Oper. Res. Lett. 29(1): 13-16 (2001) - [c5]Timothy D. Neame, Moshe Zukerman, Ronald G. Addie:
A tradeoff between increased network speed and reduced effective bandwidths. ICC 2001: 979-984
1990 – 1999
- 1999
- [c4]Timothy D. Neame, Moshe Zukerman, Ron Addie:
A Practical Approach for Multimedia Traffic Modeling. Broadband Communications 1999: 73-82 - [c3]Ronald G. Addie, Timothy D. Neame, Moshe Zukerman:
Modeling superposition of many sources generating self similar traffic. ICC 1999: 387-391 - [c2]Timothy D. Neame, Moshe Zukerman
, Ron Addie
:
Application of the M/Pareto process to modeling broadband traffic streams. ICON 1999: 53-58 - 1998
- [j1]Ronald G. Addie
, Moshe Zukerman
, Timothy D. Neame:
Broadband traffic modeling: simple solutions to hard problems. IEEE Commun. Mag. 36(8): 88-95 (1998) - 1995
- [c1]Ron Addie, Moshe Zukerman, Timothy D. Neame:
Fractal Traffic: Measurements, Modelling and Performance Evaluation. INFOCOM 1995: 977-984
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint