EP1563653A2 - Noeud de communications - Google Patents

Noeud de communications

Info

Publication number
EP1563653A2
EP1563653A2 EP02762619A EP02762619A EP1563653A2 EP 1563653 A2 EP1563653 A2 EP 1563653A2 EP 02762619 A EP02762619 A EP 02762619A EP 02762619 A EP02762619 A EP 02762619A EP 1563653 A2 EP1563653 A2 EP 1563653A2
Authority
EP
European Patent Office
Prior art keywords
node
signal
communications
packet
communications node
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP02762619A
Other languages
German (de)
English (en)
Inventor
Neil Freebairn
Roger William Stuart Lewis
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NETWORK INNOVATIONS LIMITED
Original Assignee
NewNew Networks Innovations Ltd
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 NewNew Networks Innovations Ltd filed Critical NewNew Networks Innovations Ltd
Publication of EP1563653A2 publication Critical patent/EP1563653A2/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/60—Software-defined switches
    • C—CHEMISTRY; METALLURGY
    • C07—ORGANIC CHEMISTRY
    • C07C—ACYCLIC OR CARBOCYCLIC COMPOUNDS
    • C07C7/00—Purification; Separation; Use of additives
    • C07C7/12—Purification; Separation; Use of additives by adsorption, i.e. purification or separation of hydrocarbons with the aid of solids, e.g. with ion-exchangers
    • C—CHEMISTRY; METALLURGY
    • C10—PETROLEUM, GAS OR COKE INDUSTRIES; TECHNICAL GASES CONTAINING CARBON MONOXIDE; FUELS; LUBRICANTS; PEAT
    • C10G—CRACKING HYDROCARBON OILS; PRODUCTION OF LIQUID HYDROCARBON MIXTURES, e.g. BY DESTRUCTIVE HYDROGENATION, OLIGOMERISATION, POLYMERISATION; RECOVERY OF HYDROCARBON OILS FROM OIL-SHALE, OIL-SAND, OR GASES; REFINING MIXTURES MAINLY CONSISTING OF HYDROCARBONS; REFORMING OF NAPHTHA; MINERAL WAXES
    • C10G25/00—Refining of hydrocarbon oils in the absence of hydrogen, with solid sorbents
    • C10G25/003—Specific sorbent material, not covered by C10G25/02 or C10G25/03
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6402—Hybrid switching fabrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/14—Multichannel or multilink protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6402—Hybrid switching fabrics
    • H04L2012/641—Time switching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Definitions

  • This invention relates to a communications node such as a multiservice switching apparatus and methods of operating communications nodes to perform for example multiservice switching.
  • Embodiments of the present invention are useful in, for example, chip-to-chip interconnect, board-to-board interconnect, chassis-to-chassis interconnect as well as in traditional network devices, such as LAN hubs and bridges, WAN routers, metro switches, optical switches and routers, wireless access points, mobile base stations and terminals, PDA's and other handheld terminals, wireless or otherwise, as well as other communications applications.
  • traditional network devices such as LAN hubs and bridges, WAN routers, metro switches, optical switches and routers, wireless access points, mobile base stations and terminals, PDA's and other handheld terminals, wireless or otherwise, as well as other communications applications.
  • Communications networks can be categorised according to the kind of traffic they are designed to carry, for example voice, video or data. Essential differences in purpose give each of these three kinds of network weaknesses when used for purposes other than they were designed for.
  • Circuit-switched networks are not designed to facilitate the introduction of new network services. When they were originally designed, the range of services envisaged was limited and the industry had been slow to move on from proprietary standards. Since then SS7 signalling has been introduced, but this operates over a separate packet network. Circuit-switching requires an end-to-end connection to be established before it can be used. This introduces a small but nonetheless significant delay before data can be sent across the connection. Circuit-switching normally employs narrow band links which are unsuitable for many applications, especially those involving video.
  • the term "circuit-switched” and “circuit-switching” used herein relate to switching to facilitate low latency data transfer as is common in the art and should not be construed as limited to original hard-wired circuit-switched connections.
  • Packet-switched architectures enable relatively sophisticated (compared to a telephone) terminal devices such as computers to access asynchronous multipoint-to-multipoint connectivity.
  • packet used herein will be used to mean a data payload and header which is switched in packet- switching modes. Packets therefore include for example, cells, frames and datagrams. Packet-switched architectures enable multiple data flows to have access to a single set of switching and link transmission resources which gives rise to contention and therefore variability in quality of service. Managing highly variable services to optimise long-term return on investment is complex, risky and costly.
  • packet switching requires every packet to be processed, delivering an unnecessary level of network resilience and wasting valuable network resources.
  • Video networks are traditionally unswitched to provide a limited number of high- bandwidth TN channels to a large number of television terminals. Such a network is unsuitable for interactive communication. Therefore, interactive cable television operators overlay a packet switched network on top of their cable inf astructure, while operators of interactive satellite TV typically use the telephone to provide a backchannel.
  • a "convergence" network comprising nodes capable of handling multiple services could be less complex, less costly, easier to operate and offer the flexibility of service innovation.
  • known convergence networks are based on packet- switched data network architectures.
  • IPv4 has a packet-switching architecture designed to give users equal access to the switching and transmission resources of a given node. This makes contention for resources a serious problem and accordingly the quality of service that packets receive is uncertain, even highly variable. As a result IPv4 network operators tend either to be a provider of higher cost, higher quality network services by leaving sufficient headroom to be confident that contention and the delays, jitter, packet-loss it introduces will be below thresholds their users demand, or to be a provider of lower-cost, lower quality network services in larger volumes by operating the network close to its maximum throughput. This is constrained only by the maximum delays, jitter, and packet-loss that users will accept.
  • IPv4 routers are stateless and therefore are not able to employ efficient processing techniques that require the router to be set up, such as pre-transmission switch set up, as used in circuit-switched networks, ATM networks etc, and process each header independently of every other, wastefully expending scarce network processing resources.
  • IPv4 Another drawback with IPv4 is that its headers are not structured to be easily readable for high-speed processing.
  • a number of overlay architectures and associated protocols have been developed to enable differentiated services to be offered in an IP network by enabling router resources to be differentially applied to particular classes of packets. This enables contention to be managed. Examples are IntServ, DiffServ, and MPLS. New protocols are introduced to enable the services to be accessed and the IP routers redesigned to enable these services to be delivered. Packets are class marked at the point of entry into the network (or earlier) so that the routers know which new service elements to provide.
  • the introduction of a service differentiation architecture into IPv4 enables network managers to control the relative quality of service that different packet classes receive but the scope for differentiating among packet classes is not adequate to differentiate services between individual end users. Accordingly, packets will continue to contend for resources and end users will continue to experience service variability.
  • IPv6 is a major architectural upgrade to IPv4 which introduces a number of important enhancements to IPv4, including Mobile Internet Protocol, automated address configuration, improved security and routing, and a much larger address base.
  • IPv6 meets service differentiation challenges by introducing into the header a 20-bit flow label which enables the application of packet processing resources to be differentiated down to individual application data flows.
  • IPv6 also reduces the complexity of header processing by fixing the header structure. This means processes can extract information from a predetermined position within the header. IPv6 is different enough from IPv4 that implementing it entails significant costs, risks and challenges. This has been a serious hindrance to its adoption.
  • ATM is a complete set of networking protocols.
  • ATM implements internetworking through conversion protocols called "adaptation layers". These enable specific kinds of network traffic (e.g. IP traffic) to be carried transparently across multiple interconnected ATM networks.
  • IP traffic e.g. IP traffic
  • ATM delivers service differentiation through virtual circuits which enable switching resources to be dedicated to appropriately marked traffic along a path across an ATM network.
  • the fixed small size and structure of ATM cells enables switching of packets using a virtual circuit identifier to be achieved at high speeds, and with very low jitter.
  • the small payload (48-bytes per cell) entails: A many more packets per megabyte than IP or Ethernet
  • the present invention seeks to provide an improved communications node and methods of operation thereof.
  • a communications node for establishing a plurality of logically distinct communications links running through the node contemporaneously to one or more remote nodes, the communications node comprising: input switch means; output switch means; a plurality of communications resources connected between said input and output switch means, said plurality of communications resources including at least first and second communications resources adapted to deliver different communication services including packet-switched and circuit-switched services; control means associated with said input switch means and said output switch means to establish logically distinct links through the node, wherein each said link is configurable to selectively include one of the at least first and second communication resources.
  • a communications node for receiving at least one input signal comprising a plurality of components, each said component comprising part of a logical link over a portion of a communications network
  • the communications node comprising: ingress means for receiving said at least one input signal; egress means for outputting at least one output signal comprising one or more components of said input signal; one or more signal processing means connected between the ingress means and egress means, for receiving components of said at least one input signal and processing said components in accordance with a predetermined communications process; first switching means configurable to selectively cause a signal output from said ingress means to bypass one or more of said signal processing means en route to said egress means; second switching means configurable to direct signals output from said signal processing means to said egress means.
  • a communications node for receiving and transmitting signals comprising sets of signal components transmitted at intervals, wherein a set comprises a number of signal components partitioned from one another and wherein concatenated signal components in adjacent sets establish a number of logical links over a portion of a communications network, said node comprising: input switch means; output switch means; control means connected to said output switch means and programmable to cause selected ones of the partitioned signal components of a set to be aggregated, such that said aggregated signal components define an aggregated logical link having a bandwidth corresponding to a predetermined multiple of the signal component bandwidth.
  • Advantageously preferred embodiments are universal, interoperating with packet switched and circuit switched architecture, and is applicable to layer 2+ protocols (including ATM, Ethernet 802.3 and 02.11, IPv4 and IPv6, MPLS) and system interconnect standards (such as Infmiband, PICMG 2.16 and 2.17).
  • layer 2+ protocols including ATM, Ethernet 802.3 and 02.11, IPv4 and IPv6, MPLS
  • system interconnect standards such as Infmiband, PICMG 2.16 and 2.17.
  • Preferred networks can instantly provision dedicated end-to-end paths that can achieve 100% efficiency, while traditional packet switched networks often waste more than 50% of their theoretical throughput managing congestion.
  • Preferred nodes handle QoS internetworking at layer 1, reducing requirement for network packet processing - policing, routing, scheduling, protocol conversion, tunnelling, segmentation and reassembly, header modification, checksum recalculation, etc. - which introduces cost, complexity and latency.
  • Preferred nodes enable a common physical network to be reconfigured on-the-fly into logically distinct virtual networks that can have distinct topologies.
  • Preferred node virtual networks can use and isolate distinct bearer services, enabling a common physical network to support, for example, ATM + IP, IPv4 + IPv6, Ethernet LAN + IP WAN, or even packetised and unpacketised traffic.
  • Preferred nodes offer a single common migration path to convergence for all network operators.
  • Preferred nodes provide a scalable foundation for multiservice switching systems.
  • Preferred nodes guarantee low-latency where it is required.
  • Preferred nodes permit per-hop latency soft-configurable, practically around 1ms.
  • Preferred nodes guarantee bounded jitter (interpacket delay variation).
  • Preferred nodes permit in-order delivery of packets. Preferred nodes permit dedicated end-to-end paths (zero congestion).
  • Preferred nodes offer unpacketised streaming data which can be transported, enabling significant efficiency gains.
  • Preferred nodes enable Ethernet in the LAN and UNA-enabled IP in the WAN and MAN will perform significantly better than ATM in these environments and at lower cost.
  • FIG. 1 is a schematic diagram of a preferred communications node for multiservice switching which embodies the present invention
  • FIG. 2 is a more detailed view of the communications node of Figure 1;
  • FIG 3 is a schematic diagram of a first synchronous asynchronous time-slot interchange (SATSI) stage in the node of Figure 1;
  • SATSI synchronous asynchronous time-slot interchange
  • Figure 3 A is a schematic diagram illustrating the switching of synchronous and asynchronous signals through an exemplary multiservice switching node
  • Figure 4 is a flow diagram illustrating loading of a switching buffer in a synchronous mode of operation of the SATSI stage of Figure 3;
  • Figure 4A is a flow diagram illustrating loading of a switching buffer in an asynchronous mode of operation of the SATSI stage in Figure 3 ;
  • Figure 5 is a flow diagram illustrating an asynchronous mode of operation of the SATSI stage of Figure 3
  • Figure 6 is a flow diagram illustrating a packet-switching mode of operation of the SATSI stage of Figure 3;
  • Figure 7 is a flow diagram illustrating a time-slot interchange switching scheme applied to the time-slot interchange switching stage of Figure 3;
  • Figure 8 is a schematic diagram of a network illustrating how preferred embodiments converge different networks through multiservice nodes to achieve extended circuit switched channels and/or packet channels through a multiservice network.
  • the preferred embodiment is a communications node 10 for multiservice switching.
  • the node 10 has an ingress stage having a number of physical communications interfaces in the form of multiple line interface units 12 for receiving a plurality of signals 14. At least one of these interfaces, and usually several of them, employ a synchronous transmission protocol, for example H.110. Others of the physical communications interfaces are asynchronous.
  • the configuration of nodes embodying the present invention in respect of for example the numbers of synchronous and asynchronous signal paths is arbitrary and will depend at least in part on the application.
  • the configuration may also be dynamic in that one or more of the signal paths of the node has synchronous and asynchronous modes of operation.
  • the received signals 14 are on discrete paths, and each signal is either synchronous or asynchronous.
  • each synchronous signal can be regarded as a plurality of time-division multiplexed time-slots in succession carrying traffic of various kinds, including packets of different network protocols — for example IP, ATM, Ethernet — and unpacketised data, for example PCM voice.
  • Each asynchronous signal may be regarded as a plurality of statistically multiplexed packet-switched services.
  • the line interface units 12 are connected to a first signal path switching stage 15.
  • This stage is arranged to switch signals either into a first Synchronous Asynchronous Time-Slot Interchange SATSI stage 16, which stage 16 includes buffering, and both Time Slot Interchange TSI and signal path switching, or a second signal path switching stage 17.
  • the SATSI stage 16 is arranged to switch the contents of time slots of the independent signal paths between line interface units 12 and 20.
  • the line interface units 20 are connected to a core processing stage 18 providing packet processing, signal processing and direct connections, which stage 18 will be explained in more detail hereinafter.
  • the core processing stage 18 is connected via the line interface unit 24 to a third signal path switching stage 21.
  • this stage is arranged to switch signals either into a second Synchronous Asynchronous Time-Slot Interchange stage 22 including buffering, and both TSI and signal path switching, or a fourth signal path switching stage 23.
  • a further bank of line interface units 26 form an egress stage adjacent to the fourth signal path switching stage 23.
  • the node control circuitry 30 includes node resource controllers among other control functions.
  • the node's software and hardware may be configured by sending instructions using standard network protocols to protocol handlers, implemented either in software running on the node or in hardware. Configuration is achieved by known means, for example by changing register values stored in memory shared with hardware.
  • the node 10 enables bundles of channels in a physical link bandwidth to be programmably aggregated and disaggregated by multiplexing, demultiplexing and buffering. This enables a single physical link to function as a multiplicity of logical links of various desired bandwidths operating in parallel. Physical links can therefore simultaneously support a plurality of logical links collectively carrying a multiplicity of different traffic types. Signals are transmitted onto logical links via buffers, which the switch fabrics transfer cell-by-cell to the appropriate bundle of output channels.
  • any of the logical links can be independently either circuit-switched by the SATSI stages, or demultiplexed via packet buffering and switched into one of the packet processing pipelines that is appropriate to the traffic type, for example a packet switching stage of Ethernet, ATM, IP, IP over ATM, IP over Ethernet, or a signal processing stage for unpacketised data, such as a decoder for PCM voice, or for MPEG-4 video.
  • Synchronous transmission is based on communication in frames, time slots, and cells.
  • a cell is the minimal unit that can be transmitted or received, for example 8 bits for a PCM voice telephony network.
  • a time slot is the duration of transmission for a single cell at a given bandwidth. For a given cell size, time slot duration varies with bandwidth as follows:
  • time slot duration cell size / bandwidth
  • Switching of a cell needs to be completed within a single time slot.
  • a channel is the aggregate transmission capacity of a given time-slot within a frame (explained below). For example, the bandwidth of a unidirectional channel for PCM voice telephony is 64kbps.
  • a frame is a block of cells or time-slots associated with a plurality of distinct channels, for example 512 64kbps channels, which would have an aggregate bandwidth of 32Mbps.
  • the start and end of a frame and the channels within a frame are signalled by clock pulses. Nodes which use a common reference clock for timing form a synchronous network.
  • Channel bandwidth, time slot duration and cell size are related by the formula
  • channel bandwidth cell size / time slot duration Given two of these parameters, the third is therefore determinable.
  • Preferred networks can therefore be characterised by frame length, channel bandwidth, and cell size.
  • a IGbps link could carry over 16 million 64kbps voice channels (each with a cell size of 8bits and a time slot of 125 microseconds), but managing this number of links is complex.
  • a switch of this capacity would be located at a point in the network where the number of connections is small, and therefore large groups of these calls are switched to and from the same nodes. This permits many low-bandwidth channels to be multiplexed into few high-bandwidth channels.
  • a IGbps link could be multiplexed into just 32 32Mbps channels.
  • input ports in synchronous mode buffer a complete frame ahead of switching, and longer frames therefore entail more latency.
  • the node can connect to Ethernet networks at 10Mbps / 100Mbps / IGbps / lOGbps.
  • the node's clock can be configured to generate timing for frames with an arbitrary number of channels.
  • the SATSI employs four kinds of buffer, explained in more detail hereinafter.
  • Input buffers receive cells from line interface units.
  • Switching buffers receive data cell-by- cell in asynchronous mode and frame-by-frame in synchronous mode.
  • Single-flow packet buffers receive a cell at a time during the SATSI time-slot interchange process.
  • Single-flow packet buffers serve to buffer cells and forward valid packets of a particular packet protocol, for example Ethernet 802.3 or IP, to one or more associated multiple-flow packet buffers, discarding packets if they are invalid.
  • Single-flow packet buffers are not tied to physical ports - at any instant there may be many more single-flow packet buffers than physical ports.
  • Multiple-flow packet buffers aggregate (statistically multiplex) packet streams from single-flow packet buffers. Multiple-flow packet buffers are similarly not tied to physical ports - at any instant there may be many more multiple-flow packet buffers than physical ports. Their leading cell is an input channel addressable by the SATSI time slot interchange stage.
  • Multiple-flow packet buffers operate prioritisation and discard policies appropriate to their specific packet protocol. For example, if the buffer is full and a packet is copied to it, the packet may be discarded or other packets may be discarded in favour of it. Also, the packet may be queued elsewhere than at the back, for example, to prioritise it over less time-sensitive packets.
  • Packets are forwarded onto logical links by means of the packet switch mode of the SATSI, described hereinafter.
  • Signal streams of any traffic type can be circuit-switched between any two nodes in a network of preferred nodes and can be switched into any of the available packet processing or signal processing pipelines at any node.
  • Unpacketised data is carried end-to-end on one or more logical links that are circuit-switched at all intermediary nodes and the last logical link in the sequence terminates in an appropriate signal processing stage.
  • Packetised data streams can be carried along any combination of circuit-switched logical links and packet-switched logical links, and where each packet switched logical link ends the data is switched into a packet processing pipeline of the appropriate type.
  • this enables network layer packets, for example IP, to be transmitted and processed without need for a link layer, as defined in the traditional Open Systems Interconnection OSI reference model.
  • the preferred node therefore enables services to be provided which flexibly combine features of packet switching, such as "always-on" transport, resilient routing, with features of circuit-switching, such as low latency and security.
  • FIG 2 illustrates parts of the node of Figure 1 in more detail, in particular components of the line interface stages 12 and 26, the SATSI buffering and switching stages 16 and 22, core stage 18 and the node control circuitry 30.
  • intermediate line interface units 20 and 24 are not shown on Figure 2.
  • the line interface stage 12 comprises a plurality of line interface units 32-40, each providing an ingress port for a different input path #l-#5
  • selected ones of the line interface units 38,40 include encoder circuitry 52,54 and decoder circuitry 53,55 for specific types of communications traffic, such as unpacketised voice and video data streams.
  • the respective communications paths #l-#5 are switchable by signal path switches SW1-SW5 either to input buffers 56-64 of the SATSI stage 16, or direct to the signal path switches SW6-SW10, which are set up to switch the appropriate input line according to the set up for switches SW1-SW5.
  • the SATSI stage 16 comprises the SATSI switch fabric consisting of further buffer circuitry, multiplexing circuitry and switching tables to be described hereinafter with reference to Figure 3, and associated control circuitry 68.
  • SATSI control circuitry 68 controls the switching fabric 66 such that predetermined cells of the signals on the input paths #l-#5 are placed in the desired sequence in selected ones of the SATSI output buffers 72-80.
  • the output buffers 72-80 of the SATSI stage 16 are connected to signal path switches SW6-SW10 for switching their contents between a packet processing pipeline 82,83, decoder circuitry 53,55, or a direct connection 86-90 through the node 10.
  • Packet processing pipelines 82,83 can be seen on Figure 2 disposed between signal path switches SW6-SW7 of the first SATSI stage 16 and signal path switches SW11-SW12 of the second SATSI stage 22.
  • Direct connections through the node can be seen linking signal path switches SW6-SW10 of the first SATSI stage 16 to signal path switches SWl 1-SW15 of the second SATSI stage 22.
  • the switches SWl 1 -SWl 2 are set up to switch the appropriate input line according to the set up for switches SW6-SW10.
  • the second SATSI stage 22 comprises elements corresponding to those of the first SATSI stage 16, namely input buffers 92-100, signal path switches SWl 1 -SWl 2 and SW16-SW20 (mentioned above) a SATSI switching fabric 102, of further buffers, multiplexing circuitry and switching tables, output buffers 106-114, and control of control circuitry 104.
  • Switches SW16-SW20 are set up to switch the appropriate input line according to the set up for switches SW11-SW15.
  • the outputs of switches SW16-SW20 are connected to a corresponding plurality of line interface cards 116- 124. h this example, line interface cards 122 and 124 are provided with encoder/decoder circuitry 142,144 specific to predetermined traffic types.
  • Interconnects 150A-150C connect the SATSI control circuits 68 and 104 to a microprocessor controller 152 through a chip-to-chip or board-to-board interconnect mechanism device 154, such as a PCI bus, or through shared memory, as for example in memory mapped I/O.
  • Interconnects 151A-B connect the clock to SATSI control circuitry 68 and 104.
  • the node initialises by discovering its resources, for example the SATSIs, the packet processing pipelines, codecs, etc., and their properties, for example port bandwidth and transmission timing (synchronous or asynchronous), and then configuring them according to any pre-established set of instructions.
  • Asynchronous links have a single unpartitionable channel and can support only a single logical link carrying packetised data. They therefore have a single entry in their switching tables as will be explained hereinafter.
  • each half- duplex unidirectional link is also configured as a single logical link, one hop long, packet switched into a packet processing pipeline for a default network signalling and control protocol, for example IP.
  • the switching tables are therefore initialised with a single entry.
  • nodes This enables the nodes to communicate with each other using standard network protocols to share appropriate information about their resources, including details of the logical links they have available, such as what network addresses they connect to. This sharing of information occurs whenever relevant changes occur so that nodes in the network are kept up to date about the state of other nodes.
  • Other node resources may then be configured to partition physical links into logical links and to switch logical links to appropriate processing stages.
  • control network can be partitioned to use, for example, a slice of the available physical link bandwidth and a single packet processing pipeline per node (which it may share with other traffic).
  • Node resources can then be configured to also provide connectivity and packet processing for virtual networks, even ones that use protocols incompatible with the default network protocol. Examples of network protocols for which the node might provide processing include but are not limited to IPv4, IPv6, SNMP, ICMP, TCP, RSVP, SIP, H323, Q931, Ethernet IEEE 802.3, ATM, SS7.
  • Figure 3 illustrates the components and exemplary functions of the first SATSI switching stage 16. Although the reference numerals on Figure 3 apply to the first SATSI stage 16, for clarity, the second SATSI stage 22 has corresponding components and the same manner of operation, mutatis mutandis.
  • the SATSI input buffers 56-64 each supply a corresponding switching buffer 160-168.
  • Discrete address spaces within each of the switching buffers 160-168 are addressable by means of the addressing circuitry 170-178 associated with each of the switching buffers and connected via the multiplexing circuitry 202 to the control circuitry 68.
  • the control circuitry 68 has access to switching information 210.
  • the switching information 210 is in the form of a plurality of switching tables, one switching table being associated with each of a plurality of buffers 181-190.
  • each output buffer 181,183,185,187,189 would have associated with it a switching table defining for each address space within it a source address space within one of the switching buffers 160-168, or one of the packet flow buffers 182,184,186,188,190.
  • the uses of packet flow buffers 182,184,186,188,190 and associated tables are described hereinafter with reference to Figure 3 A.
  • Discrete address spaces within each of the buffers 181-190 are individually addressable by means of addressing circuitry 170a- 179a associated with each said---?** buffer.
  • the addressing circuitry 170a- 179a is connected through the multiplexing circuitry 202 to the switch control circuitry 68.
  • the line interface unit 191-199 are disposed between the first SATSI stage 16 and the core stage 18 of the node.
  • the input channel field of each switching table is programmed with the input channel addresses from which the next cell is to be read for each output channel in turn.
  • the same input channel may appear more than once in the switching tables. This enables an input channel to be switched to multiple output channels at the same time, providing a means of replicating input to output for the purposes of multicasting and anycasting etc.
  • Output channels that are unused are marked as such to permit processes wishing to alter the switching tables to determine whether a channel is in use or not. Only if a channel is not in use does the control circuitry 68 allow an output channel entry in a switching table to be amended.
  • signal path #1 is regarded as a synchronous signal path, and the SATSI port is in synchronous mode.
  • the start of the frame is signalled across the network by the frame pulse.
  • Control circuitry 68 detects the frame pulse via bus 220 and, in response, causes the contents of the input buffer 56 to be copied into the corresponding switching buffer 160.
  • the SATSI stage 16 thus switches the contents of an entire frame within the frame's duration.
  • the SATSI stage 16 buffers packets in multiple-flow packet buffers and switches the buffers' leading cells, deleting the leading cell each time one is switched (see Fig 7).
  • the switching information 210 controls the sequence of filling of each buffer 181-190.
  • the switching table 215a relating to output buffer 181
  • the first address space (channel) 11,000 of the output buffer 181 is designated to receive the contents A of input channel 1000.
  • the second address space 11,001 of output buffer 181 is designated to receive the contents B of input channel 3003.
  • the third address space 11,002 of buffer 181 is designated to receive the contents C of input channel 1004.
  • the fourth address space 11,003 of the output buffer 181 is designated to receive the contents D of input channel 2005 and so on, until the table entry relating to the last space of the output buffer is reached.
  • the switching table 215a could also designate input channels from input buffers 166, 168 of signal paths #4 an #5, and from packet flow buffers 182,184,186,188,190.
  • SATSI switching stages 16,22 are able to receive, switch and transmit a mixture of synchronous and asynchronous inputs, including packet streams.
  • Each SATSI stage 16,22 therefore has three modes of operation:
  • paths through the first SATSI stage 16 operate in modes (i) or (ii), whereas paths through the second SATSI stage 22 operate in modes (i) or (iii).
  • the modes (i), (ii), (iii) above are described in more detailed with reference to Figures 4, 5 and 6 respectively.
  • Figure 3A three exemplary signals are shown arriving at ingress ports on paths #1, #2 and #3 of the node. These ports are referred to herein as ports #1, #2 and #3 accordingly.
  • the signal on path #1 is asynchronous, while the signals on paths #2 and #3 are synchronous. Therefore in this example port #1 of the SATSI is in asynchronous mode, and ports #2 and #3 are in synchronous mode.
  • SATSI TSI switching, signal path switching, and packet buffering enable core processing stages, including packet processing pipelines, to process data flows carried . from any inbound logical link.
  • the dotted lines indicated by reference numeral 61 are to indicate that other ports would be present but are not shown here.
  • cells Pl.l, P1.2 ... Pl.n of the packet stream arrive at the input buffer 56 and are transferred as they arrive cell-by-cell to the switching buffer 160 of the port.
  • cells of the synchronous stream arrive and are buffered in input buffers 58,60 until the "start of frame pulse" is detected, when the contents of the input buffers 58,60 — an entire frame of cells — is transferred to the switching buffers 162,164.
  • the switching buffers 160-164 thus buffer the contents of the input channels and are addressable via the switching tables, as described hereinbefore with reference to Figure 3.
  • Switching table 215a is programmed such that output channel 11000 receives cells from input channel 10000, which is the address of the leading cell of multiple-flow packet buffer 184a, maintained* to permit packets to be multiplexed onto this outbound logical link. The contents of these output channels are written to the output buffer of egress port #1 for transmission via line interface units 191.
  • Switching table 215x is programmed such that output channel 101000 receives cells from input channel 1000, which is the address of the front of the switching buffer 160 for the signal arriving at ingress port #1.
  • the cells of this output channel are buffered in a single-flow packet buffer 182 operating in asynchronous mode (see Fig 5), which repacketises the contents according to the specific packet protocol.
  • Control circuitry 68 looks up this buffer in the packet buffer interface table 211, described in more detail hereinafter, and copies packets issuing from this buffer to the multi-flow packet buffers 182a, 184a. Packets PI P2 ...and so on are thus copied to multiple- flow packet buffers 1 and 2 referenced by numerals 182 and 184 respectively.
  • Switching table 215b is programmed such that output channels 12001, 12003, 12005 receive cells from input channel 9000, which is the address of the leading cell of multiple-flow packet buffer 182a maintained to permit packets to be multiplexed onto this outbound logical link.
  • Switching table 215b also dictates that output channels 12002, 12004 receive cells from input channels 3000,3001, which represent the inbound logical link within the signal on path #2 carrying stream A, composed of cells Al, A2 etc. The contents of these output channels are written to the output buffer 183 of egress port #2 for transmission via the line interface unit 193.
  • Switching table 215b is programmed such that output channels 102000-102002 receive cells from input channels 2001,2003,2005, which represent the inbound logical link within signal #2 carrying packet stream Q, composed of packets Ql, Q2 ... Qn.
  • the packet Ql is, in turn, composed of cells Ql.l, Q1.2 ... Ql.n.
  • the corresponding output channel is buffered in a single-flow packet buffer 184 operating in asynchronous mode (see Fig 5), which repacketises the contents of the buffer according to the specific packet protocol.
  • Control circuitry 104 looks up this buffer in the packet buffer interface table 210, described in more detail hereinafter, and copies packets issuing from this buffer to the multi-flow packet buffers 182a, 184a. Packets PI, P2, etc are thus copied to multiple-flow packet buffers 1 and 2.
  • Switching table 215c is programmed such that output channels 13001, 13003 receives cells from input channels 2002, 2004, which represent the inbound logical link within the signal on #2 carrying stream B, composed of cells Bl, B2 etc. The contents of these output channels are written to the output buffer of egress port #3 for transmission via the line interface unit 195.
  • a packet stream (Q) carried on a logical link within a synchronous signal arriving at ingress port #2 is demultiplexed and packetised, and the packets are buffered along with those from a packet stream (P) carried on an asynchronous signal arriving at ingress port #1.
  • the resulting statistically multiplexed packet flow is multiplexed onto two outbound logical links (via two multiple-flow packet buffers), one a part of port #2's output signal and the other the whole of port #l's output signal.
  • the contents of two logical links with identical bandwidths are swapped.
  • control circuitry 68,104 creates a single-flow packet buffer, which operates in asynchronous mode. And for each outbound logical link that is to carry a multiplexed packet flow, control circuitry 68,104 creates a multiple-flow packet buffer, and associates it with one or more packet flows from single-flow packet buffers via the packet buffer interface table.
  • Each single-flow packet buffer can thus be interfaced to one or more multiple-flow packet buffers by programming the packet buffer interface table with an appropriate identifier for the buffer against appropriate identifiers for the appropriate multiple- flow packet buffers. This enables a multiplicity of packet flows to be statistically multiplexed into a single flow, for transmission to a packet processing pipeline or via a logical link to another node.
  • routing information used by packet processing pipelines to select and identify the path for packet forwarding may use interface identifiers which correspond to multiple entries in the packet buffer interface table. This enables packet flows buffered in multiple-flow packet buffers to be replicated to a multiplicity of outbound logical links.
  • FIG. 4 illustrates the buffer loading process that is performed when a path through the SATSI is operating in synchronous mode.
  • the "start of frame" signal generated by the clock 155 is detected by the control circuitry 68, and the process is triggered to start.
  • the control circuitry 68 causes the content of this port's input buffer 56-64, which will be a frame of cells, to be copied to this port's switching buffer 160-168.
  • control circuitry 68 deletes the frame of cells from the input buffer 56-64.
  • control circuitry 68 generates a "Switching Buffer Ready Signal", which triggers the SATSI time-slot interchange switching process (see Figure 7) to start for this port's output buffer. Control then stops the process until it is triggered by the next "start of frame” signal. The process is the same when performed by the second SATSI stage 22.
  • FIG. 4A illustrates the buffer loading process that is performed when a path through the SATSI is operating in asynchronous mode.
  • the "start of channel" signal generated by the clock 155 is detected by the control circuitry 68, and the process is triggered to start.
  • the control circuitry 68 causes the content of this port's input buffer 56-64, which will be a single cell of data, to be copied to this port's switching buffer 160-168.
  • control circuitry 68 deletes the cell from the input buffer 56-64.
  • control circuitry 68 At step 475 control circuitry 68 generates a "Switching Buffer Ready Signal", which triggers the SATSI time-slot interchange switching process (see Figure 7) to start for the single-flow packet buffer into which cells of the asynchronous packet stream are being buffered. Control then stops the process until it is triggered by the next "start of frame” signal. The process is the same when performed by the second SATSI stage 22.
  • FIG. 5 illustrates steps taken in an asynchronous mode of operation of the SATSI 16.
  • a "single-flow packet buffer written to" signal is generated by the time-slot switching process each time a cell is written to any single-flow packet buffer (see Figure 7). This signal is detected by the control circuitry 68 and the asynchronous mode is triggered to begin for a particular single flow packet buffer. To prevent the process illustrated in Figure 5 being restarted by another "single-flow packet buffer written to" signal before it has stopped 560, this signal is disabled 515, and re- enabled at the end of the process 555.
  • control circuitry 68 uses a packet- framing process specific to a particular packet protocol to identify a packet frame in the buffer starting from the front. If there is none, the "single-flow packet buffer written to" signal is re-enabled (see step 555), the process temporarily stops 560.
  • control circuitry 68 checks that it is valid according to the specific packet protocol (see step 525). For example, this might include checking the packet's checksum. If it is not, it is discarded (see step 530), the "single-flow packet buffer written to" signal is re- enabled (see step 555), and the process stops (see step 560).
  • control circuitry 68 looks up in the packet buffer interface table the interface identifier for this single-flow packet buffer, and copies the packet to each multiple flow packet buffer associated with this interface (see step 540). Multiple-flow packet buffers operate prioritisation and discard policies appropriate to their specific packet protocol, as described hereinbefore.
  • control circuitry 68 deletes from this buffer the packet and any cells that precede it, since they cannot be properly framed.
  • the "single-flow packet buffer written to" signal is re-enabled 555.
  • Control process then stops 560 until retriggered by the next "single-flow packet buffer written to" signal (see Figure 7). The process is the same when performed by the second SATSI stage 22.
  • FIG. 6 illustrates steps performed in a packet switching mode of the SATSI 16.
  • this mode of operation tends to be used most frequently by the second SATSI stage 22. It corresponds to the asynchronous mode of operation of the SATSI apart from the packet framing process (see step 620) which identifies packets formatted for packet switching, whose header (and perhaps trailer) identify the egress interface to which their payload is to be forwarded, and in addition such information as payload prioritisation and discard eligibility.
  • a "single-flow packet buffer written to" signal is generated by the time-slot switching process each time a cell is written to any single-flow packet buffer (see step 745 of Figure 7). This signal is detected by the control circuitry 104 and the asynchronous mode is triggered to begin for a particular single flow packet buffer. To prevent the process illustrated in Figure 6 being restarted by another "single-flow packet buffer written to" before it has stopped 660, this signal is disabled 615, and re-enabled at the end of the process 655.
  • control circuitry 104 uses a packet-framing process specific to a particular packet protocol to identify a packet frame in the buffer starting from the front. If not, the "single-flow packet buffer written to" signal is re-enabled (see step 555), then the process temporarily stops 660.
  • control circuitry 104 checks that it is valid according to the specific packet protocol (see step 625). For example, this might include checking the packet's checksum. If it is not, it is discarded (see step 630), the "single-flow packet buffer written to" signal is re- enabled (see step 555), and the process stops (see step 660).
  • control circuitry 68 looks up in the packet buffer interface table the interface identifier that is contained in the switching header, and copies the packet to each multiple-flow packet buffer associated with this interface (see step 640). Multiple-flow packet buffers operate prioritisation and discard policies appropriate to their specific packet protocol, as described hereinbefore.
  • the control circuitry 104 deletes from the buffer the packet and any cells that precede it, since they cannot be properly framed.
  • the "single-flow packet buffer written to" signal is then re-enabled 655. Control process then stops 660 until retriggered by the next "single-flow packet buffer written to" signal (see Figure 7). The process is the same when performed by the second SATSI stage 22.
  • the process switches cells from input channels to output channels in a buffer, either an output buffer 181 , 183, 185, 187, 189 or a single-flow packet buffer.
  • the control circuitry 68,104 detects the "switching buffer ready" signal generated by the control circuitry once every frame for each switching buffer whose port is synchronous mode (see Figure 4), and once every time slot for each switching buffer whose port is in asynchronous mode (see Figure 4A), as each cell is transferred from the input buffer port's input buffer.
  • the output channel pointer is initialised to start at the beginning of the switching table (see step 715). In the example of Figure 3 the pointer for signal path #1 begins at address space 11,000.
  • control circuitry 68,104 accesses the switching information 210 to determine the source input channel for the output channel in question.
  • the cell that is currently buffered for this input channel (in either a switching buffer or a multiple-flow packet buffer) is read.
  • control circuitry 68,104 checks to see if the buffer is already full. If it is not, this cell is copied to the output buffer (see step 735), this buffer location corresponding to the output channel. Control circuitry 68,104 then checks if this output buffer is a single-flow packet buffer. If it is, control circuitry 68 generates a "single-flow packet buffer written to signal" (triggering the start of either an asynchronous mode or packet switched mode process for that buffer).
  • Control circuitry 68,104 then checks if the input channel addresses a multiple-flow packet buffer (see step 750). If it does, the leading cell of that buffer is deleted 755, so that what was the second cell becomes the first. Next the output channel pointer is incremented by 1 (see step 760). If the process has not reached the last pointer in the output channel it reverts to step 720 (see decision indicated by reference numeral 765). If the last pointer in the switching table has been processed, the control circuitry 68,104 halts the process as indicated at step 770.
  • the signal streams received by and output from the line interface units 42-50 pass into the first signal path switching stage 15.
  • Switches SW1-SW5 are set to direct the signal streams either directly to the switches SW6-SW10, or through the switching fabrics of SATSI 16 and 22.
  • These use switching tables which are programmed to deliver predetermined logical links through the network and, where appropriate, reassemble packets for packet processing via packet buffers.
  • High QoS synchronous streams output from the SATSI switching stage 16 may be switched to decoding circuitry 53,55 and, via line interface units 49,50 to, for example, a phone, a digital audio player, a video monitor, etc. or onto one of the direct links 86-90 through the node, whereas output streams from multiple-flow packet buffers are switched onto an appropriate one of the packet processing pipelines 82,83.
  • High QoS traffic arrives at one of the switches SWl 1 -SWl 5 of the second SATSI stage 22 and may be switched directly to the corresponding switch SW16-SW20 if no further multiplexing/demultiplexing is required for the stream, or switched through the SATSI stage 16 if further multiplexing/demultiplexing is required. Thereafter the traffic is supplied to a respective one of the egress line interface units 116-124.
  • stages 82a-82d of pipeline 82 implement a packet processing pipeline for an OSI layer 3 network protocol operating over an OSI layer 2 link layer protocol, for example, IP over Ethernet.
  • Stages 83a and 83b of pipeline 83 implement an OSI layer 3-only packet processing pipeline. This enables OSI layer 3 traffic to be carried without using OSI layer 2 link layer mechanisms.
  • Stages 82d and 83b prepends packet switching information in the form of a switching header to the packet issuing from stages 82c and 83a respectively of the packet processing pipelines.
  • This switching information includes an interface identifier which identifies the egress interface to which their payload is to be forwarded, and in addition such information as payload prioritisation and discard eligibility.
  • the interface corresponds to a set of multiple-flow packet buffers, as specified in the packet buffer interface table, and packets forwarded to a given interface are copied to each multiple-flow packet buffer. Multiple-flow packet buffers prioritise or discard this packet according to the rules of the specific packet protocol.
  • Input ports for paths #1 and #2 of the second SATSI stage 22 are in packet switch mode, and signal path switches SWl 1 and SW12 are set up to switch signals into the input buffers 92,94.
  • the packet (less any switching information added by the packet processing pipelines) is copied to the set of multiple-flow packet buffers corresponding to the interface, as determined by the packet buffer interface table.
  • the multiple flow packet buffers are switched by the SATSI switching stage 102 according to the pre-programmed switching tables onto selected ones of the SATSI output buffers 106- 114 for supply onto the line interface cards 116- 124.
  • logical links are built at the request of network managers, users, or software or hardware processes.
  • a request to build a logical link can minimally specify the start and finish of the link, the bandwidth of the link and the class of traffic that the logical link is to carry. Some of these parameters might have defaults in certain networks.
  • Setting up a logical link is a distributed process which occurs in two passes, an outbound pass and an inbound pass.
  • a request to establish a logical link is routed from a source node to a destination node over a plurality of preferred nodes.
  • a record of the route undertaken is constructed during the pass and retained as part of the request data, and each node checks to establish whether or not the node can make the required resources available. If the node does have the required resources available, it sets up the logical link and appropriate switching tables. If the request reaches its origin without being denied, the logical link has been established and is ready for us. A message is sent halting further searching for resources.
  • the node If at any each node, insufficient resources are available, the node returns a request denied message to the node from which the request arrived. Protocol handlers at that node may then try alternative routes via other preferred nodes connected to this node. In this way, the entire tree of possible routes can be tested for paths with suitable resources.
  • Another embodiment is able to provide low latency data transport between any two end points in the network is described below.
  • These end points may comprise of computers or routers or any consumer device such as telephone or an Internet appliance.
  • the network consists of nodes which are connected to each other using a plurality of distinct channels.
  • Each node has the ability to provide a number of dedicated channels, each channel comprising of an input medium which can be switched through to an output medium by means of management software. Once a channel has been set up through a particular node, all traffic through that channel is switched in the form of serial data, resulting in the extremely low latency characteristics of the network.
  • Dedicated channels such as described above may then be constructed spanning more than one node in the network.
  • the node responsible for constructing the channels will accept and provide communications traffic by means of, for example, an Internet Protocol router function.
  • the router interfaces to a separate channel between the router and the consumer electronic appliance, for example a voice over internet protocol telephone.
  • the router will interface to a high bandwidth switch or router which is connected to low latency backbone media. In this manner traffic can be routed globally with extremely low latency from consumer device to consumer device.
  • Wireless could also be used for connecting the router at the consumer premises to the electronic appliances used by the consumer in close proximity ' to' one or more such network nodes.
  • more than one channel may be set up for a single purpose in order to provide redundancy of the signal.
  • another channel which follows a separate geographical route to the same destination node may not be corrupted en- route. In this manner reliable transport can be provided even while using unreliable media.
  • the nodes set up distinct transmit channels for outgoing communication requirements.
  • the return paths or receive channels are built by the destination node in response to the request for communication services. In this manner the receive and transmit channels occupy unrelated paths.
  • the network does not rely on legacy telecommunications infrastructure such as telephone exchanges and Internet Service Providers
  • the network can be used in complete isolation from any existing data networks or telephony networks.
  • this can be accomplished by making use of existing low latency backbone, such as provided by optical fiber.
  • the network enables peer to peer telecommunications on a very large scale. For example, any consumer could connect a Voice over Internet Protocol telephone to their node, and using this telephone, would be able to place a telephone call to any other consumer who also has a Voice over Internet Protocol telephone connected to their node. There are no significant running costs for this service, each consumer provides a safe place for the network node and pays the electricity bill for his own node.
  • the Internet backbone provider will be able to route the traffic in the appropriate manner using Voice over Internet Protocol Gateways and collect any legacy call termination charges.
  • the charges can be passed on to the consumer in a number of ways such as pre-paid calling cards.
  • the network enables a consumer to take their Voice over Internet Protocol handset and use it at their neighbour's node. Since there is no billing associated with the use of the node, there is no requirement to tie a user down to a particular node for low bandwidth services such as Short Message Services, email, telephony amongst others.
  • Domain Name Services could provide for the resolution of hostnames to IP addresses for the network. Where a user roams to another territory, such Domain Name Services could be updated dynamically in order to ensure the reachability of the consumer regardless of which isolated collection of nodes they are close to.
  • the above services may be built into the network in order to decrease reliance on legacy telecommunication systems.
  • Other services include, for example, Email, Short Messaging Services and firewalling may also be built into the nodes. Most of these services may be dispersed over a number of nodes in order to provide carrier levels of availability for the services.
  • the network can be built in a psuedo random manner by choosing an area such as a particular suburb. A small number of nodes can be installed in order to seed such a suburb, spread out over the area. Thereafter any consumer who decides to place a node in their premises may do so. Each consumer adding a network node increases both the bandwidth capacity of the network along with the switching capacity and service capacity, such a Domain Name Service, email service and others.
  • the network could provide fully encrypted Internet Protocol traffic between nodes. Trusted parties such as government agencies may require the encryption keys in order to allow wiretapping. Wiretapping can be accomplished by means of, for example, Internet Protocol Multicasting.
  • a means of identifying a consumer may be built into consumer electronic appliances in order to limit abuse of the network. Any number of means of identity may be used such as a Personal Identification Number or biometric means.
  • preferred embodiments thus provide the foundation for a multiservice switching architecture.
  • the architecture supports and extends all existing packet- and circuit-switched network architecture.
  • Transport can be reconfigured to the optimal combination of packet- and circuit-switching at any given point in time. That is, circuit switching has zero contention, zero congestion, low latency, in-order delivery of packets, zero packet loss and negligible jitter, whereas packet switching benefits from statistical multiplexing, always-on availability and ease of adoption of service innovations.
  • Preferred devices also enable layer 1 interworking between different networks.
  • control over switching resource partitioning enables multiple logical networks of different types to operate over the same physical network infrastructure (e.g. a LAN, a WAN, a SAN, etc.).
  • preferred devices also enable application of valuable network processing resources to be optimised.
  • the need for tunnelling, encapsulation, conversion etc. is reduced and/or eliminated.
  • Multicast transport of unpacketised, streaming data is also supported by preferred nodes.

