WO1993006675A1 - Reseaux a commutation rapide de paquets/circuits multidestinataires sans blocage - Google Patents

Reseaux a commutation rapide de paquets/circuits multidestinataires sans blocage Download PDF

Info

Publication number
WO1993006675A1
WO1993006675A1 PCT/US1992/007978 US9207978W WO9306675A1 WO 1993006675 A1 WO1993006675 A1 WO 1993006675A1 US 9207978 W US9207978 W US 9207978W WO 9306675 A1 WO9306675 A1 WO 9306675A1
Authority
WO
WIPO (PCT)
Prior art keywords
network
routing
input
destined
multicast
Prior art date
Application number
PCT/US1992/007978
Other languages
English (en)
Inventor
Dong-Jye Shyy
Original Assignee
Communications Satellite Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Communications Satellite Corporation filed Critical Communications Satellite Corporation
Publication of WO1993006675A1 publication Critical patent/WO1993006675A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/60—Router architectures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing

Definitions

  • the present invention relates to switching networks, and more particularly to nonblocking multicast fast packet/circuit switching networks for routing information from one end of the switching network to the other end.
  • a new class of nonblocking multicast fast packet/circuit switching networks has been invented.
  • the topology of these networks is based on the banyan multistage interconnection network (See L.R. Goke and G.J. Lipovski, “Banyan Networks for Partitioning Multiprocessing Systems,” First Annual Computer Architecture, pp. 21-28, 1973) or its equivalent (See C.L. Wu and T.Y. Feng, “On a Class of Multistage Interconnection Networks," IEEE Trans, on Computers, vol 29, no. 8, pp. 694-702, 1980).
  • These switching networks route packets with proper multicast routing tags to their destinations in a distributive and a nonblocking fashion.
  • the point- to-multipoint services such as video distribution, video conference, file transfer, distributed data processing, and network management generate a lot of interest in designing a multicast fast packet switch.
  • the first is to use a shared-medium switch.
  • the second approach is to use the store-and-forward nature of the packet switch, i.e., send the multicast packet one-by-one from the input port.
  • the third approach is to use a copy network and a routing network.
  • the fourth approach is to use a multicast module at the output port and this multicast module is responsible for sending the multicast packet to the destinations.
  • the fifth approach is to use a multicast banyan network or a multicast tree network.
  • the multicast operation can be achieved without packet duplication.
  • the general concerns of the shared-medium approach are the high bus speed and the complex media access protocol used to solve the bus contention.
  • the bus speed requirement can be reduced by using a wider parallel bus. Nevertheless, it is not appropriate and cost effective to use the shared-medium switch, if the switch capacity is above 1 Gbits/s.
  • the multicast operation is achieved by sending the multicast packet one by one from the input port.
  • the advantage of this approach is that a point-to-point switch can be used as a multicast switch; hence, the hardware cost for building a multicast switch is minimal.
  • the disadvantages of this approach are the long delay due to the serial transfer of the multicast packet and serious congestion at the input port if the number of duplication is large. Copy Network Plus Routing Network
  • the first operation of the copy network is to duplicate the exact number of copies for each multicast packet. This requires the incoming packets to carry a copy index in the header. For the copy network to be nonblocking, the copy index of each multicast packet has to be translated into an address interval; this operation is performed on the incoming packets sequentially from the top to the bottom. This procedure can be implemented using a running adder network and an address interval encoder. After the multicast packets with proper address intervals have been generated, a concentration network is necessary to concentrate these packets to satisfy the nonblocking condition of the copy network. Since these packets' address intervals are monotonically increasing and they are concentrated, a banyan network can duplicate these packets without any blocking.
  • the first is the delay incurred for every packet (including unicast and multicast packets) passing through the copy network and the routing network, and the hardware complexity incurred by the copy network. Since the duplicated packets might use different input ports of the point-to-point switching network for routing at different times, these packets might be transmitted out- of-sequence due to different levels of input congestion at different times. It is noted that if the routing network is nonblocking, there is no out-of-sequence problem.
  • Multicast Module at the Output Port there are multiple modules at the output ports. All the multicast packets are relayed to these multicast modules first. Then the multicast modules send the multicast packet to the destined output ports through a proper multicast interconnection network. The number of multicast modules required depends on the amount of multicast traffic.
  • the multicast knockout switch uses a similar approach (See K.Y. Eng, M.G. Hiuchyj and Y.S. Yeh, "Multicast and Broadcast Services in a Knockout Packet Switch," IEEE INFOCOM, pp. 29-34, 1988.) .
  • the disadvantage of this approach is that some of the output ports are allocated for the multicast modules. The result is that the switch may become a nonsymmetric switch if a symmetric switch is chosen as the point-to- point switching fabric.
  • the other disadvantage is that there are two packet transfer protocols; one for the point-to-point network and the other for the multicast network. Multicast Banyan or Tree Networks
  • the Multicast banyan network (see Figure 1) or tree network (see Figure 2) can duplicate and route the multicast packet simultaneously, which is very attractive.
  • the number of stages of 2 X 2 switching elements is Log 2 N and the stages are numbered from 1 to Log 2 N.
  • the number N of outputs is equal to 8 and therefore the number of stages is equal to 3.
  • the format of the routing tag 101, which, along with date portion 102 makes up a packet 103, used for the multicast banyan network is different from the routing tag used for the point-to-point banyan network.
  • the multicast routing tag 101 is formed using a series of l's and 0's bits, and each bit is associated with one output port.
  • the size of the routing tag of a multicast packet is N.
  • the contents of the control bits at each register is determined based on the topology of the banyan network.
  • the operation of each switching element is to AND the routing tag 101 of the packet 103 and the control bits at each register (104 and 105) . If the result of the AND operation is 1, a copy of the packet 103 is sent to the output. If the packet 103 is sent to both outputs, duplication of the packet has occurred.
  • the multicast banyan network is cost- effective, it has the disadvantages of large registers in the switching element and serious internal blocking problem.
  • a tree network as shown in Figure 2 consists of two portions: a splitter network and a combiner network.
  • the tree network is internal nonblocking, it has the disadvantages of large registers in the switching element and high cost if the size of the switch is large.
  • a nonblocking multicast network can be constructed; hence, a family of nonblocking multicast switching networks based on the multicast banyan network is proposed.
  • the new switching networks do not need long registers in the switching elements and they have no internal blocking problem.
  • the new switching networks do not need long registers in the switching elements and the total hardware cost is lower.
  • the invention does not separate the multicast operation into two separate phases , i.e., copy network and routing network.
  • the invention routes and duplicates the packet at the same time in a distributive and a nonblocking fashion.
  • the proposed switch uses the input buffering approach and the locations of the multicast packets are fixed with respect to the input ports; hence, it does not suffer the disadvantage of the Lee approach, i.e., a frequent updating of the address translation tables at the input ports.
  • a method is introduced below to create a nonblocking multicast banyan network. It is assumed that the input buffering approach is employed for the switching operation, i.e., the incoming packets are stored in the input buffers. It is also assumed that a scheduling algorithm, such as the ring reservation scheme used (See B. Bingham and H. Bussey, "Reservation-Based Contention Resolution Mechanism for Batcher-Banyan Packet Switches," Electronic Letters, vol. 24, no. 13, pp. 772-773, June 1988.), is applied to the incoming packets at each slot time to reserve the output ports.
  • ring reservation scheme See B. Bingham and H. Bussey, "Reservation-Based Contention Resolution Mechanism for Batcher-Banyan Packet Switches," Electronic Letters, vol. 24, no. 13, pp. 772-773, June 1988.
  • the self-routing nonblocking multicast switching network comprises: input means for receiving a plurality of input messages, each of said messages potentially destined for a plurality of outputs of said switching network, each of said input messages containing a routing tag having a plurality of sections each section being composed of a number of bits, said number of bits being different for each section within a routing tag, each of said sections corresponds to a level of a tree hierarchy related to the outputs of said switching network; sorting means for sorting said input messages received by said input means by examining only one of said plurality of sections of each routing tag; and routing means for routing the sorted messages output from said sorting means through to the outputs of said switching network based on the bits contained in said routing tags.
  • Figure 1 shows an 8 X 8 multicast banyan network according to a well-known design
  • Figure 2 shows a 4 X 4 tree network according to a well-known design
  • Figure 3a shows a tree hierarchy of the routing field according to the present invention
  • Figure 3b shows a general example of the routing tag format of the present invention
  • Figure 3c shows an example of the routing tag format
  • Figure 3d shows a second example of the routing tag format
  • Figure 4 shows an 8 X 8 self routing nonblocking multicast banyan network
  • Figure 5 shows an example of an 8 X 8 self rooting nonblocking multicast banyan network
  • Figure 6 shows a 16 X 16 nonblocking multicast switching network
  • Figure 7 shows another 16 X 16 nonblocking multicast switching network
  • Figure 8 shows still another 16 X 16 nonblocking multicast banyan network
  • the multicast routing field formats use the even and odd group concept associated with the levels of the switching network, and they are arranged using a tree hierarchy structure (see Figure 3a) .
  • the definition of a level in the proposed switching network will be explained later.
  • the even group on the left-hand side of Figure 3a
  • the odd group on the right-hand side of Figure 3a
  • the addresses at level 1 consist of 2 bits (301 in Fig. 3b) which are used for routing at level 1 of the switching network.
  • 2-bit format There are four possible combinations of the 2-bit format:
  • the addresses at level 2 consist of 4 bits 302 which are used for routing at level 2.
  • the first 2-bit field is associated with the even group at level 1 and the second 2-bit field is associated with the odd group at level 1.
  • the subeven group within the even group at level 1 consists of the addresses whose modulo 4 results are 0 and the subodd group within the even group at level 1 consists of the addresses whose modulo 4 results are 2.
  • the subeven group within the odd group at level 1 consists of the addresses whose modulo 4 results are 1 and the subodd group within the odd group at level 1 consists of the addresses whose modulo 4 results are 3.
  • the addresses at level m consist of 2 m bits, where 1 ⁇ ⁇ . L°9 2 N.
  • the size of the multicast ' routing tag is 2N-2.
  • one packet which is destined to only one group and the other packet is an empty packet.
  • a sorting network is used to rearrange the pattern of the arriving packets.
  • the sorting network sorts the packets using the 2-bit field 301 at level 1. Let the sorting network sort the packets into non-ascending order. After the sorting procedure, the sequence of the packets appearing at the outputs of the sorting network is packets destined for: both groups, even group, empty and odd group.
  • level 1 consists of one sorting network with size N and stage 1 of the banyan network.
  • the operation of each switching element at stage 1 of the banyan network is described as follows.
  • the switching element referenced generally as 403 routes the packet to the upper link 404 if the 2-bit tag 301 is destined for the even group; it routes the packet to the lower link 405 if the 2-bit tag is destined for the odd group; it routes and copies the packet to both links if the 2-bit tag is destined for two groups.
  • the empty packet is deleted if the other packet at the other input is destined to both groups; otherwise, the empty packet is sent to the next level.
  • the 2-bit routing bits 301 at level 1 are used for sorting for the N-by-N sorting network and routing for stage 1 of the banyan network.
  • the switching element's logic is very simple, it only needs to check a 2-bit routing field.
  • the packets After level 1, the packets have been divided into two groups according to the destination routing tags; the packets destined to the even group are routed to the upper subnetwork 501 and the packets destined to the add group are located to the lower subnetwork 502 (see Figure 5) .
  • the level 2 portion 302 of the routing tag is used for routing at level 2 of the network which consists of two sorting networks with size N/2 in parallel and stage 2 of the banyan network (see Figure 4) .
  • the upper subnetwork 501 in Figure 5 (or the lower subnetwork 502) consists of one sorting network 503 with size N/2 and the upper half (or the lower half) of stage 2 of the banyan network.
  • the upper subnetwork 501 with size N/2 uses the first 2 bits 303 at level 2 of the routing tag for routing, and the lower subnetwork 502 with size N12 usesthe second 2 bits 304 at level 2 of the routing tag for routing.
  • the same routing procedure as in level 1 is applied at each subnetwork.
  • the last level of the network only consists of stage Log 2 N of the banyan network.
  • the output ports of the switch check the routing tag of the arriving packet to determine whether it is an empty packet or not. If it is an empty packet, it will be discarded.
  • the logic to perform this operation is very simple, and only needs to check a 2-bit field.
  • the proposed switching network has been named (N, nl, n2, p) network, where N is the size of the network, nl is the number of stages of sorting networks, n2 is the number of stages of 2 X 2 switching elements, and p is the number of copies stacked together, where each copy is a (N, nl, n2, 1) network.
  • the proposed network can be described as the (N, Log 2 N-l, Log 2 N, 1) network.
  • the proposed switching architecture can be used for both packet switching and circuit switching.
  • circuit switching since there is no output conflict and the switching fabric is multicast nonblocking, the result is a multicast nonblocking circuit switch.
  • packet switching since the output conflict is an unavoidable situation, a scheduling algorithm is necessary to resolve the output contention.
  • An example of the operation of an 8 X 8 nonblocking multicast switching network or an (8,2,3,1) network is provided in Figure 5.
  • the banyan network has been shown to be topologically equivalent to many other multistage interconnection networks such as baseline, omega, flip, and shuffle networks [2] (See Wu Feng). Therefore, the proposed nonblocking multicast switching network can be constructed using any of the banyan network's equivalent topology.
  • the total number of stages of 2 X 2 switching elements is Log 2 N and the total number of 2 X 2 switching elements is N/2 Log 2 N.
  • the total number of sorting elements is
  • n Log 2 N. It is found that the tree network topology can be combined with the nonblocking multicast (N, nl, n2, 1) network to reduce the number of stages of the switching network.
  • the principle is that one stage of the tree network is equivalent to one level of the multicast switching network; however, the number of copy of a switching network is doubled.
  • the theory of the principle is explained as follows: At level 1 of the network, a 1X2 demultiplexer is employed for each input line and these 1 X 2 demultiplexers can be substituted for the N X N sorting network and stage 1 of the banyan network.
  • the outputs of the demultiplexer are connected to the inputs of two switching networks stacked in parallel (see Figure 6) .
  • the operation of the 1 X 2 demultiplexer is as follows. For even number inputs, the multicast packet is separated into two packets: the packet with the even group goes to the first subnetwork of copy 1 and the packet with the odd group goes to the second subnetwork of copy 2.
  • the multicast packet is separated into two packets: the packet with the even group goes to the first subnetwork of copy 2 and the packet with the odd group goes to the second subnetwork of copy 1. If there is no packet with the even group (or odd group) , an empty packet is generated at the input. If there is no packet to send at a slot time, two empty packets are generated at the input.
  • the principle is to make the number of packets at each copy of the network always equal to the size of the network.
  • the packets are separated into two groups according to their destinations after stage 1. Each group is handled by two subnetworks, one in each copy. The operation at levels 2, 3 and 4 of each copy has been described above. After level 4, a combiner stage of 2 X 1 multiplexers is necessary to multiplex two outputs from two copies into one output. The resulting network becomes a (N, Log 2 N-2, Log 2 N-l, 2) network. The operation of the 2 X 1 multiplexer is to discard the empty packet and send the data packet to the output port. The logic to perform this operation is very simple, which only needs to check a 2-bit field.
  • the sorting networks at levels 1 and 2 are not required (see Figure 7).
  • the packets are separated into four disjoint groups according to their destination addresses. Each group is handled by four subnetworks, one in each copy.
  • two stages of 2 X 1 multiplexers is necessary to multiplex four outputs from four copies into one output.
  • the network becomes a (N, Log 2 N-3, Log 2 N-2, 4) network.
  • Theorem 1 The multistage sorting-banyan network is point-to-multipoint nonblocking.
  • the sorting network sorts the packets according to the following methods. If the packet is destined to two groups simultaneously, this packet is sorted to the top of the output. After this, the packets destined to G 1 are put under the packets with two groups. Then the empty packets are put under the packets destined to G r Those packets destined to G 2 are put at the end of the outputs. Using a shuffle interconnection from the sorting network to the inputs of stage 1 of the banyan network, the packets are arranged in such a way that the packets destined to the same groups do not appear at the same switching element.
  • N 0 the number of packets destined to G 1 by N 1f and the number of packets destined to G 2 be N 2 . Focusing on the packets destined to both groups and the packets destined to G r The sum of N 0 and N, is less than or equal to N/2. If the sum is less than N/2, the empty packets are used to pad the remaining positions. The number of empty packets required is N/2 - N 0 - N,. According to the sorting procedure and the shuffle interconnection, these N/2 packets can be put at the first input of the switching elements at stage 1 sequentially from the top to the bottom.
  • N/2 - N 2 The number of empty packets left is N/2 - N 2 . If N/2 - N 2 is always greater than or equal to N 0 , then the packet destined to G 2 cannot appear at the same switching element with the packet destined to both G 1 and G 2 since empty packets will occupy the second input of the switching elements where the first input has a packet destined to both groups. Since the sum of N 0 and N 2 is always less than or equal to N/2, N/2 - N 2 is always greater than or equal to N 0 . It has been shown that with this configuration, there is no blocking at stage 1.
  • the packets After stage 1, the packets have been divided into two groups according to their destinations: even and odd. Focusing on the even group G, at the upper subnetwork, G, consists of two subgroups G,, and G 12 , where G n has the addresses whose modulo 4 results are zero and G 12 has the addresses whose modulo 4 results are two. Applying the same operation on G, at the upper subnetwork as before, no blocking will occur at stage 2 of the banyan network. It is clear that this operation can be applied to all the stages recursively and the result is the network is point-to-multipoint nonblocking.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Ce réseau commuté multidestinataire à autoacheminement et sans blocage (fig. 4, fig. 5, fig. 6, fig. 7, ou fig. 8) achemine des messages d'entrée à des adresses de destination en examinant une étiquette d'acheminement (fig. 3b, fig. 3c et fig. 3d) combinée dans chaque message. L'étiquette d'acheminement (fig. 3b, fig. 3c et fig. 3d) comporte un ensemble de sections (301, 302, 303, 304) dont chacune correspond à un niveau d'une hiérarchie arborescente (fig. 3a) en relation avec les sorties du réseau commuté. Le réseau trie les messages en examinant uniquement une section de chaque étiquette d'acheminement et achemine les messages triés vers les adresses de destination en fonction des bits contenus dans les étiquettes d'acheminement.
PCT/US1992/007978 1991-09-26 1992-09-25 Reseaux a commutation rapide de paquets/circuits multidestinataires sans blocage WO1993006675A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US765,776 1985-08-15
US76577691A 1991-09-26 1991-09-26

Publications (1)

Publication Number Publication Date
WO1993006675A1 true WO1993006675A1 (fr) 1993-04-01

Family

ID=25074452

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1992/007978 WO1993006675A1 (fr) 1991-09-26 1992-09-25 Reseaux a commutation rapide de paquets/circuits multidestinataires sans blocage

Country Status (1)

Country Link
WO (1) WO1993006675A1 (fr)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0687124A2 (fr) * 1994-06-06 1995-12-13 AT&T Corp. Acheminement à destinations multiples dans un réseau à plusieurs étages et acheminement autonome
EP0700229A3 (fr) * 1994-08-22 1999-02-03 Fujitsu Limited Système de communication sans connection, méthode de test et système de gestion intra-station
WO1999031834A2 (fr) * 1997-12-18 1999-06-24 Net Insight Ab Procede de commutation de donnees commutees par circuits, entre des trains binaires, au moyen d'un identification de voie
WO1999031849A2 (fr) * 1997-12-18 1999-06-24 Net Insight Ab Procede et appareil de commutation de donnees
GB2359958A (en) * 1999-09-15 2001-09-05 Actv Inc Providing an indication of hierarchical routing information in a packet
WO2002043433A1 (fr) * 2000-11-23 2002-05-30 Net Insight Ab Dispositif de commutation
US7930716B2 (en) 2002-12-31 2011-04-19 Actv Inc. Techniques for reinsertion of local market advertising in digital video from a bypass source
US9148684B2 (en) 1999-09-29 2015-09-29 Opentv, Inc. Enhanced video programming system and method utilizing user-profile information

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4701906A (en) * 1985-06-27 1987-10-20 American Telephone And Telegraph Company, At&T Bell Laboratories Packet switching network with multiple packet destinations
US4910730A (en) * 1988-03-14 1990-03-20 Bell Communications Research, Inc. Batcher-banyan network
US4991168A (en) * 1989-05-08 1991-02-05 At&T Bell Laboratories Concurrent multi-stage network control arrangement
US5018129A (en) * 1989-03-09 1991-05-21 At&T Bell Laboratories Dual rail dilated switching networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4701906A (en) * 1985-06-27 1987-10-20 American Telephone And Telegraph Company, At&T Bell Laboratories Packet switching network with multiple packet destinations
US4910730A (en) * 1988-03-14 1990-03-20 Bell Communications Research, Inc. Batcher-banyan network
US5018129A (en) * 1989-03-09 1991-05-21 At&T Bell Laboratories Dual rail dilated switching networks
US4991168A (en) * 1989-05-08 1991-02-05 At&T Bell Laboratories Concurrent multi-stage network control arrangement

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0687124A2 (fr) * 1994-06-06 1995-12-13 AT&T Corp. Acheminement à destinations multiples dans un réseau à plusieurs étages et acheminement autonome
EP0687124A3 (fr) * 1994-06-06 1998-02-11 AT&T Corp. Acheminement à destinations multiples dans un réseau à plusieurs étages et acheminement autonome
EP0700229A3 (fr) * 1994-08-22 1999-02-03 Fujitsu Limited Système de communication sans connection, méthode de test et système de gestion intra-station
US6513069B1 (en) 1996-03-08 2003-01-28 Actv, Inc. Enhanced video programming system and method for providing a distributed community network
WO1999031834A2 (fr) * 1997-12-18 1999-06-24 Net Insight Ab Procede de commutation de donnees commutees par circuits, entre des trains binaires, au moyen d'un identification de voie
WO1999031849A3 (fr) * 1997-12-18 1999-08-26 Net Insight Ab Procede et appareil de commutation de donnees
WO1999031834A3 (fr) * 1997-12-18 1999-08-26 Net Insight Ab Procede de commutation de donnees commutees par circuits, entre des trains binaires, au moyen d'un identification de voie
WO1999031849A2 (fr) * 1997-12-18 1999-06-24 Net Insight Ab Procede et appareil de commutation de donnees
GB2359958A (en) * 1999-09-15 2001-09-05 Actv Inc Providing an indication of hierarchical routing information in a packet
GB2359958B (en) * 1999-09-15 2004-03-03 Actv Inc Enhanced video programming system and method providing a distributed community network
AU773809B2 (en) * 1999-09-15 2004-06-10 Opentv, Inc. Enhanced video programming system and method providing a distributed community network
CN100393051C (zh) * 1999-09-15 2008-06-04 Actv公司 用于在网络中发送应用层信息分组的方法和装置
US9148684B2 (en) 1999-09-29 2015-09-29 Opentv, Inc. Enhanced video programming system and method utilizing user-profile information
US10205998B2 (en) 1999-09-29 2019-02-12 Opentv, Inc. Enhanced video programming system and method utilizing user-profile information
WO2002043433A1 (fr) * 2000-11-23 2002-05-30 Net Insight Ab Dispositif de commutation
US7356025B2 (en) 2000-11-23 2008-04-08 Net Insight Ab Switching apparatus for switching data between bitstreams
US7930716B2 (en) 2002-12-31 2011-04-19 Actv Inc. Techniques for reinsertion of local market advertising in digital video from a bypass source

Similar Documents

Publication Publication Date Title
Turner Design of a broadcast packet switching network
US5274642A (en) Output buffered packet switch with a flexible buffer management scheme
EP0698323B1 (fr) Commutateur de circuit virtuel multidestinataires utilisant le recyclage de cellules
KR100262682B1 (ko) 멀티캐스트 atm교환기 및 그멀티캐스트 경합조정방법
KR970000792B1 (ko) 패킷 스위치 및 그 구조
US5636210A (en) Asynchronous transfer mode packet switch
US4813038A (en) Non-blocking copy network for multicast packet switching
Scheideler Universal routing strategies for interconnection networks
JPH0637797A (ja) パケット交換網の予約リング機構
JPH0637796A (ja) パケット交換機の改良型マルチキャスト機構
JP3745443B2 (ja) 回線群による同期スイッチングを用いるａｔｍスイッチ
JPH0637799A (ja) トランクグループ入力／出力モードを備えた交換機
JPH0637800A (ja) 非ブロッキング自己経路指定式交換網を有する交換機
Chao et al. Design and implementation of Abacus switch: A scalable multicast ATM switch
WO1993006675A1 (fr) Reseaux a commutation rapide de paquets/circuits multidestinataires sans blocage
Mir A survey of data multicast techniques, architectures, and algorithms
Chen A survey of multistage interconnection networks in fast packet switches
Rahnema The fast packet ring switch: A high-performance efficient architecture with multicast capability
KR20000055431A (ko) 에이티엠 스위칭 시스템에서 멀티캐스팅 망
JP2004260365A (ja) 高速高ポート密度なネットワーク中継装置
WO1993006676A1 (fr) Reseaux a commutation rapide de paquets/circuits point a point sans blocage
Wong et al. Pipeline banyan-a parallel fast packet switch architecture
Giacopelli et al. Scalability study of self-routing packet switch fabrics for very large scale broadband ISDN central offices
Chan et al. Clos-knockout: A large-scale modular multicast ATM switch
Kwok Tandem banyan switching fabric: A new high-performance fast packet switch and its performance evaluations

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CA JP

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LU MC NL SE

COP Corrected version of pamphlet

Free format text: PAGES 1/8-8/8,DRAWINGS,REPLACED BY NEW PAGES 1/8-8/8;DUE TO LATE TRANSMITTAL BY THE RECEIVING OFFICE

NENP Non-entry into the national phase

Ref country code: CA

122 Ep: pct application non-entry in european phase