| I. Cidon, I. Gopal and A. Segall " A. Fast Connection Establishment in High Speed Networks", ACM SIGCOMM, September 1990, pp. 287--296 |
.... For example, CCITT has recommended that the ATM networks be connection oriented [17] 17 The very limited processing time for each packet leads to a need for developing a dedicated hardware switch that has the ability to route packets very quickly, without consuming the processing capacity [26]. According to [26, 25] this can be achieved by building a network node in two parts: the switching subsystem (SS) and the Network Control Unit (NCU) The SS is a fast hardware switch with relatively limited functionality. The NCU is a slower but more sophisticated processor. Packets that are ....
.... CCITT has recommended that the ATM networks be connection oriented [17] 17 The very limited processing time for each packet leads to a need for developing a dedicated hardware switch that has the ability to route packets very quickly, without consuming the processing capacity [26] According to [26, 25], this can be achieved by building a network node in two parts: the switching subsystem (SS) and the Network Control Unit (NCU) The SS is a fast hardware switch with relatively limited functionality. The NCU is a slower but more sophisticated processor. Packets that are only relayed through the ....
[Article contains additional citation context not shown here]
Cidon, I., Gopal, I., and Segall, A. Fast Connection Establishment in High Speed Networks. ACM SIGCOMM, pages 287--296, September 1990.
....processing capacity that we seek to characterize in this paper. We investigate six routing algorithms in this study : three well known algorithms in the circuit switching literature, two controlled flooding versions of these algorithms and one fast connection establishment protocol proposed in [5]. Analytical models are developed to study these six algorithms. The analysis is based on the link decomposition method [6] a commonlyused technique in evaluating network performance in the circuit switching literature. The analytical models are validated by simulations. The results of our study ....
....results are presented in section 5. Finally, section 6 summarizes this paper. 2 2 Network Models We consider a connection oriented high speed network consisting of N nodes, N 2, with each node having some number of incoming and outgoing links. We adopt the network node structure described in [16, 5], in which a node consists of two components: the switching subsystem (SS) and the network control unit (NCU) The SS is a fast hardware switch with relatively limited functionality. The NCU is a slower, but more sophisticated, processor. Packets (or cells) that need only be relayed through the ....
[Article contains additional citation context not shown here]
I. Cidon, I. Gopal, and A. Segall, "Fast Connection Establishment in High Speed Networks, " ACM SIGCOMM, pp. 287--296, September 1990.
....sources such as computers, it is important to have an efficient connection establishment scheme in order to provide low access delay for small bursts. In networks based on circuit switched or virtual circuit switched techniques (e.g. ATM based networks) the management of connections is important [6], 9] There is usually a tradeoff between using the resources in the network in an efficient manner and fulfilling Quality of Service (QoS) demands set by a user. In a virtual circuit switched network, the connection establishes a route from node to node, thus providing the switches with routing ....
I. Cidon, I. Gopal and A. Segall, "Fast Connection Establishment in High Speed Networks ", In Proc. ACM SIGCOMM `90, Philadelphia, Sep. 1990.
....to model resources held by blocked calls. Finally, section 7 summarizes this chapter. 2 Network Models We consider a connection oriented high speed network consisting of N nodes with each node having some number of incoming and outgoing links. We adopt the network node structure described in [15, 16], in which a node consists of two components: the switching subsystem (SS) and the network control unit (NCU) The SS is a fast hardware switch with relatively limited functionality. The NCU is a slower, but more sophisticated, processor. Packets (or cells) that need only be relayed through the ....
I. Cidon, I. Gopal, and A. Segall, "Fast Connection Establishment in High Speed Networks, " ACM SIGCOMM, pp. 287--296, September 1990.
....on a topology database that is maintained in every node [HS89] The route is selected according to some optimization rule, such as, shortest path, minimal delay, etc. After the route is selected, the source tries to allocate resources (such as bandwidth, buffers, etc. along the selected route [BT92, CGS90, Hui88]. In case of a failure, the source can try another route (that might be precomputed) usually one that is the most disjoint from the first one, or the source can stall and try again at a later time. Much work was devoted to solve the distributed shortest path problem (e.g. BG92, Ch. 5] which is ....
Israel Cidon, Inder Gopal, and Adrian Segall. Fast connection establishment in high speed networks. In ACM SIGCOM'90, pages 287 -- 296, 1990.
....studies have been done as yet. 7 Related Work In the course of exploring network algorithms that deliver quality of service guarantees, there have been several proposals and prototype implementations of network resource reservation algorithms over the last few years (see, for example, 6] [2]) However, almost all of these prototypes deal exclusively with unicast reservations. The Stream Protocol, ST [7] was a pioneering work in multicast reservation protocol design. ST was designed specifically to support voice conferencing and was capable of making both unicast and multicast ....
Cidon, I., Segall, A., Fast Connection Establishment in High Speed Networks, in the Proceedings of ACM SIGCOMM '90, September, 1990.
No context found.
I. Cidon, I. Gopal and A. Segall " A. Fast Connection Establishment in High Speed Networks", ACM SIGCOMM, September 1990, pp. 287--296
....bursts. Here, the overhead of reservation is not as bothersome so traditional reservation algorithms can be used. Note, however, that this approach is valid only if there is enough storage at the source to hold the burst data until positive acknowledgment is received for the reservation signaling [2, 6]. Thus, such an approach would be useful for bursty data applications such as FTP in which the data can be easily kept in the source. This approach would not be useful for bursty real time application, e.g. variable bit rate video, which (for storage reasons) cannot tolerate long waiting times ....
Israel Cidon, Inder Gopal, and Adrian Segall. Fast connection establishment in high speed networks. In ACM SIGCOM'90, pages 287 -- 296, 1990.
....Here, the overhead of reservation is not as bothersome so traditional reservation algorithms can be used. Note, however, that this approach is valid only if there is enough storage at the source to hold the burst data until positive acknowledgment is received for the reservation signaling [BT92, CGS90] Thus, such an approach would be useful for bursty data applications such as FTP in which the data can be easily kept in the source. This approach would not be useful for bursty real time application, e.g. variable bit rate video, which (for storage reasons) cannot tolerate long waiting times ....
Israel Cidon, Inder Gopal, and Adrian Segall. Fast connection establishment in high speed networks. In ACM SIGCOM'90, pages 287 -- 296, 1990.
No context found.
II. Cidon, I. Gopal and A. Segall, "Fast Connection Establishment in High Speed Networks", In Proc. ACM SIGCOMM `90, Philadelphia, Sep. 1990.
No context found.
Israel Cidon, Inder Gopal, and Adrian Segall. Fast connection establishment in high speed networks. IEEE Trans. on Networking, pages 469--481, 8 1993.
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