International Journal of Engineering Trends and Technology (IJETT) Volume 4 Issue 9- Sep 2013

ISSN: 2231-5381 http://www.ijettjournal.org Page 4119

Packet Loss Control Using STLCC
Mechanism

G. Srikanth Reddy

Asst. Professor, Dept. of C.S.E
MRIET, Hyderabad, A.P., India

B. Revathi kumari
Dept. of C.S.E
MRIET, Hyderabad, A.P., India

Abstract - Presently the Internet accommodates simultaneous
audio, video, and data traffic. This requires the Internet to
guarantee the packet loss which at its turn depends very much
on congestion control. A series of protocols have been
introduced to supplement the insufficient TCP mechanism
controlling the network congestion. CSFQ was designed as an
open-loop controller to provide the fair best effort service for
supervising the per-flow bandwidth consumption and has
become helpless when the P2P flows started to dominate the
traffic of the Internet. Token-Based Congestion Control
(TBCC) is based on a closed-loop congestion control principle,
which restricts token resources consumed by an end-user and
provides the fair best effort service. As Self-Verifying CSFQ
and Re-feedback, it experiences a heavy load by policing inter-
domain traffic for lack of trust.
In this paper, Stable Token-Limited Congestion Control
(STLCC) is introduced as new protocols which appends inter-
domain congestion control to TBCC and make the congestion
control system to be stable. STLCC is able to shape output and
input traffic at the inter-domain link.
STLCC produces a congestion index pushes the packet loss to
the network edge and improves the network performance.
Finally, the simple version of STLCC is introduced. This
version is deployable in the Internet without any IP protocols
modifications and preserves also the packet datagram.

Keywords - P2P, Congestion Control, Congestion-Index, CSFQ,
TBCC, TLCC.

I. INTRODUCTION

Modern IP network services provide for the
simultaneous digital transmission of voice, video,
and data. These services require congestion
control protocols and algorithms which can solve
the packet loss parameter can be kept under
control.
Congestion control is therefore, the cornerstone
of packet switching networks. It should prevent
congestion collapse, provide fairness to competing
flows and optimize transport performance indexes
such as throughput, delay and loss.



Congestion control of the best-effort service in
the Internet was originally designed for a
cooperative environment. It is still mainly
dependent on the TCP congestion control
algorithm at terminals, supplemented with load
shedding at congestion links. This model is called
the Terminal Dependent Congestion Control case.
Although routers equipped with Active Queue
Management such as RED can improve transport
performance, they are neither able to prevent
congestion collapse nor provide fairness to
competing flows.
In order to enhance fairness in high speed
networks, Core-Stateless Fair Queuing (CSFQ) set
up an open- loop control system at the network
layer, which inserts the label of the flow arrival
rate onto the packet header at edge routers and
drops the packet at core routers based on the rate
label if congestion happens.
CSFQ is the first to achieve approximate fair
bandwidth allocation among flows with core
routers. Edge routers maintain per flow state; they
estimate the incoming rate of each flow and insert
a label into each packet header based on this
estimate. Core routers maintain no per flow state;
they use FIFO packet scheduling augmented by a
probabilistic dropping algorithm that uses the
packet labels and an estimate of the aggregate
traffic at the router.
According to Cache Logic report, P2P traffic
was 60% of all the Internet traffic in 2004, of
which Bit-Torrent was responsible for about 30%
of the above, although the report generated quite a
lot of discussions around the real numbers.

International Journal of Engineering Trends and Technology (IJETT) Volume 4 Issue 9- Sep 2013

ISSN: 2231-5381 http://www.ijettjournal.org Page 4120

