Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by A. Subramani
Total Records ( 2 ) for A. Subramani
  A. Subramani and A. Krishnan
  A general goal of the Asynchronous Transfer Mode (ATM) network is to support connections a cross Local-Area Networks (LANs), Metropolitan Area Networks (MANs) and Wide Area Networks (WANs). However, in Available Bit Rate (ABR) service, different treatments are offered according to different Round Trip Times (RTTs) of connections. To improve the above unfairness, this study presents Doubly Finite Queue mechanism and Multi Source Virtual Dynamic Routing Algorithm, in which 3 reference parameters for cell delay are defined and reflect on the messages of Resource Management (RM) cells. To evaluate our mechanism, we execute simulations on a simple ATM network model where multiple connections and background traffic with different RTTs share the bandwidth of a bottleneck link. The simulation results, based on good throughput and efficiency, clearly show that the mechanism improves the fairness among multiple connections, although the considered implementation of ABR transfer capacity is simple.
  A. Subramani and A. Krishnan
  The ATM forum has proposed the Private Network-Network Interface (PNNI) specification to facilitate routing in ATM networks, pre-path selection (or) routing algorithms that guarantee a user’s multiple Quality of Service (QoS) requirements remain an open issue. In this study, we consider Multi-Source Virtual dynamic QoS Routing in an integrated-services environment where some of the offered traffic streams are dynamic. While there has been work on routing performance in the presence of purely stationary traffic, the presence of dynamic traffic has received very little attention. We consider here two routing schemes: Multi-Source Virutal Dynamic Routing (MSVDR), Hierarchical Based Least Loaded Routing with Periodic update (HBLLR). Based on simulation, we have found that while MSVDR performs and adapts better than Backward Hierarchal Routing Algorithm (BHRA) in the case of no trunk reservation, it is other way around when there is moderately high trunk reservation (even for less frequent routing updates). Further, we found that dynamics of a traffic class can result in dynamic flow blocking behavior even on stationary traffic, especially at a low or no trunk reservation level. This proposed Algorithm (MSVDR) reduce the Reservation Time, Minimize the Queue length, Fast route recovery, Maximum link utilization and Good throughput compare to the other Routing Algorithms.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility