SCIRP Mobile Website
Paper Submission

Why Us? >>

  • - Open Access
  • - Peer-reviewed
  • - Rapid publication
  • - Lifetime hosting
  • - Free indexing service
  • - Free promotion service
  • - More citations
  • - Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.


Contact Us >>

Article citations


S. Dasgupta, J. C. D. Oliveira, and J. P. Vasseur, “A new distributed dynamic bandwidth reservation mechanism to improve resource utilization: Simulation and analysis on real network and traffic scenarios,” Proceedings of 25th IEEE International Conference on Computer Communications INFOCOM, Barcelona, pp. 1-12, 2006.

has been cited by the following article:

  • TITLE: Load Control for Overloaded MPLS/DiffServ Networks during SLA Negotiation


    KEYWORDS: End-To-End Qos Provisioning, Traffic Engineering In MPLS/Diffserv Networks,

    JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.2 No.5, August 21, 2009

    ABSTRACT: In end-to-end QoS provisioning some bandwidth portions on the link may be reserved for certain traffic classes (and for particular set of users) so the congestion problem of concurrent flows (traversing the network simultaneously) can appear. It means that in overloaded and poorly connected MPLS/DS networks the CR (Constraint-based Routing) becomes insufficient technique. If traffic engineering is supported with ap-propriate traffic load control the congestion possibility can be predicted before the utilization of guaranteed service. In that sense the initial (proactive) routing can be pre-computed much earlier, possible during SLA (Service Level Agreement) negotiation. In the paper a load simulation technique for load balancing control purpose is proposed. It could be a very good solution for congestion avoidance and for better load-balancing purpose where links are running close to capacity. To be acceptable for real application such complicated load control technique needs very effective algorithm. Proposed algorithm was tested on the network with maximum M core routers on the path and detail results are given for N=3 service classes. Further improve-ment through heuristic approach is made and results are discussed. Some heuristic options show significant complexity savings that is appropriate for load control in huge networks.