scispace - formally typeset
Search or ask a question
Topic

Packet loss

About: Packet loss is a research topic. Over the lifetime, 21235 publications have been published within this topic receiving 302453 citations.


Papers
More filters
Proceedings ArticleDOI
21 May 2017
TL;DR: Two QoS-aware placement strategies are presented, an optimal solution based on the Integer Linear Programming (ILP) problem formulation and an efficient heuristic to obtain near optimal solution, aiming to support service differentiation between the users, while minimizing the associated service deployment cost for the operator.
Abstract: With Network Function Virtualization (NFV), network functions are deployed as modular software components on the commodity hardware, and can be further chained to provide services, offering much greater flexibility and lower cost of the service deployment for the network operators. At the same time, replacing the network functions implemented in purpose built hardware with software modules poses a great challenge for the operator to maintain the same level of performance. The grade of service promised to the end users is formalized in the Service Level Agreement (SLA) that typically contains the QoS parameters, such as minimum guaranteed data rate, maximum end to end latency, port availability and packet loss. State of the art solutions can guarantee only data rate and latency requirements, while service availability, which is an important service differentiator is mostly neglected. This paper focuses on the placement of virtualized network functions, aiming to support service differentiation between the users, while minimizing the associated service deployment cost for the operator. Two QoS-aware placement strategies are presented, an optimal solution based on the Integer Linear Programming (ILP) problem formulation and an efficient heuristic to obtain near optimal solution. Considering a national core network case study, we show the cost overhead of availability-awareness, as well as the risk of SLA violation when availability constraint is neglected. We also compare the proposed function placement heuristic to the optimal solution in terms of cost efficiency and execution time, and demonstrate that it can provide a good estimation of the deployment cost in much shorter time.

74 citations

Patent
29 Jul 2010
TL;DR: In this article, a service node can use a classification result to process other packets in a same packet flow, such that all packets of a flow do not need to be sent to an application node for processing.
Abstract: Packets are encapsulated and sent from a service node (e.g., packet switching device) using one or more services applied to a packet by an application node (e.g., a packet switching device and/or computing platform such as a Cisco ASR 1000) to generate a result, which is used by the service node to process packets of a flow of packets to which the packet belonged. An example of a service applied to a packet is a classification service, such as, but not limited to, using deep packet inspection on the packet to identify a classification result. The service node can, for example, use this classification result to process other packets in a same packet flow, such that all packets of a flow do not need to be, nor typically are, sent to an application node for processing.

74 citations

Journal ArticleDOI
TL;DR: Simulation results demonstrate the effectiveness of the FPLS scheduler, in comparison with other previously proposed scheduling algorithms, for wireless code-division multiple access communications.
Abstract: An efficient medium access control protocol with fair packet loss sharing packet scheduling is proposed for wireless code-division multiple access communications. The proposed MAC protocol exploits both time-division and code-division statistical multiplexing. The FPLS scheduler uses the information of traffic rate distribution and quality of service requirements to assign priorities to the users and determines an efficient combination of the packets for transmission in the time slots of each frame, so the number of the served users is maximized under the QoS constraints. Simulation results demonstrate the effectiveness of the FPLS scheduler, in comparison with other previously proposed scheduling algorithms.

74 citations

01 Jan 2000
TL;DR: Results are presented for an IP backbone network, which highlight how this new model finds the natural operating point for TCP, which depends on route lengths, end-to-end packet loss and the number of user sessions.
Abstract: This paper presents a new approach to modeling end-toend performance for IP networks. Unlike earlier models, in which end stations generate traffic at a constant rate, the work discussed here takes the adaptive behaviour of TCP/IP into account. The approach is based on a fixed point method which determines packet loss, link utilization and TCP throughput across the network. Results are presented for an IP backbone network, which highlight how this new model finds the natural operating point for TCP, which depends on route lengths (via round-trip times and number of resources), end-to-end packet loss and the number of user sessions.

74 citations

Patent
15 Sep 2009
TL;DR: In this paper, the authors proposed a remote access architecture for peer-to-peer communications and remote access connectivity, which provides a method for establishing a direct connection between peer computing devices via a third computing device such as a gateway.
Abstract: The present invention is generally directed towards a remote access architecture for providing peer-to-peer communications and remote access connectivity. In one embodiment, the remote access architecture of the present invention provides a method for establishing a direct connection between peer computing devices via a third computing device, such as a gateway. Additionally, the present invention provides the following techniques to optimize peer-to-peer communications: 1) false acknowledgement of receipt of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 2) payload shifting of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 3) reduction of packet fragmentation by adjusting the maximum transmission unit (MTU) parameter, accounting for overhead due to encryption, 4) application-aware prioritization of client-side network communications, and 5) network disruption shielding for reliable and persistent network connectivity and access.

74 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
96% related
Wireless ad hoc network
49K papers, 1.1M citations
96% related
Wireless network
122.5K papers, 2.1M citations
95% related
Wireless sensor network
142K papers, 2.4M citations
94% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023133
2022325
2021694
2020846
20191,033
2018993