SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Petlund Andreas) "

Sökning: WFRF:(Petlund Andreas)

  • Resultat 1-10 av 11
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Khademi, Naeem, et al. (författare)
  • Deliverable D2.3 - Final Version of Core Transport System
  • 2017
  • Rapport (refereegranskat)abstract
    • This document presents the core transport system in NEAT, as used for development of the reference implementation of the NEAT System. The document describes the components necessary to realise the basic Transport Services provided by the NEAT User API, with the description of a set of NEAT building blocks and their related design choices. The design of this core transport system, which is the final product ofWork Package 2, is driven by the Transport Services and API design from Task 1.4, and in close coordination with the overall NEAT architecture defined in Task 1.2. To realise the Transport Services provided by the API, a set of transport functions has to be provided by the NEAT Core Transport System. These functions take the form of several building blocks, or NEAT Components, each representing an associated implementation activity. Some components are needed to ensure the basic operation of the NEAT System—e.g., a NEAT Flow Endpoint, a callback-based NEAT API Framework, the NEAT Logic and the functionality to Connect to a name. Additional components are needed for: (a) ensuring connectivity, by means of mechanisms for discovery of path support for different protocols; (b) supporting end-to-end security; (c) the ability to apply different policies to influence the decision-making process of the transport system; (d) providing other important functionalities (e.g., a user-space SCTP stack, or gathering statistics for users or system administrators). This document updates Deliverable D2.2; in particular, the descriptions of NEAT components presented here correspond to their implementation status by the end of WP2, and as such they supersede those in D2.2.
  •  
2.
  • Ali, Sharib, et al. (författare)
  • A multi-centre polyp detection and segmentation dataset for generalisability assessment.
  • 2023
  • Ingår i: Scientific data. - : Springer Science and Business Media LLC. - 2052-4463. ; 10:1
  • Tidskriftsartikel (refereegranskat)abstract
    • Polyps in the colon are widely known cancer precursors identified by colonoscopy. Whilst most polyps are benign, the polyp's number, size and surface structure are linked to the risk of colon cancer. Several methods have been developed to automate polyp detection and segmentation. However, the main issue is that they are not tested rigorously on a large multicentre purpose-built dataset, one reason being the lack of a comprehensive public dataset. As a result, the developed methods may not generalise to different population datasets. To this extent, we have curated a dataset from six unique centres incorporating more than 300 patients. The dataset includes both single frame and sequence data with 3762 annotated polyp labels with precise delineation of polyp boundaries verified by six senior gastroenterologists. To our knowledge, this is the most comprehensive detection and pixel-level segmentation dataset (referred to as PolypGen) curated by a team of computational scientists and expert gastroenterologists. The paper provides insight into data construction and annotation strategies, quality assurance, and technical validation.
  •  
3.
  •  
4.
  • Briscoe, Bob, et al. (författare)
  • Reducing Internet Latency : A Survey of Techniques and Their Merits
  • 2016
  • Ingår i: IEEE Communications Surveys and Tutorials. - : IEEE. - 1553-877X. ; 18:3, s. 2149-2196
  • Tidskriftsartikel (refereegranskat)abstract
    • Latency is increasingly becoming a performance bottleneck for Internet Protocol (IP) networks, but historically, networks have been designed with aims of maximizing throughput and utilization. This paper offers a broad survey of techniques aimed at tackling latency in the literature up to August 2014, as well as their merits. A goal of this work is to be able to quantify and compare the merits of the different Internet latency reducing techniques, contrasting their gains in delay reduction versus the pain required to implement and deploy them. We found that classifying techniques according to the sources of delay they alleviate provided the best insight into the following issues: 1) The structural arrangement of a network, such as placement of servers and suboptimal routes, can contribute significantly to latency; 2) each interaction between communicating endpoints adds a Round Trip Time (RTT) to latency, particularly significant for short flows; 3) in addition to base propagation delay, several sources of delay accumulate along transmission paths, today intermittently dominated by queuing delays; 4) it takes time to sense and use available capacity, with overuse inflicting latency on other flows sharing the capacity; and 5) within end systems, delay sources include operating system buffering, head-of-line blocking, and hardware interaction. No single source of delay dominates in all cases, and many of these sources are spasmodic and highly variable. Solutions addressing these sources often both reduce the overall latency and make it more predictable.
  •  
