W. Dobosiewicz and P. Gburzynski, "A bounded-hop-count deflection scheme for Manhattan-street networks," in Proc. IEEE INFOCOM, 1996, pp. 172--179. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Distributed Routing Algorithm for Datagram Traffic in.. - Ekici, Akyildiz, Bender (2001) (3 citations) (Correct)
....following lemmas and theorems where we used the assumption that the satellites are in the initial alignment (Defi nition 3) At this point, we point out the grid structure of the satellites which cover the entire Earth. This grid structure could be regarded as a type of Manhattan Street Network [12], which has been researched extensively in the last decade. However, there is a major difference here. The distances between the satellites in different latitudes are changing, e.g. they become shorter in the latitudes closer to the poles and longer in the latitudes closer to equator [ 2) ....
W. Dobosiewicz and P. Gburzynski, "A bounded-hop-count deflection scheme for Manhattan-street networks," in Proc. IEEE INFOCOM, 1996, pp. 172--179.
BFR: A Routing Protocol for Real-time Transport in Grid Networks - Song, Bahk (2000) (Correct)
....packets to an alternative path instead of buffering it. It cannot satisfy the packet delay and sequencing requirements due to the uncertainty inherent in deflection. Moreover, it shows lower throughput than SFR. Vertical routing (VR) has been proposed to satisfy the packet delay requirement [4]. VR gives up using the shortest paths. In the VR scheme, an accepted packet proceeds along the row first. Then it turns to the column direction if it meets the destination column where the destination resides, and it proceeds along the column. A row packet has higher priority than a column packet ....
W. Dobosiewicz and P. Gburzynski, A bounded-hop-count deflection scheme for Manhattan-street networks, in Proc. IEEE Infocom`96, pp. 172-179, 1996.
Datagram Routing Algorithm for LEO Satellite Networks - Ekici, Akyildiz, Bender (2000) (3 citations) (Correct)
....the following lemmas and theorems where we used the assumption that the satellites are in the initial alignment (Definition 2) At this point we point out the grid structure of the satellites which cover the entire Earth. This grid structure could be regarded as a type of Manhattan Street Network [7] which have been researched extensively in the last decade. However, there is a major difference here. The distances between the satellites in different latitudes are changing, e.g. they become shorter in the latitudes closer to Poles and longer in the latitudes closer to Equator, 2) Keeping ....
W. Dobosiewicz and P. Gburzynski, "A Bounded-Hop-Count Deflection Scheme for Manhattan-Street Networks," Proc. of IEEE INFOCOM 96, 1996.
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