Landscapes

  • Chemical & Material Sciences (AREA)
  • Engineering & Computer Science (AREA)
  • Organic Chemistry (AREA)
  • Oil, Petroleum & Natural Gas (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Chemical Kinetics & Catalysis (AREA)
  • General Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Water Supply & Treatment (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un noeud de communications permettant d'établir plusieurs liaisons distinctes du point de vue logique, parallèlement, via le noeud, avec un ou plusieurs autres noeuds distants. Ce noeud de communications comprend: un commutateur d'entrée; un commutateur de sortie; une pluralité de ressources de communications, couplées entre les deux commutateurs, comportant au moins des première et seconde ressources qui assurent différents services, à commutation de paquets et de circuits, entre autres; un dispositif de contrôle associé aux deux commutateurs, pour l'établissement de liaisons distinctes du point de vue logique, via le noeud, sachant que chaque liaison est configurable pour l'incorporation sélective de l'une ou l'autre des première et seconde ressources constituant au moins la pluralité de ressources susmentionnée.
EP02762619A 2001-10-04 2002-10-04 Noeud de communications Withdrawn EP1563653A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
GBGB0123862.5A GB0123862D0 (en) 2001-10-04 2001-10-04 Low latency telecommunications network
PCT/GB2002/004499 WO2003030448A2 (fr) 2001-10-04 2002-10-04 Noeud de communications

Publications (1)

Publication Number Publication Date
EP1563653A2 true EP1563653A2 (fr) 2005-08-17

Family

ID=34685099

Family Applications (1)

Application Number Title Priority Date Filing Date
EP02762619A Withdrawn EP1563653A2 (fr) 2001-10-04 2002-10-04 Noeud de communications

Country Status (7)

Country Link
EP (1) EP1563653A2 (fr)
JP (1) JP4189965B2 (fr)
CN (1) CN1736073A (fr)
AU (1) AU2002328165A1 (fr)
CA (1) CA2500167A1 (fr)
GB (1) GB0123862D0 (fr)
WO (1) WO2003030448A2 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8635347B2 (en) * 2010-01-26 2014-01-21 Ray W. Sanders Apparatus and method for synchronized networks
JP6006059B2 (ja) * 2012-09-18 2016-10-12 日本電気通信システム株式会社 クロスコネクト情報データベース構築方法及びクロスコネクト装置
US10028212B2 (en) * 2013-11-22 2018-07-17 Qualcomm Incorporated Techniques for provisioning configuration information based on cell characteristics
CN106301648B (zh) * 2015-06-29 2018-10-09 华为技术有限公司 时钟同步控制器、确定时钟同步链路的方法及系统
US10503690B2 (en) * 2018-02-23 2019-12-10 Xilinx, Inc. Programmable NOC compatible with multiple interface communication protocol

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4539676A (en) * 1982-05-03 1985-09-03 At&T Bell Laboratories Bulk/interactive data switching system
US5537403A (en) * 1994-12-30 1996-07-16 At&T Corp. Terabit per second packet switch having distributed out-of-band control of circuit and packet switching communications

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO03030448A2 *

Also Published As

Publication number Publication date
JP4189965B2 (ja) 2008-12-03
AU2002328165A1 (en) 2003-04-14
WO2003030448A2 (fr) 2003-04-10
GB0123862D0 (en) 2001-11-28
WO2003030448A3 (fr) 2003-10-02
JP2006501694A (ja) 2006-01-12
CA2500167A1 (fr) 2003-04-10
CN1736073A (zh) 2006-02-15

Similar Documents

Publication Publication Date Title
US6507577B1 (en) Voice over internet protocol network architecture
US7149210B2 (en) Wide area multi-service communications network based on dynamic channel switching
US7143168B1 (en) Resource sharing among multiple RSVP sessions
US5526352A (en) Integrated low complexity broadband multi-channel switch
EP1386455B1 (fr) Procede et appareil de realisation d'acheminement dans un reseau
US6253207B1 (en) Method and apparatus for transporting multimedia information over heterogeneous wide area networks
US6115373A (en) Information network architecture
JP3613464B2 (ja) Ｘｄｓｌベースのインターネットアクセスルータ
JP2005525025A (ja) パケット・カプセル化を用いたスイッチング・アーキテクチャー
US20070067487A1 (en) Communications node
JPH1132059A (ja) 高速インターネットアクセス
JP2004260832A (ja) Ｉｐアクセスネットワークにおいて保証サービス品質を伴うサービスを提供する方法
CA2317460C (fr) Prestation de politiques de services desirees aux abonnes accedant a l'internet
US7068594B1 (en) Method and apparatus for fault tolerant permanent voice calls in voice-over-packet systems
US7277944B1 (en) Two phase reservations for packet networks
CA2312056C (fr) Systeme de microcellules synchrones de canal de communications pour integrer la transmission par circuit et la transmission de donnees par paquets
JP4189965B2 (ja) 通信ノード
US7545801B2 (en) In-band control mechanism for switching architecture
US20060221983A1 (en) Communications backbone, a method of providing a communications backbone and a telecommunication network employing the backbone and the method
EP1478142A2 (fr) Allocation dynamique de queues de ré-assemblage
Chapman et al. Enhancing transport networks with Internet protocols
KR100596587B1 (ko) 이종망 연동 장치와, 그를 이용한 실시간 트래픽 변환 방법
Littlewood et al. Evolution towards an ATD multiservice network
Elsayed FUNDAMENTALS OF TELECOMMUNICATIONS

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20050428

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LI LU MC NL PT SE SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

DAX Request for extension of the european patent (deleted)
RIN1 Information on inventor provided before grant (corrected)

Inventor name: LEWIS, ROGER, WILLIAM, STUART

Inventor name: FREEBAIRN, NEIL

17Q First examination report despatched

Effective date: 20060517

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NETWORK INNOVATIONS LIMITED

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NETWORK INNOVATIONS LIMITED

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NETWORK INNOVATIONS LIMITED

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20091210