In networks with P2P traffic, CSFQ can provide
fairness to competing flows, but unfortunately it is
not what end-users and operators really want.
Token-Based Congestion Control (TBCC)
restricts the total token resource consumed by an
end-user. So, no matter how many connections the
end-user has set up, it cannot obtain extra
bandwidth resources when TBCC is used.
The Self-Verifying CSFQ tries to expand CSFQ
across the domain border. It randomly selects a
flow, re-estimates the flows rate, and checks
whether the re-estimated rate is consistent with the
label on the flows packet.
In this paper a new and better mechanism for
congestion control with application to Packet Loss
in networks with P2P traffic is proposed.
In this new method the edge and the core routers
will write a measure of the quality of service
guaranteed by the router by writing a digital
number in the Option Field of the datagram of the
packet. This is called a token. The token is read by
the path routers and interpreted as its value will
give a measure of the congestion especially at the
edge routers. Based on the token number the edge
router at the sources edge point will shape the
traffic generated by the source, thus reducing the
congestion on the path.
In Token-Limited Congestion Control (TLCC)
the inter-domain router restricts the total output
token rate to peer domains. When the output token
rate exceeds the threshold, TLCC will decreases
the Token-Level of output packets, and then the
output token rate will decrease.

II. RELATED WORKS

The basic idea behind RED queue management
is to detect incipient congestion early and to
convey congestion notification to the end-hosts,
allowing them to reduce their transmission rates
before queues in the network overflow and packets
are dropped.
Flow Random Early Drop (FRED) is a modified
version of RED, which uses per-active-flow
accounting to make different dropping decisions
for connections with different bandwidth usages.
FRED only keeps track of flows that have packets
in the buffer, thus the cost of FRED is
proportional to the buffer size and independent of
the total flow numbers. FRED can achieve the
benefits of per-flow queuing and round-robin
scheduling. Some other interesting features of
FRED include: (1) penalizing non-adaptive flows
by imposing a maximum number of buffered
packets, and surpassing their share to average per-
flow buffer usage; (2) protecting fragile flows by
deterministically accepting flows from low
bandwidth connections; (3) providing fair sharing
for large numbers of flows by using two-packet-
buffer when buffer is used up; (4) fixing several
imperfections of RED by calculate average queue
length at both packet arrival and departure (which
also causes more overhead).
CSFQ was designed as an open-loop controller
to provide the fair best effort service. CSFQ (Core
Stateless fair Queuing) is a Queuing Technique
used to achieve fair bandwidth allocation using
differential packet dropping. The CSFQ
architecture differentiates between edge and core
nodes. The edge nodes performs per flow
management, core nodes do not perform per flow
management and therefore can be efficiently
implemented at high speeds.

Fig.1 Fair defect of CSFQ

Token-Based Congestion Control (TBCC) is
based on a closed-loop congestion control
principle, which restricts token resources
consumed by an end-user and provides the fair
best effort service
International Journal of Engineering Trends and Technology (IJETT) Volume 4 Issue 9- Sep 2013

ISSN: 2231-5381 http://www.ijettjournal.org Page 4121

Fairness of TBCC: for a bit-torrent application,
with limited access resource, it can achieve better
through put, but do not hurt the performance of
networks.

Fig. 2 Architecture of TBCC


III. PROPOSED WORKS

Similarly to CSFQ and TBCC, TLCC uses also
the iterative algorithm to estimate the congestion
level of its output link, and requires a long period
of time to reach a stable state.
With bad parameter configuration, TLCC may
cause the traffic to fall into an oscillated process.
The window size of TCP flows will always
increase when acknowledge packets are received,
and the congestion level will increase at the
congested link. At congestion times many flows
will lose their packets. Then, the link will be idle
and the congestion level will decrease. The two
steps may be repeated alternately, and then the
congestion control system will never reach
stability.
To solve the oscillation problem, the Stable
Token-Limited Congestion Control (STLCC) is
introduced. It integrates the algorithms of TLCC
and XCP altogether.
In STLCC, the output rate of the sender is
controlled according to the algorithm of XCP, so
there is almost no packet lost at the congested link.
At the same time, the edge router allocates all the
access token resource to the incoming flows
equally. When congestion happens, the incoming
token rate increases at the core router, and then the
congestion level of the congested link will also
increase. Thus STLCC can measure the congestion
level analytically, allocate network resources
according to the access link, and further keep the
congestion control system stable.

IV. CONCLUSION