5.
  • Hurtig, Per, 1980-, et al. (författare)
  • TCP and Stream Control Transmission Protocol (SCTP) RTO Restart
  • 2016
  • Ingår i: Internet RFCs. - 2070-1721. ; :7765
  • Tidskriftsartikel (refereegranskat)abstract
    • This document describes a modified sender-side algorithm for managing the TCP and Stream Control Transmission Protocol (SCTP) retransmission timers that provides faster loss recovery when there is a small amount of outstanding data for a connection. The modification, RTO Restart (RTOR), allows the transport to restart its retransmission timer using a smaller timeout duration, so that the effective retransmission timeout (RTO) becomes more aggressive in situations where fast retransmit cannot be used. This enables faster loss detection and recovery for connections that are short lived or application limited.
  •  
6.
  • Kargar Bideh, Minoo, et al. (författare)
  • TADA: An Active Measurement Tool for Automatic Detection of AQM
  • 2015
  • Ingår i: Proceeding VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools. - Brussels : The Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. - 9781631900969 ; , s. 55-60
  • Konferensbidrag (refereegranskat)abstract
    • The problem of overbuffering in today's Internet (termed as bufferbloat) has recently drawn a great amount of attention from the research community. This has led to the development of various active queue management (AQM) schemes. The last years have seen a lot of effort to show the benefits of AQMs over simple tail-drop queuing and to encourage deployment. Yet it is still unknown to what extent AQMs are deployed in the Internet. In this paper, we present an end-to-end active measurement method to detect AQMs on the path bottleneck. We have developed an active measurement tool, named TADA, and evaluated our measurement methodology on a controlled experimental testbed. Experimental results show that the proposed approach provides the basis to identify whether an AQM is deployed on the bottleneck.
  •  
7.
  • Khademi, Naeem, et al. (författare)
  • Deliverable D2.2 - Core Transport System, with both Low-level and High-level Components
  • 2017
  • Rapport (refereegranskat)abstract
    • This document presents the core transport system in NEAT, as used for development of thereference implementation of the NEAT System. The document describes the componentsnecessary to realise the basic Transport Services provided by the NEAT User API, with thedescription of a set of NEAT building blocks and their related design choices. The designof this core transport system takes into consideration the Transport Services and the API(defined in Task 1.3) and in close coordination with the overall architecture (Task 1.2).To realise the Transport Services provided by the API, a set of transport functionalitieshas to be provided by the NEAT Core Transport System. These functionalities take the formof several building blocks, or NEAT Components, each representing an associated implementationactivity. Some of the components are needed to ensure the basic operation ofthe NEAT System—e.g., a NEAT Flow Endpoint, a callback-based NEAT API Framework, theNEAT Logic and the functionality to Connect to a name. Additional components are neededfor: (a) ensuring connectivity, by means of mechanisms for discovery of path support fordifferent protocols; (b) supporting end-to-end security; (c) the ability to apply differentpolicies to influence the decision-making process of the transport system; (d) providingother important functionalities (e.g., a user-space SCTP stack, or gathering statistics forusers or system administrators).This document updates Deliverable D2.1; in particular, the descriptions of NEAT componentspresented here correspond to the implementation status at the time of writing,and as such they replace those in D2.1.
  •  
8.
  • Rajiullah, Mohammad, 1981-, et al. (författare)
  • An Evaluation of Tail Loss Recovery Mechanisms for TCP
  • 2015
  • Ingår i: Computer communication review. - USA : ACM Special Interest Group on Computer Science Education. - 0146-4833 .- 1943-5819. ; 45:1, s. 6-11
  • Tidskriftsartikel (refereegranskat)abstract
    • Interactive applications do not require more bandwidth to go faster. Instead, they require less latency. Unfortunately, the current design of transport protocols such as TCP limits possible latency reductions. In this paper we evaluate and compare different loss recovery enhancements to fight tail loss latency. The two recently proposed mechanisms "RTO Restart" (RTOR) and "Tail Loss Probe" (TLP) as well as a new mechanism that applies the logic of RTOR to the TLP timer management (TLPR) are considered. The results show that the relative performance of RTOR and TLP when tail loss occurs is scenario dependent, but with TLP having potentially larger gains. The TLPR mechanism reaps the benefits of both approaches and in most scenarios it shows the best performance.
  •  
9.
  • Rajiullah, Mohammad, 1981-, et al. (författare)
  • Reducing Internet Transport Latency for Thin Streams and Short Flows
  • 2013
  • Ingår i: Future Network & Mobile Summit 2013. - 9781905824366
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
    • The present Internet limits the performance of applications that need real- time interaction. This is in part because the design of the network has been optimised to boost throughput, maximising efficiency for bulk applications. However, changes in use have resulted in that an increasing number of applications now depend on timely delivery. One of the targets of the RITE project is to reduce internet transport latency in support of such applications. Initial results from the project on how end nodes can be optimized for more timely error recovery are presented in this poster. 
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 11

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy