2 citations found. Retrieving documents...
C. Zlaettinoglu and Udaya Shankar. "The Viewserver Hiearchy for Interdomain Routing: Protocols and Evaluation" IEEE Journal on Selected Areas in Communications, Vol.13, No.8, Oct. 1995

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Scalable Routing Strategies for Multi-Hop Ad-hoc.. - Iwata, Chiang, Pei.. (1998)   (1 citation)  (Correct)

....Their scheme was designed to minimize storage of routing tables, and to propagate and update them very effectively without introducing significant performance degradation. Drawing from the work in [2] 3] C. Alaettinoglu proposed a routing scheme based on the distributed Bellman Ford algorithm [6], and Ramamoorthy et al. 4] 5] proposed a scheme based on link state algorithm. The most recent effort in hierarchical clustering and routing is Private Network Network Interface (PNNI) routing [7] a hierarchical link state routing protocol for ATM networks which has been standardized by the ....

....schemes. As discussed in previous sections, flat routing schemes [12] 13] 14] cannot scale to a large network. On demand routing [15] 18] 16] 17] 19] and zone routing [20] 21] do scale to a large network, but have latency and QoS support limitations. Hierarchical routing solutions [2] 3] [6] [4] 5] 7] for wired networks can be a good starting point, but must be extended to support dynamic mobility management. The wireless hierarchical routing proposal in [22] 23] is a first attempt in this direction. However, the protocol is overhead prone and quite complex to maintain. Our ....

C. Zlaettinoglu and Udaya Shankar. "The Viewserver Hiearchy for Interdomain Routing: Protocols and Evaluation" IEEE Journal on Selected Areas in Communications, Vol.13, No.8, Oct. 1995


Wireless Hierarchical Routing Protocol with Group Mobility .. - Pei, Gerla, Hong, Chiang (1999)   (16 citations)  (Correct)

....algorithm etc. These flat routing scheme can easily overload the channel capacity by sending nothing but large size periodical routing table updating messages among the nodes when the size of network becomes large. Hierarchical techniques are commonly used in wired network for scalability [11, 13, 21, 24, 25]. For wireless networks, a hierarchical clustering and routing scheme based upon physical location management was recently proposed in [6, 12] This scheme, however, creates implementation problems which are potentially complex to resolve. First, it does allocate Cluster IDs dynamically. This ....

C. Zlaettinoglu and U. Shankar. The viewserver hiearchy for interdomain routing: Protocols and evaluation. IEEE Journal on Selected Areas in Communications, 13(8), October 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC