I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Preemption algorithm with re-routing to minimize service de..:
, In:
The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.
,
Hau, Lau Chun
;
Soong, Boon-Hee
;
Kumar Bose, Sanjay
- p. 521-525 , 2004
Link:
https://doi.org/10.1109/ICCS.2004.1359431
RT T1
The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.
: T1
Preemption algorithm with re-routing to minimize service desruption
UL https://suche.suub.uni-bremen.de/peid=ieee-1359431&Exemplar=1&LAN=DE A1 Hau, Lau Chun A1 Soong, Boon-Hee A1 Kumar Bose, Sanjay YR 2004 K1 Asynchronous transfer mode K1 Analytical models K1 Electronic mail K1 Streaming media K1 Bandwidth K1 Protocols K1 Telecommunication traffic K1 Wireless networks SP 521 OP 525 LK http://dx.doi.org/https://doi.org/10.1109/ICCS.2004.1359431 DO https://doi.org/10.1109/ICCS.2004.1359431 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)