M Tech Dissertations

Permanent URI for this collectionhttp://ir.daiict.ac.in/handle/123456789/3

Browse

Filters

2004 - 20052

Settings

Has files: YesSubject: search.filters.subject.Routing

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Study of MPLS traffic engineering with constraint-based routing
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2004) Modi, Bhavesh; Maitra, Anutosh
    Multi-protocol Label Switching (MPLS) is fast becoming popular for future communication networks running applications demanding high speed and Quality of Service. In this work, we have studied the evolution of MPLS, various issues related to MPLS and the architecture ofMPLS. The simplicity and functional capabilities ofMPLS enables various important applications over it such as Virtual Private Networks, Provisioning of Quality of Service and Traffic Engineering. The traffic engineering perspective of MPLS is studied in a greater detail as MPLS protocol has certain advantageous features in traffic engineering applications, the major being that it allows explicit routing, through which separately calculated routes can be specified for different traffic flows. The process of route calculation can be automated with the help of Constraint-based Routing. The thesis also presents a study on Constraint-based routing in MPLS environment. After that, a few classical constraint-based routing algorithms that consider bandwidth as constraint are investigated. The effectiveness of these algorithms is ascertained by means of simulation results. The concept of minimum interference routing and the corresponding algorithm MIRA is studied in greater detail in this work and presented in the thesis. The performance of MIRA was analyzed and factors that affect the performance were identified. Finally, the work suggests two modifications over MIRA based on the observations and analysis mentioned above. The primary philosophy behind the modifications are identifying the criticality of the resources and quantifying the order of the criticality. The performance of the suggested modified algorithms is benchmarked against classical MIRA algorithm and the simulation results are presented.
  • Thumbnail Image
    ItemOpen Access
    Selfish routing and network creation games
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2005) Gandhi, Ratnik; Chatterji, Samaresh
    This work studies the two important problems of routing and network creation in the situation of selfish behavior of agents. In routing, agents want to send their data from source to destination. They try to reduce cost incurred in the process of routing. In network creation, agents create agent-to-agent link to form a network on which they can Communicate. Here there are two types of cost incurred: link creation cost and routing cost. Each agent tries to reduce his own cost. To study degradation caused by selfish behavior of agents we primarily use the standard notation of Price of Anarchy, which is ratio of the cost incurred at Nash equilibrium to the optimal cost. We show some results on Price of Anarchy and on different cost functions for above two problems, we propose a new model in network creation and show a polynomial time algorithm to verify Nash equilibrium.