Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 82 matches
- 2000
- Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Norman:
Spare Capacity Planning for Survivable Mesh Networks. NETWORKING 2000: 957-968 - Marcelo Dias de Amorim, Otto Carlos Muniz Bandeira Duarte, Guy Pujolle:
Multi-criteria Arguments for Improving the Fairness of Layered Multicast Applications. NETWORKING 2000: 1-10 - Maria Teresa Andrade, Artur Pimenta Alves:
Experiments with Dynamic Multiplexing and UPC Renegotiation for Video over ATM. NETWORKING 2000: 895-907 - Zoe Antoniou, Ioannis Stavrakakis:
Efficient End-to-End Transport of Soft Real-Time Applications. NETWORKING 2000: 470-482 - Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka:
New Distributed Multicast Routing and Its Performance Evaluation. NETWORKING 2000: 835-846 - Amr Saad Ayad, Khaled M. F. Elsayed, Mahmoud T. El-Hadidi:
Performance Evaluation of Resource Division Policies for PGPS Scheduling in ATM Networks. NETWORKING 2000: 714-726 - Gargi Banerjee, Robert D. Rosenberry, Deepinder P. Sidhu:
Performance Analysis of IP Switching and Tag Switching. NETWORKING 2000: 752-762 - Thai Thach Bao, Hiroaki Morino, Hitoshi Aida, Tadao Saito:
Distributed Input and Deflection Routing Based Packet Switch Using Shuffle Pattern Network. NETWORKING 2000: 74-84 - Chadi Barakat, Eitan Altman:
Performance of Short TCP Transfers. NETWORKING 2000: 567-579 - Amine Berqia, Noufissa Mikou:
Model and Optimal Call Admission Policy in Cellular Mobile Networks. NETWORKING 2000: 920-931 - Mats Björkman, Bob Melander:
Impact of the Ethernet Capture Effect on Bandwidth Measurements. NETWORKING 2000: 156-167 - Selma Boumerdassi, André-Luc Beylot:
New Handoff Strategies in Microcell/Macrocell Overlaying Systems. NETWORKING 2000: 776-785 - José Carlos Brustoloni, Juan A. Garay:
Application-Independent End-to-End Security in Shared-Link Access Networks. NETWORKING 2000: 608-619 - Brad Cain, Donald F. Towsley:
Generic Multicast Transport Services: Router Support for Multicast Applications. NETWORKING 2000: 108-120 - Federico Calì, Marco Conti, Enrico Gregori:
Dynamic IEEE 802.11: Design, Modeling and Performance Evaluation. NETWORKING 2000: 786-798 - Roberto Canonico, Simon Pietro Romano, Mauro Sellitto, Giorgio Ventre:
A Scheme for Time-Dependent Resource Reservation in QoS-Enabled IP Networks. NETWORKING 2000: 811-822 - Fernando Cerdán, Olga Casals:
Mapping an Internet Assured Service on the GFR ATM Service. NETWORKING 2000: 398-409 - Tijani Chahed, Gérard Hébuterne, Caroline Fayet:
Mapping of Loss and Delay Between IP and ATM Using Network Calculus. NETWORKING 2000: 240-251 - Chih-Jen Chang, Arne A. Nilsson:
Fair Efficient Call Admission Control Policies for Heterogeneous Traffic Streams in a Packet Routing Server Using the DTM Technology. NETWORKING 2000: 620-631 - Xinjie Chang, Krishnappa R. Subramanian:
A Cooperative Game Theory Approach to Resource Allocation in Wireless ATM Networks. NETWORKING 2000: 969-978 - Jae-Hwan Chang, Leandros Tassiulas:
Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks. NETWORKING 2000: 702-713 - Feihong Chen, Necdet Uzun, Ali N. Akansu:
A Distributed Dynamic Scheduling Algorithm for a Terabit Multicast Packet Switch. NETWORKING 2000: 85-97 - Tibor Cinkler, László Ast:
Approximations for Call-Blocking Probabilities in Multirouting Multicasting Multirate Loss Networks. NETWORKING 2000: 287-298 - Marco Conti, Silvia Ghezzi, Enrico Gregori:
Aggregation of Markovian Sources: Approximations with Error Control. NETWORKING 2000: 350-361 - Luís Henrique Maciel Kosmalski Costa, Serge Fdida, Otto Carlos Muniz Bandeira Duarte:
Distance-Vector QoS-Based Routing with Three Metrics. NETWORKING 2000: 847-858 - István Cselényi, Gábor Fehér, Krisztián Németh:
Benchmarking of Signaling Based Resource Reservation in the Internet. NETWORKING 2000: 643-654 - Tim Daniëls, Chris Blondia:
Tail Transitions in Queues with Long Range Dependent Input. NETWORKING 2000: 264-274 - Kai-Oliver Detken:
Quality-of-Service (QoS) in Heterogeneous Networks: CLIP, LANE and MPOA Performance Test. NETWORKING 2000: 883-894 - Esmael Dinan, Daniel O. Awduche, Bijan Jabbari:
Optimal Traffic Partitioning in MPLS Networks. NETWORKING 2000: 144-155 - Pierre L. Douillet, André-Luc Beylot, Monique Becker:
Computing Stochastical Bounds for the Tail Distribution of an M/GI/1 Queue. NETWORKING 2000: 423-432
skipping 52 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-28 03:51 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint