Sökning: "Packet Size"

Visar resultat 11 - 15 av 73 uppsatser innehållade orden Packet Size.

  1. 11. RISC-V Based Application-Specific Instruction Set Processor for Packet Processing in Mobile Networks

    Master-uppsats, Linköpings universitet/Datorteknik

    Författare :Oskar Södergren; [2021]
    Nyckelord :eCPRI; ORAN; ASIP; fronthaul; RISC-V; bit manipulation; 5G; packet processing;

    Sammanfattning : This thesis explores the use of an ASIP for handling O-RAN control data. A model application was constructed, optimized and profiled on a simple RV32-IMC core. The compiled code was analyzed, and the instructions “byte swap”, “pack”, bitwise extract/deposit” and “bit field place” were implemented. LÄS MER

  3. 12. AI-Powered Network Traffic Prediction

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Amin Bolakhrif; [2021]
    Nyckelord :Deep Learning; IP Address; Machine Learning; Network Traffic Flows; Neural Networks; Predictive Model; Regression.; Djupinlärning; IP Address; Maskininlärning; Nätverkstrafikflöden; Neurala Nätverk; Prediktionsmodell; Regression.;

    Sammanfattning : In this Internet and big data era, resource management has become a crucial task to ensure the quality of service for users in modern wireless networks. Accurate and rapid Internet traffic data is essential for many applications in computer networking to enable high networking performance. LÄS MER

  4. 13. Extreme Quantile Estimation of Downlink Radio Channel Quality

    Master-uppsats, Linköpings universitet/Artificiell intelligens och integrerade datorsystem

    Författare :Philip Palapelas Kantola; [2021]
    Nyckelord :quantile regression; telecommunications; machine learning; quantile regression neural network; link adaptation; sinr;

    Sammanfattning : The application area of Fifth Generation New Radio (5G-NR) called Ultra-Reliable and Low-Latency Communication (URLLC) requires a reliability, the probability of receiving and decoding a data packet correctly, of 1 - 10^5. For this requirement to be fulfilled in a resource-efficient manner, it is necessary to have a good estimation of extremely low quan- tiles of the channel quality distribution, so that appropriate resources can be distributed to users of the network system. LÄS MER

  5. 14. Jämförelse av prestanda mellan GraphQL och REST

    M1-uppsats, KTH/Hälsoinformatik och logistik

    Författare :Sara Onval; Iman Dualeh; [2020]
    Nyckelord :GraphQL; REST; cache; latency; data volume; performance; overfetching; underfetching; endpoints; data-fetching; GraphQL; REST; cache; latens; datavolym; prestanda; overfetching; underfetching; slutpunkter; datahämtning;

    Sammanfattning : Med dagens snabba utveckling av informationsteknologin och med ökningen av antalet människor som är uppkopplade mot Internet, blir utvecklingen av webbtjänster allt viktigare. Eftersom webbtjänster har en betydande roll för utvecklingen av Internet, uppstår frågan om vilka verktyg som bör användas för att uppnå den prestanda som dagens användare kräver. LÄS MER

  7. 15. An Analysis of the Queueing Delays and Throughput of the TCP BBR Congestion Control in NS-3

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Xinkai Xiong; [2020]
    Nyckelord :Congestion Control; TCP; BBR; Latency; ns-3; Trängsel Kontroll; TCP; BBR; Latens; ns-3;

    Sammanfattning : BBR is a congestion control recently proposed by Google, unlike the traditional congestion control which uses packet loss as the signal of congestion, BBR uses the estimation of bottleneck bandwidth to control the sending rate. However, recent work shows that BBR suffers from a variety of problems such as large queuing delays with multiple flows in the network. LÄS MER