The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Parallel transport control protocol (TCP) has been used to effectively utilize bandwidth for data intensive applications over high bandwidth-delay product (BDP) networks. On the other hand, it has been argued that, a single based TCP connection with proper modification such as HSTCP can emulate and capture the robustness of parallel TCP and can well replace it. In this work a Comparison between single-based...
We address the problem of maximizing the throughput for network coded multicast traffic in a wireless network in the bandwidth limited regime. For the joint scheduling and subgraph selection problem, we model valid network configurations as stable sets in an appropriately defined conflict graph. The problem formulation separates the combinatorial difficulty of scheduling from the arising optimization...
In order to improve the performance of existing multicast congestion control algorithm applied to wireless networks, in this paper, a TCP Vegas-like expert-controlled multicast congestion control mechanism (VEMCC) is proposed, which uses a recently proposed TCP Vegas throughput model. In VEMCC, the network congestion state is detected according to network relative queuing delay and packet loss; the...
We propose and evaluate a novel improvement to a previously published, unreliable covert channel based on the network traffic of multiplayer, first person shooter online games (FPSCC). Covert channels typically embed themselves within pre-existing (overt) data transmissions in order to carry hidden messages. FPSCC encodes covert bits as slight, yet continuous, variations of a player's character's...
This paper considers a communication system where m synchronized transmitters access a shared medium independently of each other with probability p, and upon access each user transmits a signal subject to an average power constraint P. A common receiver observes the sum of the signals transmitted by the active users corrupted by additive Gaussian noise. Let the throughput denote the sum of the achievable...
We propose a new cross-layer mechanism, referred to as route-control, for mobile ad-hoc networks (MANETs). This mechanism, which works in the network and transport layers, aims at enhancing the performance of MANETs' reliable transport protocols. The main idea behind the proposed mechanism is to notify the sender when the packets of a Transport layer flow change their route. We show that the sender...
This paper proposes an evolutionary approach to the network traffic optimization under the constraint of congestion avoidance. The individuals of the evolving population directly represents a set of paths in a network, and corresponding crossover and mutation operators are provided. The optimization is a global one, i.e. it will not optimize the paths independently but also taking link sharing into...
In this paper a communication system operating over a Gilbert-Elliot channel is studied. The goal of the transmitter is to maximize the number of successfully transmitted bits. This is achieved by choosing among three possible actions: (i) betting aggressively by using a weak code that allows the transmission of a high number of bits but provides no protection against a bad channel, (ii) betting conservatively...
We investigate the performance of rateless codes for single-server streaming to diverse users, assuming that diversity in users is present not only because they have different channel conditions, but also because they demand different amounts of information and have different decoding capabilities. The LT encoding scheme is employed. While some users accept output symbols of all degrees and decode...
The Stream Control Transmission Protocol (SCTP) is a new transport layer protocol. Multihoming is one of the most important features in SCTP, which can be used by the data sender to send data to a receiver through different paths. Although SCTP provides support for multihoming, the basic reason for such a provision was to improve reliability of associations. Currently, simultaneous transfer of new...
In order to improve the performance of existing multicast congestion control mechanisms applied to wireless networks, in this paper, we propose an expert-control-based intelligent multicast congestion control mechanism for wireless networks, termed ECMCC. ECMCC detects the network congestion state according to network relative queuing delay and packet loss, feedbacks information to multicast source...
From agriculture to industry, from the office to our homes, Wireless Sensor Networks (WSNs) are becoming a part of everyday life in many application areas. In typical WSN applications, the sensor nodes are fixed and interconnected amongst each other and to the outside world on a permanent basis. However, in certain types of applications, where the area to sense is wide and sensors are sparsely distributed,...
We investigate the achievable throughput regions for scenarios involving prioritized transmissions. Prioritized transmissions are useful in many multimedia networking applications where the transmitted data have an inherent hierarchy such that a piece of data at one level is only useful if all the pieces of data at all the lower levels are present. Formally, the prioritized transmission refers to...
Given a fixed network of routers, a set of multicast sources and their corresponding receivers, we investigate the problem of constructing multicast sessions that maximize the multicast throughput of all sessions under fairness constraints. It is known that for problems with only one source node, heuristic algorithms based on packing maximum-rate Steiner trees may achieve throughput close to network...
In recent years active reliable multicast protocols have gained popularity. However, the existing active reliable multicast protocols are based on receiver-initiated approach for loss recovery. Our approach, named DHARM, distributes the responsibility of loss recovery between the sender and the receivers. It helps to solve the scalability problems like acknowledgement implosion, recovery load balancing...
Congestion control of TCP protocol will reduce the size of congestion window to insure data transmission and reduce the degree of network congestion when a packet loss event that is regarded as a symbolic event of network congestion occurs. This method can be very effective in the low BER link, but it causes a sharp reduction of data transmission performance of TCP in a high BER link such as wireless...
Intra-layered multicast uses fixed sending rate interval for each layer, and a delegate of the receivers is selected in the layer for adjusting the layerpsilas sending rate. Sender adjusts layerpsilas sending rate within the layer rate interval according to the delegatepsilas rate. A scheme based on competition probability formula for delegate selection is proposed in this paper. Two factors determine...
IEEE 802.11 wireless network supports multiple link rates at the physical layer. Each link rate is associated with a certain required Signal-to-Interference-and-Noise Ratio (SINR) threshold for successfully decoding received packets. Suppose constant noise and no power adjustment strategy exists, apparently SINR is solely affected by the accumulated interference power level 1. The method of selecting...
We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence...
TFRC protocol has not been designed to enable reliability. Indeed, the birth of TFRC results from the need of a congestion controlled and realtime transport protocol in order to carry multimedia traffic. Historically, and following the anarchical deployment of congestion control mechanisms implemented on top of UDP protocol, the IETF decided to standardize such protocol in order to provide to multimedia...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.