By Topic

Resource efficient network coding based congestion control for streaming applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zsuzsanna Ilona Kiss ; The Communications Department, Technical University of Cluj Napoca, 400027 Cluj Napoca ; Zsolt Alfred Polgar ; Mircea Giurgiu ; Virgil Dobrota

The paper proposes a resource efficient solution for Network Coding (NC) based congestion control consisting in identification around the congested links of multiple butterfly topologies by using the Discrete Lagrange Multiplier optimization algorithm. The instantiation of the butterfly topologies is based on the resource management capabilities foreseen for the entities of the future networks. The congestion control issue is tackled by separate encoding of appropriately selected pairs of data flows passing through the congested link. By optimal selection of the flows to be coded it is achieved the goal to minimize the additional network resources required by the NC operations. The encoding is realized with an XOR-based algorithm adapted for unequal bit rate data flows, and the experimental performances are reported here. Due to its efficient usage of the network resources and high degree of scalability, the congestion control solution proposed is suitable for large bit rate transmissions, like video streaming.

Published in:

Telecommunications and Signal Processing (TSP), 2011 34th International Conference on

Date of Conference:

18-20 Aug. 2011