WIPO logo
Mobile | Deutsch | Español | Français | 日本語 | 한국어 | Português | Русский | 中文 | العربية |
PATENTSCOPE

Search International and National Patent Collections
World Intellectual Property Organization
Search
 
Browse
 
Translate
 
Options
 
News
 
Login
 
Help
 
Machine translation
1. (WO2007004885) A METHOD FOR BUFFERING DATA
Latest bibliographic data on file with the International Bureau   

Pub. No.:    WO/2007/004885    International Application No.:    PCT/NO2005/000367
Publication Date: 11.01.2007 International Filing Date: 30.09.2005
Chapter 2 Demand Filed:    24.07.2006    
IPC:
H04L 12/56 (2006.01)
Applicants: TELEFONAKTIEBOLAGET LM ERICSSON (publ) [SE/SE]; S-164 83 STOCKHOLM (SE) (For All Designated States Except US).
SVELMOE, Geir Robert [NO/NO]; (NO) (For US Only)
Inventors: SVELMOE, Geir Robert; (NO)
Agent: OSLO PATENTKONTOR AS; P.O. Box 7007M, N-0306 OSLO (NO)
Priority Data:
20053190 30.06.2005 NO
Title (EN) A METHOD FOR BUFFERING DATA
(FR) PROCÉDÉ POUR LA MISE EN MÉMOIRE TAMPON DES DONNÉES
Abstract: front page image
(EN)A method for controlling the content of a circular buffer memory, including: receiving a number of data packets, storing said packets in said buffer memory, check if N+S>=2k-2, N being new packets received in the buffer, S being packets scheduled for transmission, k being the maximum input rate in packets per polling, if so drop the oldest unscheduled packets until N+S≤2k-2, schedule k-2 packets for transmission, receive more packets, and so on, each step being executed during subsequent pollings of the memory.
(FR)La présente invention concerne un procédé pour commander le contenu d’une mémoire tampon circulaire, comprenant : la réception de plusieurs paquets de données, le stockage desdits paquets dans ladite mémoire tampon, la vérification si N+S>=2k-2, N étant de nouveaux paquets reçus dans le tampon, S étant les paquets devant être transmis, k étant le taux d’entrée maximal de paquets par invitation à transmettre, le cas échéant retirer les plus anciens paquets non planifiés jusqu’à N+S≤2k-2, planifier k-2 paquets pour transmission, recevoir plus de paquets, et ainsi de suite, chaque étape étant exécutée au cours des invitations à transmettre de la mémoire.
Designated States: AE, AG, AL, AM, AT, AU, AZ, BA, BB, BG, BR, BW, BY, BZ, CA, CH, CN, CO, CR, CU, CZ, DE, DK, DM, DZ, EC, EE, EG, ES, FI, GB, GD, GE, GH, GM, HR, HU, ID, IL, IN, IS, JP, KE, KG, KM, KP, KR, KZ, LC, LK, LR, LS, LT, LU, LV, LY, MA, MD, MG, MK, MN, MW, MX, MZ, NA, NG, NI, NO, NZ, OM, PG, PH, PL, PT, RO, RU, SC, SD, SE, SG, SK, SL, SM, SY, TJ, TM, TN, TR, TT, TZ, UA, UG, US, UZ, VC, VN, YU, ZA, ZM, ZW.
African Regional Intellectual Property Organization (BW, GH, GM, KE, LS, MW, MZ, NA, SD, SL, SZ, TZ, UG, ZM, ZW)
Eurasian Patent Organization (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM)
European Patent Office (AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HU, IE, IS, IT, LT, LU, LV, MC, NL, PL, PT, RO, SE, SI, SK, TR)
African Intellectual Property Organization (BF, BJ, CF, CG, CI, CM, GA, GN, GQ, GW, ML, MR, NE, SN, TD, TG).
Publication Language: English (EN)
Filing Language: English (EN)