Building a Robust Software Based Router

  • Aruna Elangovan
  • Abirami Shri Agilandan
  • Ajanthaa Lakkshmanan
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 28)

Abstract

In Robust software-based router, the ultimate work is to implement a PC, which acts like a router. Although much work has done on software based router most has focused on satisfying specific requirements. Our work focuses towards the extension of software based router with routing algorithms to satisfy the QOS-based routing issues and requirements, and satisfy system parameters. The main assumption behind this work is to end up by incorporating intelligent based routers that can decouple application QOS needs, which can adopt itself to wide range of application requirements. End to end predictability comes from having the necessary intelligence in each place. Too much intelligence has historically been a problem. The issues of fairness are also considered in the evaluation of routing algorithms. Software based router is that the router needs to provide predictable treatment of packets ,queue delay and drop characteristics, assure certain rates, loss characteristics, or delay bounds to identified classes of traffic. Three admission control algorithms are proposed for providing strong end–to–end guarantees and a good candidate for a QoS routing scheme, where delay, bandwidth and jitter constraints need to be respected.

Keywords

Robust Software based Router QoS (Quality of Service) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, S., Nahrstedt, K.: Over view of Quality of Service Routing for Next Generation high speed Networks: Problems and Solutions. IEEE (1998)Google Scholar
  2. 2.
    Bak, S., Cobb, J.A.: Randomized Distance – Vector Routing Protocol. IEEE (1999)Google Scholar
  3. 3.
    Eom, H., Agrawala, A.K., Noh, S.H., Shankar, A.U.: Information Dynamics Applied to Link State Routing (2001)Google Scholar
  4. 4.
    Eorn, H.: Improving Link State Routing by using Estimated Future Link Delays (2002)Google Scholar
  5. 5.
    Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in Multicast Routing (2003)Google Scholar
  6. 6.
    Awerbuch, B., Azar, Y., Plotkin, S., Waarts, S.: Throughput-Competitive On-line Routing. In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California (1993)Google Scholar
  7. 7.
    Awerbuch, B., Azar, Y., Plotkin, S., Waarts, O.: Competitive Routing of Virtual Circuits with Unknown Duration. In: 5th ACM-SIAM Symposium on Discrete Algorithms (1994)Google Scholar
  8. 8.
    Behrens, J., Garcia-Luna-Aceves, J.J.: Hierarchical Routing Using Link Vectors. In: IEEE INFOCOM 1998 (1998)Google Scholar
  9. 9.
    Mirabella, O., Bello, L., Raucea, A.: Improving routing in long-distance wireless mesh networks via a distributed embedded router. Journal of Parallel and Distributed Computing 68(3), 361–371 (2008)CrossRefMATHGoogle Scholar
  10. 10.
    Li, Z., Garcia-Luna-Aceves, J.J.: Finding multi-constrained feasible paths by using depth-first search. Wireless Networks 13(3), 323–334 (2007)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Aruna Elangovan
    • 1
  • Abirami Shri Agilandan
    • 1
  • Ajanthaa Lakkshmanan
    • 1
  1. 1.School of Computing Science and EngineeringVellore Institute of TechnologyVelloreIndia

Personalised recommendations