The architecture of Token-Based Congestion
Control (TBCC), which provides fair bandwidth
allocation to end-users in the same domain will be
introduced. Two congestion control algorithms
CSFQ and TBCC are evaluated. STLCC is
presented and the simulation is designed to
demonstrate its validity. The simple version of
STLCC is proposed, which can be deployed on the
current Internet.

REFERENCES

[1] Andrew S. Tanenbaum, Computer Networks, Prentice-Hall
International, Inc.
[2] S. Floyd and V. J acobson. RandomEarly Detection Gateways
for Congestion Avoidance, ACM/IEEE Transactions on
Networking, August 1993.
[3] Ion Stoica, Scott Shenker, Hui Zhang, "Core-Stateless Fair
Queueing: A Scalable Architecture to Approximate Fair
Bandwidth Allocations in High Speed Networks", In Proc. of
SIGCOMM, 1998.
[4] D. Qiu and R. Srikant. Modeling and performance analysis of
BitTorrent-like peer-to-peer networks. In Proc. of SIGCOMM,
2004.
[5] Zhiqiang Shi, Token-based congestion control: Achieving fair
resource allocations in P2P networks, Innovations in NGN:
Future Network and Services, 2008. K-INGN 2008. First ITU-
T Kaleidoscope Academic Conference.
[6] I. Stoica, H. Zhang, S. Shenker Self-Verifying CSFQ, in
Proceedings of INFOCOM, 2002.
[7] Bob Briscoe Policing Congestion Response in an
Internetwork using Refeedback In Proc. ACM
SIGGCOMM05, 2005,
[8] Bob Briscoe,Re-feedback:Freedom with Accountability for
Causing Congestion in a Connectionless Internetwork,
http://www.cs.ucl.ac.uk/staff/B.Briscoe/
projects/e2ephd/e2ephd_y9_cutdown_appxs.pdf
[9] Zhiqiang Shi, Yuansong Qiao, Zhimei Wu, Congestion
Control with the Fixed Cost at the Domain Border, Future
Computer and Communication (ICFCC),2010.
[10] Dina Katabi, Mark Handley, and Charles Rohrs, "Internet
Congestion Control for Future High Bandwidth-Delay Product
Environments." ACM Sigcomm2002, August 2002.
International Journal of Engineering Trends and Technology (IJETT) Volume 4 Issue 9- Sep 2013

ISSN: 2231-5381 http://www.ijettjournal.org Page 4122

[11] Abhay K. Patekh, A Generalized Processor Sharing
Approach Flow Control in Integrated Services Networks: The
Single-Node Case, IEEE/ACM Trans. on Network, Vol. 1,
No.3, J une 1993.
[12] Sally Floyd, Van J acobson, Link-sharing and Resource
Management Models for Packet Networks, IEEE\ACM
Transactions on Networking, Vol.3, No.4, 1995.
[13] J ohn Nagle, RFC896 congestion collapse, J anuary 1984.
[14] Sally Floyd and Kevin Fall, Promoting the Use of End-to-
End Congestion Control in the Internet, IEEE/ACM
Transactions on Networking, August 1999.
[15] V. J acobson. Congestion Avoidance and Control.
SIGCOMM Symposiumon Communications Architectures
and Protocols, pages 314329, 1988.
[16] http://www.isi.edu/nsnam/ns/
[17] L. Benmohamed and S. M. Meerkov, Feedback control of
congestion in packet switching networks: The case of a single
congested node, IEEE/ACM Trans. Networking, vol. 1, pp.
693708, Dec. 1993.
[18] E. Altman, T. Basar, and R. Srikant, Control methods for
communica- tion networks, in Proc. 36th Conf. Decision
and Control, San Diego, CA, 1997, pp. TA 317741809,
TM3 2368 2404, TP3 29032945.
[19] S. H. Low and D. E. Lapsey, Optimization flow controlI:
Basic al- gorithms and convergence, IEEE/ACM Trans.
Networking, vol. 7, pp. 861874, Dec. 1999.
[20] S. Floyd and K. Fall, Promoting the use of end-to-end
congestion con- trol in the Internet, IEEE/ACM Trans.
Networking, vol. 7, pp. 458472, Aug. 1999.