conventional multi - hop wireless networks have typically been created for low - capacity , delay tolerant , short - haul data transport to / from consumer electronics and local area network ( lan ) and wide area network ( wan ) operations . as such , known multi - hop wireless network standards include a number of characteristics which prevent the use of such multi - hop wireless networks in backhaul network design carrying delay sensitive circuit switched traffic . for example , conventional multi - hop wireless networks are based on data packet routing . consequently , each node in a multi - hop wireless network is effectively a router that parses each data packet it receives to determine the data packet &# 39 ; s ultimate destination and then re - transmits the data packet as required . the routing functionality requirement alone makes each node relatively complex . each node in a data packet &# 39 ; s path delays the arrival time of the data packet to its ultimate destination , since each node parses the data packet before it is re - transmitted . such delays are tolerated because the data carried on conventional multi - hop wireless networks is expected to be delay tolerant . when considering the applicability to backhaul network design , such delays are not acceptable since circuit traffic is sensitive to timing . a first embodiment of the invention provides a multi - hop wireless backhaul network , which preferably has a high capacity . the multi - hop wireless backhaul network is composed of a number of distinct types of network nodes which are hierarchically connectable . these different types of nodes are used to build emulated virtual circuits through the multi - hop wireless backhaul network , as described in detail below . these types of nodes consist of network access nodes ( nans ), aggregation nodes ( agns ) and base nodes ( bns ). in its simplest sense , a nan is the highest network node in the hierarchy . a nan has functionality beyond this which is included in some embodiments . for example , in some embodiments , each nan connects the multi - hop wireless backhaul network to another network , for example a metro network . each nan can form wireless connections to multiple bns and / or agns . there may be one or multiple nans in the multi - hop wireless backhaul network . because the nan is at the top of the hierarchy , it is a wireless end - point for any virtual circuits . the nan may or may not be a circuit end point for a given virtual circuit . more specifically , in some embodiments , each nan is a circuit emulation endpoint for virtual circuits formed within the multi - hop wireless backhaul network . for example , in embodiments in which the metro network is a circuit switching network , for example a tdm based network , the nan behaves as a circuit emulation endpoint , and has virtual circuit termination capabilities built in . in some embodiments , a given nan does not behave as a circuit endpoint for virtual circuits formed within the multi - hop wireless backhaul network , but instead incoming wireless traffic out a wireline port and vice versa on virtual circuits which pass through the nan . for example , in embodiments in which the metro network is a packet switching network , for example an ethernet based network , the virtual circuits have one circuit end - point point within the multi - hop wireless backhaul network , and a second circuit end - point outside the multi - hop wireless backhaul network . in its simplest sense , an agn is an intermediate network node in the hierarchy . one or more agns can be interposed between a bn and a nan . the closer , in terms of hops to a nan , an agn is the higher in the hierarchy of the multi - hop wireless backhaul network it is considered to be . the agns generally serve to aggregate and relay / amplify circuit traffic between network nodes in the up stream ( bn / agn towards nan ) and down stream ( nan towards bn / agn ) directions . in a system limited to a maximum of two hops , each agn connects one or more bns to a nan . in the event a larger number of hops are permitted , an agn connects one or more bns or agns below it in the hierarchy to one or more agns or nans above it in the hierarchy . an agn is not a circuit endpoint for circuit traffic that it is relaying on a circuit between a nan and a bn / agn or for traffic that it is aggregating from multiple bns / agns to a nan . that is , if an agn is interposed within a circuit between two other nodes ( e . g . a nan and a bn or another agn ), it is preferable that the agn simply switch the circuit traffic between the end - nodes of the circuit . the agns can add ( i . e . aggregate ) additional traffic in the up - stream direction and drop traffic from in the down - stream direction . agns interposed between two network nodes inherently increase circuit lengths , which can be advantageous for emulating long circuits and delivering circuit traffic to between circuit end - points that are far away from one another ( e . g . a nan and a distant bn ). in its simplest sense , a bn is a network node that is the lowest network node in the hierarchy . preferably , a bn serves as a circuit emulation end - point . bns are typically located at the periphery of the multi - hop wireless backhaul network . in operation , wireless connections between the various network node types are established in a hierarchical manner from each bn to a nan . this implies that each bn is connected to an agn or a nan directly , and each agn is also ultimately connected to a nan ; possibly through another agn . as indicated above , in some embodiments , multiple agn hops are implemented and in such cases an agn may be connected to another agn . in typical implementations , the distances between network nodes and available bandwidth will serve to limit the number of traffic carrying links any one network node can establish . for systems featuring multiple agn hops to connect a bn to a nan , the agns are also hierarchically arranged such that a given agn is only connectable to agns above it and agns below it in the hierarchy . there is no ambiguity as to whether an agn is upstream or downstream of another agn because the hierarchical connectivity precludes an agn being both upstream ( for one traffic flow ) and downstream ( for another flow ) of another agn . there are not any bn → bn traffic connections nor are there any nan → nan traffic connections . it is noted that in some embodiments , network nodes may communicate using service and maintenance channels to exchange operation and management ( oam ) information with one another , which is different from backhaul data traffic . the strict hierarchical topology does not necessarily need to be enforced for such communications . bandwidth is allocated hierarchically with network nodes higher in the hierarchy providing capacity to serve all connections for nodes lower in the hierarchy that depend on network nodes higher in the hierarchy . the nan downstream bandwidth of each nan is divided between any agns and / or bns to which it is connected . multiple different nans , in some instances , can provide bandwidth to the same set of agns and bns . similarly , the downstream bandwidth of each agn is divided between any agns and / or bns to which it is connected . in some embodiments , this bandwidth allocation is done dynamically by each nan and each agn . in such an embodiment , each nan dynamically allocates its downstream bandwidth between its dependent agns and / or bns , and similarly each agn dynamically allocates its bandwidth between its dependent bns and / or agns . an example of such an implementation is described in further detail below . each agn is responsible for dynamic bandwidth partitioning and priority scheduling in order to provide communication links ( paths ) for network nodes dependent on it ( e . g . bns or other agns ). agns that have multiple dependent network nodes aggregate traffic from these network nodes onto at least one up - stream link . in a preferred embodiment , the entire multi - hop wireless backhaul network is “ overlaid ” over an access network , for example a cellular wireless access network . in such an embodiment , the multi - hop wireless backhaul network provides backhaul connectivity for the access network . in such an embodiment , each bn is co - located with and connected to or integrated with a respective access network node of the cellular wireless access network , a cellular base - station transceiver for example . virtual circuits are established from each bn to or through a nan to transport traffic for the respective access network node ( s ). each bn is involved in circuit emulation for traffic entering and leaving the multi - hop wireless backhaul network through the access network node ( s ). in some embodiments , one or more agns may also be co - located or connected to a respective access network node ( s ) of the access network , such as a cellular base - station transceiver . such agns also serve as circuit end - points . such agns are involved in circuit emulation for traffic entering and leaving the multi - hop wireless backhaul network through the access network nodes . in some embodiments , a particular node may have two or more nodes connected above itself in the hierarchy . in such instances , each of the two or more nodes may each provide a portion of the total bandwidth allocated to the particular node . each node that provides bandwidth to the particular node is considered an active node . referring now to fig1 , shown is a block diagram of an example of a multi - hop wireless backhaul network , generally indicated by 200 , provided by an embodiment of the invention . the multi - hop wireless backhaul network 200 is made - up of a number of base nodes ( bns ) bn 1 101 , bn 2 103 , bn 3 105 , aggregation nodes ( agns ) agn 1 111 , agn 2 113 and network access nodes ( nans ) nan 1 121 , nan 2 123 , where “ bn 1 ”, “ bn 2 ”, etc . are identifiers of the network nodes within the multi - hop wireless backhaul network . together the bns , the agns and the nans are the constituent network nodes for multi - hop wireless backhaul network 200 . although a specific number and arrangement of bns , agns and nans are shown , it is to be understood that more generally any appropriate number of each type of node , appropriately arranged , could be present within a single multi - hop wireless backhaul system . as discussed above , some of the constituent network nodes may be co - located and connect to or integrated with access network nodes . with further reference to fig1 , as an example , bn 3 105 is shown to be co - located with base - station transceiver bts 2 106 . similarly , agn 2 113 is shown to be co - located with a bts 1 104 . it was also discussed above that nans are used to connect the multi - hop wireless backhaul network to another network or networks . with further reference to fig1 , nan 1 121 and nan 2 123 are shown to have core network connections 61 and 63 , respectively . these connections in the illustrated example are to a metro network . in a preferred embodiment , the nans are connected directly or indirectly to network element ( s ) ( such as a bsc / rnc ) responsible for managing the underlying access network and / or to network element ( s ) responsible for managing the multi - hop wireless backhaul network . the constituent network nodes that make - up the multi - hop wireless backhaul network 200 shown in fig1 set up backhaul connections according to the hierarchical topology described previously . the specific traffic carrying links ( a link is the same as a connection ) shown in fig1 will now be described in detail . active links are shown in fig1 using solid lines . circuits are shown in fig1 using bold solid lines . alternate links are shown in fig1 using dashed lines . the alternate links will be described in detail below together with the path healing embodiment . bn 1 101 has an active link 71 to the agn 1 111 . bn 2 103 has an active link 73 to the agn 2 113 . bn 3 105 has an active link 79 to the nan 2 123 . agn 1 111 has an active link 75 to the nan 1 121 . agn 2 113 has an active link 77 to the nan 2 123 . the active links 71 , 73 , 75 , 77 , 79 are used to carry circuit traffic to and from the respective network nodes they are associated with . one specific example set of alternate links is also shown in fig1 . the bn 1 101 is shown to have an alternate link 81 to the nan 1 121 . the bn 2 103 has an alternate link 83 to the agn 1 111 . the bn 3 105 has an alternate link 89 to the agn 2 113 . the agn 1 111 has an alternate link 85 to the nan 2 123 . the agn 2 113 has an alternate link 87 to the nan 1 121 . the alternate links 81 , 83 , 85 , 87 , 89 will be described in detail below together with an embodiment that also includes a method for full / partial path - healing . using the active links 71 , 73 , 75 , 77 , 79 circuits between pairs of constituent network nodes can be emulated . this means that dedicated virtual channels , within the active links 71 , 73 , 75 , 77 , 79 , are set - up to carry traffic between the circuit end - nodes . for example , as shown in fig1 , a first circuit 95 is shown between circuit end - nodes agn 2 113 and nan 2 123 . circuit traffic can be sent up - stream from the agn 2 113 to the nan 2 123 , and , down - stream from the nan 2 123 to the agn 2 113 co - located with the bts 1 104 . other network nodes ( e . g . bn 2 103 , bn 3 105 , agn 1 111 , and nan 1 121 ) that have active or alternate links with either agn 2 113 or nan 2 123 cannot infringe upon the bandwidth allocated for the dedicated virtual channel set up on active link 77 used in the emulation of circuit 95 during normal operation . in another example , a circuit 93 is shown between circuit end - nodes bn 1 101 and nan 1 121 . in this example , the circuit 93 requires that dedicated virtual channels be set - up on active links 71 and 75 , each of which has the agn 1 111 as an end - node . the dedicated virtual channels within the active links 71 and 75 provide enough bandwidth to support the circuit traffic between the bn 1 101 and the nan 1 121 . with respect to the circuit 93 , the agn 1 111 serves to relay / switch circuit traffic carried through the circuit 93 . the agn 1 111 is not used in the emulation of the circuit 93 , and preferably only acts as a relay / switching node for circuit 93 . the agn 1 111 may simultaneously act as and add / drop node for forwarding / adding backhaul traffic upstream originating from a co - located base - station ( not shown ) and dropping / delivering backhaul traffic to the co - located base - station from the nan 1 121 . as will be discussed in more detail further below , in order to enable the path - healing method , a given network node preferably maintains at least separate links above itself in the hierarchy . an active link with at least one of the two nodes hierarchically above is established and maintained . an active link may also be maintained to the second node in which case traffic up the hierarchy from the given node can be divided between the two nodes above . alternatively , the second node can be an “ alternate ” node meaning that in nominal conditions , traffic is not sent to the second node . connectivity with the alternate node is maintained on a “ keep alive ” basis to enable rapid re - configuration if the active node fails . the path healing method will be discussed in detail below . in a preferred embodiment , at least some of the management of the interconnection between network nodes in a multi - hop wireless backhaul network is distributed to the network nodes themselves . this will be referred to as topology management or tm functionality that is provided on each nan , agn and bn . the tm functionality may be provided in the form of a suitable combination of at least one of software , hardware and firmware residing in each network node . in some embodiments topology information is maintained at each constituent network node , for example by the above described topology management functionality . in some embodiments , each network node keeps a record of the entire multi - hop backhaul network &# 39 ; s connectivity , but at a minimum , the topology information contains an up - to - date record of a network node &# 39 ; s local connectivity . this hierarchical topology information may be maintained in any suitable form by each network node . in an example implementation , the hierarchical topology information is stored in a topology table that maintains a hierarchical view of other nearby network nodes . shown in fig2 a is a topology table containing an entire hierarchical topology view for the active links shown in the example provided in fig1 that could be maintained at a network topology manager . in some embodiments this type of hierarchical system view is also maintained within each network node . alternatively , the minimum required by each node may be maintained as shown in fig2 b , 2 c and 2 d which are example minimum active link topology information 40 , 42 , 44 for the bn 1 101 , the agn 1 111 and the nan 1 121 , respectively , which are provided and maintained within the bn 1 101 , the agn 1 111 and the nan 1 121 , respectively . as described above , each topology table maintains a hierarchical view of the multi - hop wireless backhaul network 200 from the perspective of the constituent network node on which the topology table resides . also shown are alternate link topologies 41 , 43 , 45 used in embodiments featuring path healing as described in detail below . in some embodiments an additional network management function is provided in the form of an element management system ( ems ). the ems may be implemented as a hardware / software component on a nan in the multi - hop wireless backhaul network . preferably , the ems resides on a an element external to the bns , agns and nans of the multi - hop wireless backhaul network , for example on a nan , a network topology manager or access network controller responsible for managing an underlying access network . in some embodiments , the ems is maintained in a centralized location , since such a location typically also houses logic ( hardware , software , firmware , etc .) for high - level control functions for an entire multi - hop wireless backhaul network . such a central location is also where backhaul traffic typically terminates into other communication systems , such as voice networks in pstn systems . in an alternative embodiment , the ems is located away from a multi - hop wireless backhaul network but connected to the highest levels of the hierarchy in the multi - hop wireless backhaul network . in such an embodiment , the ems still stores and maintains an up - to - date record of relevant network node connections and circuits in uses within the multi - hop wireless backhaul network , similar to the topology table shown in fig2 a . the ems can also be used for path reconfiguration . path reconfiguration might be performed to deal with long - term load balancing or to replace failed node / links . the ems is typically also responsible for high - level oa & amp ; m in the multi - hop wireless backhaul network , macroscopic radio resource management , interfacing to and configuration with core network nodes ( e . g . bsc , rna , metro connections , etc . ), protection configuration , fault and alarm management , performance management and configuration management . shown in fig3 is an example of where and how the ems might be located and configured in regard to the multi - hop wireless backhaul network 200 described previously with respect to fig1 . the nan 1 121 and the nan 2 123 of the multi - hop wireless backhaul network 200 are connected to a metro operator network 210 which is in turn connected to an access network controller 222 which also contains the ems 150 . the access network controller 222 performs control functions in respect of the underlying access network for which backhaul transport is being provided by the multi - hop wireless backhaul network . if the underlying access network is a cellular access network , the access network controller might be a base - station controller / radio network controller ( bnc / rnc ) 222 , which belongs to a wireless operator 220 . in the example of fig3 , the control function for the underlying access network is co - located with the high - level management function ems for the multi - hop wireless backhaul network . in other embodiments , the ems may be separately located . a communication network to which a multi - hop wireless backhaul network is connected to provides network access to various pre - determined amounts of bandwidth . in the example of fig3 , the communication network providing this bandwidth is a metro network 210 , but other types of networks may alternatively be employed . in some embodiments the predetermined amounts of bandwidth can range from fractional amounts of a t1 link , to multiple t1 links . in other embodiments the predetermined amounts of bandwidth can provided through at least one of oc - 3 and stm1 types of links . the bandwidth is first distributed among the nans of a multi - hop wireless backhaul network . the nans in turn dynamically allocate the bandwidth among agns and bns dependent upon them . in the example of fig3 , the communications network is a metro network . this might for example implement a traditional circuit switched function , ethernet private line or ethernet virtual private line . in a preferred embodiment , native ethernet is employed on the multi - hop wireless backhaul network and the communications network to which it is connected . this would allow backhaul traffic to pass through as being natively ethernet ready . in some embodiments , the network nodes like the agns and the bns described above have spatially switched antennas . each such network node has an antenna arrangement allowing transmission on a plurality of antenna beams that are each oriented in a different direction . any appropriate multi - beam configuration may be employed . these beams may be adaptively defined , statically defined , they may be statically shaped beams which are individually steerable , or formed by a beam steering array in which a fixed set of beams can be steered collectively to one of several discrete orientations . in a specific embodiment , each network node is implemented with a single switched transceiver design that employs time division multiplexing ( tdm ) to cycle through a number of spatially switched antennas at one network node . in such embodiments , a single nlos radio unit is required within each constituent network node , and this single radio unit enables dynamic bandwidth allocation at each constituent network node . the diagram provided in fig4 shows a very specific example of a multi - hop wireless backhaul network , generally indicated by 300 , for the purpose of illustrating how spatially switched antenna beam patterns can be employed in each of the constituent network nodes . the multi - hop wireless backhaul network 300 is made up of a nan 3 129 , an agn 3 119 , and bn 4 107 and bn 5 109 . again , although a specific number and arrangement of bns , agns and nans are shown , it is to be understood that more generally any appropriate number of each type of node , appropriately arranged , could be employed . the nan 3 129 has a fixed connection ( not shown ) to an external network ( not shown ) through which network access to the multi - hop wireless backhaul network 300 is provided . the nan 129 has three antenna beams 301 , 303 , 305 , which are constantly active ( in this example ), that project away from the nan 129 in order to transmit and receive signals from the area around the nan 129 . the nan 129 has multiple radios , for example , three that are connected to antennas that project antenna beams 301 , 303 , 305 on carrier frequency f 1 . the antenna beams 301 , 303 , 305 are appropriately chosen and configured to minimize interference between signals transmitted / received on each with respect to one another . the agn 3 119 , the bn 4 107 and bn 5 109 each project six spatially switched antenna beam patterns away from their location using a single radio ( per node ). as for the nan 3 129 , the agn 3 119 , the bn 4 107 and the bn 5 109 also transmit and receive on the carrier frequency f 1 in a tdm manner . thus , only one of the six spatially switched antenna beam patterns for each of the agn 3 119 , the bn 4 107 and bn 5 109 is active at one time . the bn 5 109 is shown to have an active spatially switched antenna beam ( lobe ) 311 that overlaps the antenna beam 301 of the nan 3 129 . when spatially switched antenna beams 311 and antenna beam 301 are both simultaneously active , backhaul link 51 is active , which means that backhaul traffic can flow between the bn 5 109 and the nan 3 129 in the up and down - stream directions . similarly , the agn 3 119 is shown to have active spatially switched antenna beams ( lobes ) 313 and 315 . it is to be understood that if tdm is employed , the spatially switched antenna beams 313 and 315 would not be active simultaneously . the agn 3 119 uses spatially switched antenna beam 313 to establish backhaul link 53 to the nan 3 129 when both spatially switched antenna beam 313 and antenna beam 305 are active simultaneously . as for backhaul link 51 , backhaul link 53 is used to transmit and receive backhaul traffic to and from the nan 3 129 . the bn 4 107 is shown to have an active spatially switched antenna beam 317 . the bn 4 107 is also shown to be outside the antenna beam patterns 301 , 303 , 305 of the nan 3 129 . as such , the bn 4 107 uses the agn 3 119 as a relay node to connect to the nan 3 129 . when spatially switched antenna beam patterns 315 and 317 are simultaneously active , backhaul link 55 is established between the agn 3 119 and the bn 4 107 . for the example shown in fig4 , each of the network nodes ( i . e . the agn 3 119 , the bn 4 107 and the bn 5 109 ) synchronize the manner in which they cycle through their respective spatially switched antenna beams . this synchronization is done so that the backhaul circuit links 51 , 53 and 55 can effectively and efficiently be used to transport backhaul traffic around multi - hop wireless backhaul network 300 . in some embodiments , each circuit emulated within the multi - hop wireless backhaul network terminates at a nan . the nan then ships the traffic to another communication network and / or an access network controller . this embodiment is appropriate where the communications network is a circuit switched network , for example a tdm based network . a system / mechanism is in place to enable the other communication network and / or access network controller to ascertain from where the traffic originated and to know where in the multi - hop wireless backhaul network to send traffic in the downlink direction . any appropriate system / mechanism can be used , and many such system / mechanisms are well known . in general , any of the approaches that have been used in the past for non - wireless backhaul networks can be adapted for use in a multi - hop wireless backhaul network provided by an embodiment of the invention . for example , in some embodiments , there is a dedicated high - capacity data channel ( physical or virtual ) for each emulated circuit from the terminating nan to another communication network and / or access network controller , for example a t1 , or multiple t1s . this might be tdm or packet over sonet / sdh ring for example . then , by transmitting the traffic received at a given nan on the appropriate dedicated high capacity date channel , the another communication network and / or access network controller is able to distinguish where the traffic came from without the need for additional labels or tags . in the downlink direction , traffic sent by the another communication network and / or access network controller into the multi - hop wireless backhaul network is addressed to a particular access network node connected to or integrated with a network node of the multi - hop wireless backhaul network . once again , a dedicated high - capacity data channel can be established for the traffic of a given access network node . the high - capacity data channel links the another communication network and / or access network controller through to the appropriate nan , which is then forwards the traffic on an appropriate virtual circuit to the appropriate network node . in some instances , backhaul circuit emulation requires the definition of multi - hop circuits in which intermediary network nodes ( e . g . agns ) are placed between two respective circuit end - nodes to relay / amplify circuit traffic in the up and down stream directions . these embodiments include add / drop aggregation and / or relaying functions for multi - hop operation incorporated into a single switched transceiver design including a number of spatially switched antennas , which was described above . in another embodiment , the virtual circuits do not terminate in the nan , but rather terminate outside the wireless multi - hop backhaul network . this approach is appropriate for applications where there is a packet based metro network for example . as an example , referring to fig3 , if the metro operator network 210 is a packet based network , a first virtual circuit can be established from bn 1 105 through the multi - hop wireless backhaul network 200 , and through the metro operator network 210 all the way to the access network controller 222 . this eliminates a significant amount of hardware in the nan if circuit emulation termination does not need to be performed there . in one embodiment , ethernet is used as the packet protocol on both the multi - hop wireless backhaul network and the metro operator network . in such embodiments , capacity on the metro operator network 210 might be leased ethernet - based capacity implementing a virtual private lan . protection switching which might occur for the virtual circuits outside the multi - hop wireless backhaul network can be performed using conventional means and is outside the scope of this invention . as an example of how layer 2 switching might be performed for the ethernet example , an ethernet bridging table may be maintained in each bn , agn , and nan . ethernet bridging tables are well known . however , in this example , the bridging tables have two different types of entries , one being for wireless links , and the other type being for wireline links . table 1 below is an example of an ethernet bridging table for application in a bn , agn or nan . the bridging table has a column for a destination address of each circuit being emulated , for example a mac address . in the ethernet implementation , this might be an ethernet address . the second column contains an egress wireless link identifier , and the third column contains an egress wireline link identifier . for a given circuit emulated packet flow in a given node , it will have only one of the wireline link identifier and the wireless link identifier . the wireless link identifier is any identifier allowing the packet to be switched locally out the correct wireless link and time slot . it might be a port identifier for example . in some implementations , wireless ports and time slots may have associated link identifiers . similarly , the wireline link identifier is any identifier allowing the packet to be switched locally out the required wireline link . for the nan , the wireline link will be towards the external network . for the agn or bn , a wireline link would be provided to the locally connected / integrated access network node . this might be a link identifier representation of a t1 port for example in a bn ( or an oc - 3 port at an agn ). layer 2 switching is performed by performing table lookup upon receipt of a packet at the node . another example of circuit emulation is shown in fig1 . a given circuit will have two network nodes serving endpoints . in the example , the endpoints of virtual circuit 611 are bn 6 600 and nan 4 602 , and the virtual circuit also passes through agn 4 620 . the bn 6 600 delivers traffic 606 and receives traffic 604 from an access network ( not shown ). the traffic can be in any suitable delay sensitive form , for example but not limited to t1 , t3 , oc - 3 , stm - 1 . similarly , nan 4 602 delivers traffic 608 to and receives traffic 610 from a communications network to which the nan 4 602 is connected ( not shown ). again , this traffic can be in any suitable delay sensitive form . the bn 6 600 performs packetization 612 of incoming frames into a packet format for transmission over the multi - hop wireless backhaul network over the circuit 611 . this can be any suitable connection oriented packet based transport , for example but not limited to atm ( asynchronous transport mode ), a connection oriented ip ( internet protocol ), ethernet , frame relay , etc . the bn 6 600 also performs de - jittering 614 for traffic received from the multi - hop wireless backhaul on circuit 611 . similarly , nan 4 602 performs a de - jittering operation 616 for traffic it receives from bn 4 600 over the circuit 611 via the multi - hop wireless backhaul , and performs packetization 618 for traffic received from the communications network for transport over the circuit 611 . some , but not necessarily all emulated circuits will have one or more ( preferably at most one ) intermediate nodes , referred to as agns above . the example of fig1 shows a single agn 620 . the agn 620 operates in the domain of the switched packet based transport used on the multi - hop wireless backhaul network . for intermediate nodes , packets received from network nodes hierarchically below are simply forwarded on upwards in the hierarchy . similarly , packets received from network nodes hierarchically above are forwarded on below in the hierarchy . in the illustrated example , packets received by agn 4 620 from the bn 6 600 are simply forwarded on towards the nan 4 602 . similarly , packets received by the agn 4 620 from the nan 4 602 are simply forwarded on towards the bn 6 600 . if the agn 4 620 supports multiple nodes below , then the agn 4 620 performs an aggregation function of all traffic received , and forwards this on to the active node above . similarly , the agn 4 620 performs a de - aggregation / dropping function to divide traffic received from above to be transmitted on the appropriate link below . preferably , the agn 4 620 performs switching at layer two , for example ethernet layer two switching . in a preferred embodiment , mimo ( multiple input multiple output ) ofdma ( orthogonal frequency division multiplexing access ) is employed for the physical layer in the multi - hop wireless backhaul network . one specific example of a physical layer structure based on mimo ofdma is shown in fig1 . the structure shows a 10 ms frame with time measured on the vertical axis 1106 , and frequency measured on the horizontal axis 1108 . the frame consists of a series of ofdm symbols each containing a set of ofdm subcarriers , collectively occupying 10 ms . the first two symbols 1110 , 1112 are shown to contain only preamble 1102 content . this is followed ( in time ) by a series of ofdm symbols 1114 that consist of channel data and pilot symbols 1100 . in the illustrated example , a defined layout of subcarriers , and ofdm symbols together defines a set of channels 1 to n 1104 . the frame ends with two more symbols 1116 , 1118 containing more preamble content 1102 . a bn transmitting and receiving such a structure synchronizes to either a nan or agn hierarchically above itself based on the preamble for initial system access . preferably , low overhead pilots are used for phase tracking and channel tracking , and in some embodiments these are designed to support mimo as described in further detail below with reference to fig1 . this combination of fdm / tdm allows matching of t1 traffic flow with minimum queuing delay . the physical layer selects the appropriate modulation and coding format based on channel conditions . thus a single t1 link may require different bandwidth allocations / assignments depending upon the channel conditions . a very specific example of a physical layer structure has been provided . other mimo ofdma structures may alternatively be employed , or other structures which are not based on mimo ofdma may be employed for the physical layer . referring now to fig1 , shown is an example of spatial antenna processing employing mimo , preferably employed in a multi - hop wireless backhaul network . shown is a multi - element transmitter 1202 and a multi - element receiver 1208 . the multi - element transmitter 1202 has a set of 1 to n t transmit antennas 1204 , 1206 . preferably , these are spatially oriented in sets of pairs of dual polarizations . single antennas may alternatively have dual polarization capability . for a given time slot , the multi - element transmitter 1202 transmits on one pair of antennas ( or the single antenna ). quadrature amplitude modulation ( qam ) symbols 1214 are transmitted on each antenna of the pair . preferably , preferably space - time encoding is also employed to generate space - time symbols 1216 that contain respective content for transmission on each of the pair of antennas . the multi - element transmitter 1202 has downstream channels 1220 . the capacity required for these channels is assigned to the mimo ofdma physical layer , for example as described previously with reference to fig1 . the space time symbols 1216 thus generated are transmitted over the air and effected by the wireless channel having mimo channel matrix h 1218 , and are then received by 1 to n r antennas 1210 , 1212 of the multi - element receiver 1208 which performs mimo decoding and extracts the channels 1222 . in a preferred embodiment , 18 mhz bandwidth is provided for the uplink and the downlink , and an uplink , downlink separation of 42 mhz is employed . of course , other values can be employed . preferably , the bns and agns have directional switched 6 - beam antennas , and mimo is employed with polarization diversity . preferably the nan has a tri - sectored design , and mimo with polarization diversity is again employed . the tri - sectored design for the nan requires three transceiver chains whereas the bns and agns can each be implemented with a single transceiver chain . in a preferred embodiment , each constituent network node dynamically allocates network resources ( e . g . bandwidth ) to network nodes below and dependent on it in the hierarchy . more particularly , bandwidth is allocated to guarantee a minimum required bandwidth for dependent network nodes below , based on current traffic requirements . any excess bandwidth available after allocating these minimum required bandwidths is then available to support delay tolerant traffic , subject to “ best effort delays ” if the excess bandwidth is required for delay sensitive traffic . each circuit supported in by a network node requires a respective allocation of bandwidth . the actual allocation of bandwidth is made after a determination of the required throughput for each circuit and the mapping is performed at the physical layer . in some embodiments the result is that a multi - hop wireless backhaul network will support bandwidth - on - demand in which resources can be re - distributed to handle actual traffic requirements from the constituent network nodes . a multi - hop wireless backhaul network that uses dynamic bandwidth management as provided by embodiments of the present invention is capable of automatically adapting for / to increased transmission bandwidth in the air interfaces to accommodate for network growth . with respect to the discussion of the physical layer above , the type of bandwidth that is allocated is determined on an implementation specific basis . in a preferred embodiment , the air interface uses ofdm ( orthogonal frequency division multiplexing ), and the bandwidth allocations comprise an appropriate allocation of ofdm sub - carriers , time slots , modulation and coding sets . in other embodiments , the air interface uses cdma - based signals , and the bandwidth allocations comprise a spreading code or a set of spreading codes . other air interfaces may alternatively be employed , given that they accommodate the data rates sought . bandwidth is allocated at the nan level . the available bandwidth depends on the capacity of a given nans network connections . a given nan will allocate a bandwidth to each agn and each bn connected to below it in the hierarchy . then , each agn connected below will have that allocated amount of bandwidth to allocate to any agns or bns connected below it in the hierarchy . in this way , any bandwidths allocated lower in the hierarchy are guaranteed all the way up to the top of the hierarchy . fig5 shows an example of a bandwidth allocation for part of the multi - hop backhaul network illustrated in fig1 , and more particularly for the part of the network below nan 2 123 in the hierarchy . the bandwidth allocation by nan 2 123 is indicated generally at 30 . a portion of bandwidth 31 is allocated for agn 2 113 , and a portion of bandwidth 32 is allocated for bn 3 105 , these being the only active agns or bns directly below nan 2 in the hierarchy . the left over bandwidth 33 , or “ excess bandwidth ” may be made available for delay tolerant traffic . the bandwidth allocation by agn 2 113 is indicated generally by 40 . the amount of bandwidth available for allocation by agn 2 113 is the same as the amount 31 allocated to agn 2 113 by nan 2 123 . the allocation shows a bandwidth portion 34 allocated for bn 2 103 , and excess bandwidth 35 . the excess bandwidths , for example resources 33 , 35 in the example above , are available to accommodate new connections should they be required . in another embodiment , excess bandwidth can be re - distributed to the existing dependent network nodes below in the hierarchy . in other instances a particular network node may be allocated bandwidth from multiple other network nodes above it is the hierarchy . in such cases the total available bandwidth for a particular network node is greater than any one allocation from the multiple other network nodes above it is the hierarchy on which the particular network node is dependent . fig6 is a flow chart illustrating a method of topology discovery and maintenance for dependent network nodes provided by an embodiment of the invention . the method includes initial ranging for the discovery of other adjacent constituent network nodes belonging to the multi - hop wireless backhaul network as well as a periodic ranging used to maintain up - to - date knowledge of the multi - hop wireless backhaul network . for a network node initially accessing a multi - hop wireless backhaul network , a first step 6 - 1 is to perform ranging to establish a view of the local topology of the multi - hop wireless backhaul network . network nodes hierarchically above the network node are sought and found during topology discovery . the purpose of topology discovery is , of course , for a network node to find another network node from which access to communication bandwidth can be allocated . in specific embodiments in which each network node includes a number of spatially switched antennas , each spatially switched antenna remains active / operable for a period of time during which signals from hierarchically higher network nodes can be received on a particular spatially switched antenna . in some embodiments pilot signals are transmitted by each network node such that network nodes hierarchically below can detect network nodes above themselves in the hierarchy . in such embodiments the received pilot signals may vary in received strength due to antenna switching at the hierarchically higher network node ( e . g . an agn or an nan ) and the network node doing the ranging , since the best transmit and receive antennas may not be active simultaneously for both network nodes . accordingly , in some embodiments , the network node doing the ranging is configured to dwell on each of its spatially switched antennas for a time longer than during normal operation to sufficiently determine another network node &# 39 ; s best antenna beam on which to possibly establish a communication link . in some embodiments it is preferable for pilots signals to uniquely identify each network node that is capable of allocating communication bandwidth to other network nodes , at least as far as such adjacent network nodes can be distinguished from one another . the pilot signals can be transmitted continuously or intermittently . a dwell time or period that a network node uses for ranging on each of its spatially switched antennas is preferably long enough to overcome the impact of fading and other channel distortions . alternatively , if there is an extrinsic need to keep this period short , it is preferable that the spatially switched antennas are cycled through numerous times so that accurate channel information can be gathered and accounted for in the ranging process . signals from network nodes that can provide another network node access to communication bandwidth are ranked based on the received pilot signal strengths of each at the network node trying to find such a network node . each such network node preferably is also associated with one position of the network node &# 39 ; s spatially switched antenna on which the best signal measurements are taken for a particular network node transmitting pilot signals . in some embodiments periodic ranging , which is discussed in detail below , is then only carried out on an ongoing basis for the spatially switched antennas receiving the best pilot signals . in other embodiments the network node doing the ranging adapts the time spent evaluating signals received at each spatially switched antenna so that more time is spent on the spatially switched antennas receiving the strongest pilot signals . at a second step 6 - 2 , using the results of the initial ranging carried out in step 6 - 1 , the network node doing the initial ranging updates its own topology table with chosen active and alternate network nodes . the active and alternate network nodes are selected as a function of the initial ranging results . an example method of selecting these is described below with reference to fig7 . this information may also be sent upstream from the network node to update an ems or network topology manager after an active link is established to a selected network node from which pilot signal are received . at a third step 6 - 3 the network node commences actual backhaul traffic communication on at least one active link established with another network node above it in the hierarchy . at a fourth step 6 - 4 the network node perform periodic ranging during which received pilot signals are measured from the network nodes that have been used to establish active and alternate links . one purpose of periodic ranging is for a network node to maintain accurate frequency and timing synchronization with other network nodes it has established alternate links with , so that the respective alternate links are kept in a ready - to - use state . an example of periodic ranging is described below with respect to fig8 . in some embodiments periodic ranging is also used to maintain frequency and timing synchronization between a network node and the other network nodes with which the network node has established an active link . at step 6 - 5 , the network node determines whether or not the received pilot signals from each network node ( to which an active or alternate link has been establish ) are below a threshold . more generally , a determination is made as to whether each alternate link is still satisfactory for its purpose . if the pilot signals are above the threshold ( no path , step 6 - 5 ) then the network node continues through steps 6 - 4 and 6 - 5 . on the other hand , if a received pilot signal from a given network node is below the threshold ( or fails some other condition ) ( yes path , step 6 - 5 ) it is assumed that there is a node failure . the network node then proceeds to step 6 - 6 in which a path - healing protocol is activated . the path - healing protocol is described in more detail below with reference to fig9 a and 9b . after step 6 - 6 the method starts again at step 6 - 2 . if the failure occurred at a network node providing an alternate link , then circuit traffic may not have been interrupted . however , if the failure occurred at an active node , circuit traffic from the child node would most certainly have to be re - routed . shown in fig7 is a flow chart depicting a method of network topology discovery and commencement of backhaul link use provided by an embodiment of the invention . the method depicted in the flow - chart is preferably employed by a network node that is either new to a multi - hop wireless backhaul network or by a network node that is being re - started . the method depicted in this flow - chart is similar to the steps 6 - 1 to 6 - 3 , and those skilled in the art would appreciate that the methods depicted in fig6 and 7 could be combined without departing from the scope of the invention . with further reference to fig7 , a first step 7 - 1 is the power - on of a network node . then at step 7 - 2 the network node attempts to identify at least two network nodes above itself in the hierarchy , which are ranked in order of preference . it is possible that some network nodes will only find one such network node . at step 7 - 3 and 7 - 4 the network node performs initial ranging with the second best and then best discovered nodes , respectively . the initial ranging is preferably carried out to obtain accurate frequency and timing synchronization as well as to set - up communication and service ( and maintenance ) channels . after the initial ranging with the best network node is complete , the network node enters the multi - hop wireless backhaul network at step 7 - 5 via the best network node it discovered . at this point , the multi - hop wireless backhaul network is aware of the new network node , and central communications elements such as the ems are now aware of it . the network node waits at step 7 - 6 for an acceptance message from the best network node it discovered . in some instance the acceptance message is in the form of a map , which is discussed in more detail below . the map carries with it a dedicated resource ( i . e . bandwidth ) assignment ( e . g . frequency , time - slots , scheduling information etc .) that enables the flow of backhaul traffic between the network node and the best node above . once the map is received by the node the node then has an active link on which backhaul traffic can be transported to and from the node . there is normally no backhaul traffic transported on an alternate links between network nodes . however , in some embodiments a periodic ranging is performed so that the alternate link can be maintained . periodic ranging between the two network nodes on opposite ends of an alternate link maintains accurate frequency and timing synchronization so that the alternate link is kept in a ready - to - use state . for embodiments featuring spatially switched antennas , it is preferable that the periodic ranging is performed by each pair of network nodes ( having an alternate link ), when their spatially switched antennas are best positioned and active with respect to one another . for example , with further reference to fig4 , the bn 4 107 preferably performs a periodic ranging procedure on a pilot signal sent from the agn 3 119 when antenna beams 317 and 315 are both on simultaneously . on the other hand , periodic ranging would occur between the nan 3 129 and the agn 3 119 when antenna beam 305 and spatially switched antenna beam 313 are both active simultaneously . in multi - hop wireless backhaul networks featuring spatially switched antennas on a single frequency in tdm , for example , the multi - hop wireless backhaul network 300 shown in fig4 , multiple ranging operations may occur simultaneously so long as they do not conflict with each other . for example , periodic ranging for the agn 3 119 can only happen with one of the bn 4 107 and the nan 3 129 at a time . however , periodic ranging between the nan 3 129 and the bns 109 can occur simultaneously with periodic ranging between the agn 3 119 and the bn 4 107 . shown in fig8 is an example of a timing diagram depicting a signalling exchange for a network node bn 24 having active and alternate network nodes . the bn 24 has a signalling timeline 295 , the active node has a signalling timeline 293 and the alternate node has a signalling timeline 291 . the active node schedules and provides transmission time slots ts 1 , ts 2 , ts 3 , ts 4 to the bn 24 . during the transmission time slots ts 1 , ts 2 , ts 3 , ts 4 the active node and the bn 24 transmit and receive backhaul traffic from one another . outside of the transmission time slots ts 1 , ts 2 , ts 3 , ts 4 the active node and the bn 24 do not communicate with one another and the bn 24 is generally prohibited from contacting its active node . however , the bn 24 is generally free to communicate with other nodes . in some embodiments of the invention network nodes , such as the bn 24 , use the time outside the transmission time slots provided by active nodes ( e . g . ts 1 , ts 2 , ts 3 , ts 4 ) to autonomously perform periodic ranging with alternate nodes . as noted above , a network node will perform an initial ranging with its alternate node ( s ) hierarchically above it . to achieve the periodic ranging function , the alternate node will be aware of the node and provide ranging time slots in which the alternate node expects periodic ranging requests from the particular dependent network node . in some embodiments the ranging time slots will include pilot signals that the network node can measure as well as a service channel through which maintenance signalling is enabled . for example , as shown in fig8 , the bn 24 transmits a ranging request 401 to its alternate node during a ranging time slot rs 1 provided by the alternate node . in the example shown in fig8 , a ranging response 403 from the alternate node is transmitted in a next ranging time slot rs 2 which follows transmission time slot ts 2 . the response contains frequency and timing information . in other scenarios a ranging response is transmitted by the alternate node before transmission time slot ts 2 either within ranging time slot rs 1 or in another ranging time slot ( not shown ) provided by the alternate node . after transmission time slot ts 3 and during a ranging time slot rs 3 ( provided by the alternate node ) the bn 24 responds to the alternate node &# 39 ; s previous ranging response 403 with a ranging response 405 confirming frequency and timing information . the ranging response 405 is used to confirm ( or not ) that the ranging response 403 was received and that the bn 24 has updated its frequency and timing synchronization with the alternate node . in a subsequent ranging time slot rs 4 the alternate node sends a ranging complete message 407 to the bn 24 to confirm that frequency and timing information is correct . if it is not correct the process continues in subsequent ranging time slots . the ranging response 407 is used to confirm ( or not ) that the ranging response 405 was received and that the alternate node has updated its frequency and timing synchronization with the bn 24 . alternatively , if either the ranging response 405 or 407 indicated that either the bn 24 or the alternative node did not receive an appropriate response or complete their respective synchronization procedures , then the process of periodic ranging would continue until both the bn 24 and the alternative node were satisfied . for embodiments in which some network nodes include spatially switched antennas in the bns and / or the agns , tdm scheduling needs to be performed in order that the various network nodes are looking at each other at the same time , and sending / receiving data to / from the appropriate other network node at the right time . any method of scheduling can be employed which achieves this effect . two specific scheduler implementations are described herein by way of example . scheduling is performed within the multi - hop wireless backhaul network in such a manner that each of the active connections is allocated the required amount of bandwidth . as indicated above , preferably , this bandwidth is dynamically allocated . this dynamic allocation of bandwidth can be performed at the ems , or alternatively , the dynamic allocation function can be distributed to the network nodes in the network . in a first embodiment , a scheduler is provided which provides a top - level overall scheduling operation . this scheduler might for example be part of the previously discussed ems . the scheduler has an understanding of the bandwidth required on each connection and makes resource assignments on the basis of these requirements . on the basis of this , resource assignments are generated by the scheduler . a resource assignment is based on the network topology , the traffic load and channel conditions of link between each network node and network nodes that are dependent on it . in an example implementation , this assignment indicates the following information : a ) for traffic : the network node ids of a connection , the time period of communications for these two network nodes , the code and modulation scheme and transmission power , etc . preferably , the scheduler also takes care of scheduling periodic ranging operations discussed above . in this case , the scheduling operation also includes : b ) a ranging window assignment which to a given network node when it should be available for ranging requests . the following is an example of a resource assignment message which might be sent to all network nodes by the ems for example , where t1 , t2 etc . indicates a tdm slot or slots for scheduling the particular traffic , mcs is a particular coding and modulation scheme , and txp is a particular transmit power . of course , different or additional parameters can alternatively be employed in the resource assignment message . agn 1 & lt ;-& gt ; bn 2 : t3 , mcs and txp ( for both directions ) agn 2 & lt ;-& gt ; bn 1 : t4 , mcs and txp ( for both directions ) agn 1 & lt ;-& gt ; bn 1 : t5 , mcs and txp ( for both directions ) agn 2 & lt ;-& gt ; bn 2 : t6 , mcs and txp ( for both directions ) in another embodiment , the scheduling is performed in a distributed manner . each node has a scheduler , for example as part of the previously described topology manager . preferably , for a given connection , the node which is higher in the hierarchy determines the following information : a ) for traffic , the resource assignment for communication with all nodes connected below includes the time period , code and modulation scheme and transmission power , etc . b ) in embodiments employing periodic ranging , the resource assignment includes a ranging window to enable periodic ranging with nodes who select this node as their alternate parent node . this is sent in a message or messages , and preferably a protocol is executed in order to accept and or re - negotiate the proposed schedule as required . the distributed scheduling approach is more dynamic and changes may be completed faster in situations such as when path reconfiguration commands needs to occur . the following is an example of messaging which might take place in a distributed scheduling operation , where the parameters are the same as described previously for the centralized scheduler : agn 1 & lt ;-& gt ; bn 2 : t3 , mcs and txp ( for both directions ) agn 1 & lt ;-& gt ; bn 1 : t5 , mcs and txp ( for both directions ) agn 2 & lt ;-& gt ; bn 1 ; t4 , mcs and txp ( for both directions ) agn 2 & lt ;-& gt ; bn 2 : t6 , mcs and txp ( for both directions ) as discussed previously , in another embodiment , a multi - hop wireless backhaul network is provided which has a path - healing capability enabling rapid reconfiguration of virtual circuit connections , in the event of link and / or network node failure and / or for load - balancing . it was also discussed previously that emulated circuits are established between pairs of circuit endpoints , and alternate connections are maintained using periodic ranging and signalling . in some embodiments , the additional nodes above in the hierarchy are used to define , for one or more and preferably all of the active links , a respective “ alternate link . a set of example “ alternate links ” are shown in fig1 using dashed lines . alternate links can be described as keep - alive channels . backhaul data is not regularly transmitted on the alternate links as long as the corresponding active links are operational and provide enough bandwidth for the respective network nodes they are associated with . that is , the alternate links are used as hot - standbys , onto which backhaul traffic can be re - routed , in the event that any of the active links fail , or if extra bandwidth is needed . in some embodiments , critical bandwidth may be pre - allocated for alternate links as needed in order to ensure that alternate links have some bandwidth in the event of a failure . alternate link information is preferably maintained in a similar form to the previously discussed active link information , as part of the topology information , for example maintained by the topology manager . returning again to the topology tables shown in fig2 b , 2 c and 2 d , the topology information for alternate links is generally indicated at 41 , 43 , 45 respectively for the bn 1 101 , the agn 1 111 and the nan 1 121 , respectively , of fig1 . each network node needs to know when to transmit and to whom . as indicated above , this can be scheduled by a centralized scheduler or in a distributed manner by schedulers on individual nodes . for example , a bn knows when to transmit on an active link and when to perform periodic ranging on an alternate link , and on which spatially switched antennas . an agn knows when to transmit on active and alternate links below it in the hierarchy , and when to transmit on active and alternate links above it in the hierarchy . finally , for the nan , for each sector the nan knows when to communicate with network nodes below it in the hierarchy . in the event of a failure of a bn , there is not much that can be done as that is at the bottom of the hierarchy , at least in the context of path healing . nodal redundancies can be employed to provide a healing capability for failed bns . in the event of a failure of an agn or nan , path healing can be employed . by virtue of the design of the multi - hop wireless backhaul network embodiment featuring alternate links , a network node whose normal active link has been cut off will be able to communicate at least for the purpose of signalling on the alternate link . in a first embodiment , the path healing is implemented centrally in conjunction with the previously described centralized scheduler . in this embodiment , after a failure is detected , the centralized scheduler is informed of this fact , and the entire resource assignment is re - worked as necessary in order to provide capacity to replace the capacity of the failed active connection ( s ). in a preferred embodiment , only a network node in the hierarchy above where the failure occurred reports the failure . thus , a nan would report the failure of an agn or bn directly below it ; an agn would report the failure of an agn or bn directly below it . if a nan fails , the ems should be able to detect this . in another embodiment , the path healing is implemented in a distributed manner . the following is an example of a distributed process to implement path healing : i . a network node ( agn or nan ) above the failed agn / nan detects failure of the agn / nan ; ii . a network node detecting the failure informs the rest of the multi - hop wireless backhaul network of the failure to the extent it can . in this distributed approach this step may not be necessary in view of step 3 below . however , performing step 2 will allow other network nodes in the multi - hop wireless backhaul network to anticipate the need to establish new active links to the orphaned network node below the failed network node ; iii . each network node below the failed agn / nan ( bns or agns ) attempts to establish a traffic connection over its alternate connection . this involves a negotiation over the existing signalling bandwidth between schedulers on two sides of the alternate connection to agree upon scheduling constraints for the traffic , for example bandwidth , and time slots for the traffic . in preferred implementations , the higher a given network node is in the hierarchy , the higher the priority is in negotiating scheduling constraints . the hierarchically higher network node may be allowed to dictate the scheduling in some embodiments . this is because a network node higher in the hierarchy ( for example an agn or nan ) will have less scheduling flexibility than a network node lower in the hierarchy ( a bn ). if the network node at the opposite end of the alternate connection is not a nan , then the additional traffic also needs to be scheduled from that network node on up through the hierarchy . this may simply involve negotiating an increase in the bandwidth an existing active connection . iv . once these bandwidths are configured / scheduled , the virtual circuit will have moved from its original path to a new path and traffic can flow on the new path . the negotiated bandwidths are preferably large enough to implement completely the bandwidth of any virtual circuits which passed through the failed node . in the event there is insufficient bandwidth to achieve this , preferably a partial - healing solution is provided in which a reduced bandwidth is provided for the virtual circuit which allows at least signalling communication , and preferably provides a virtual channel for delay sensitive traffic . referring again to the example of fig1 , one specific example set of alternate links is also shown in fig1 . the bn 1 101 is shown to have an alternate link 81 to the nan 1 121 . the bn 2 103 has an alternate link 83 to the agn 1 111 . the bn 3 105 has an alternate link 89 to the agn 2 113 . the agn 1 111 has an alternate link 85 to the nan 2 123 . the agn 2 113 has an alternate link 87 to the nan 1 121 . in an example of the use of alternate links , in the event that agn 1 111 fails completely or is forced to re - distribute bandwidth available to it , such that circuit 93 is no longer operable , the bn 1 101 could switch to its alternate link 81 to establish a circuit 91 with the nan 121 . having the option to switch to the circuit 91 from the circuit 93 provides the bn 101 with the ability to re - route its circuit traffic . in some embodiments , backup circuits , for example circuit 91 , are pre - established as part of the path - healing mechanism . in other embodiments , circuit 91 would not be established until the failure occurs . the topology information , and the ems , discussed previously , can be advantageously used by embodiments of the invention providing the path - healing method . the ems can also be used for path reconfiguration to deal with network node failures and long - term load balancing . the ems can instigate path healing for load balancing , whereas local nodes typically instigate path healing in the event of failures . fig9 a shows a flow - chart depicting a method of path - healing provided by an embodiment of the invention . starting at step 9 - 1 , it is to be understood to this point that during normal operation each network node measures signal strength from other network nodes from which signals are received . in some embodiments pilot signals are used for this purpose . if the signal strength ( e . g . of a pilot signal ) from a network node is below a threshold the network nodes having links to it that would be measuring the signal strength assume that the network node has failed . in other words nodes assume a failure has occurred at a network node that they had a communication link with if the signal from the presumably failed node is below a threshold or if some other failure condition occurs . at step 9 - 2 the failure detected at step 9 - 1 is reported around the multi - hop wireless backhaul network . if the failed network node had an active link to a network node below it , the network node below would have detected the loss of service ( i . e . the failure ). however , preferably , the network node hierarchically below does not immediately attempt to report failure . instead , an active network node hierarchically above the failed network node signals a network topology manager , such as an ems , to indicate that one of the network nodes below itself in the multi - hop wireless backhaul network has failed . the network topology manager then informs the entire network , for example by sending a broadcast message through the multi - hop wireless backhaul network on all operating active links for a first duration of time ( e . g . 20 ms ). if the active network node hierarchically below the failed network node does not detect the broadcast message sent through the multi - hop wireless backhaul network , the network node then proceeds to report the failure of its active parent node . the network node does so by reporting the failure of its active node to its alternate node . in some embodiments this occurs during a subsequent ranging time slot provided by the alternate to the particular network node . the alternate node then updates the network topology manager . there is the possibility that all listed active and alternate nodes above a given network node have failed . in this scenario the network node can try to re - enter the multi - hop wireless backhaul network as if it were a new node . if no alternatives are available for a new connection , communication to / from that network node is lost until the at least one of the network nodes above is repaired . through the process of reporting in step 9 - 2 the network node failure ( s ) the information needed to isolate the failed network node ( s ) eventually reaches the network topology manager . as described above , a network topology manager ( e . g . an ems ) operates during normal conditions to keep and up - to - date record of all active links and circuits through out the multi - hop wireless backhaul network . thus , at step 9 - 3 , the network topology manager reviews its latest record of known active links and circuits to isolate the failed network node . the network topology manager then acts to identify alternate links around the failed node . with an updated view of the multi - hop wireless backhaul network the network topology manager initiates the partial / full path healing of the multi - hop wireless backhaul network at step 9 - 4 . alternate nodes are switched to active nodes status as required and available bandwidth is dynamically re - allocated to re - establish communications . the affected network nodes update their own topology tables and respond accordingly to dynamically re - allocate resources available to them . in some embodiments highest - priority traffic is taken care of first with the possibility that lower priority traffic is dropped . as such , critical circuits and traffic are preferably not lost . fig9 b shows a signalling diagram illustrating circuit connections , and signalling exchanges as an example of a network node failure within a multi - hop wireless backhaul network and the subsequent application of the method path - healing described with respect to fig9 a . the multi - hop wireless backhaul network includes a network topology manager ( ntm ) ntm 4 , a nan 4 , an agn 7 and agn 10 and a bn 19 . the nan 4 is the active node for both agn 7 and agn 10 , at least at first , the agn 10 is the active node for the bn 19 and the agn 7 is the alternative node . the bn 19 and the nan 4 are the circuit end - points for a circuit 96 a , shown in the signalling diagram in bold to illustrate an active communication link between the bn 19 and the nan 4 . however , since the bn 19 does not have the nan 4 as a parent , circuit traffic cannot flow directly from the bn 19 to the nan 4 . the bn 19 is connected to the nan 4 through the agn 10 , which is the active node hierarchically above for the bn 19 . accordingly , circuit 96 a is relayed through the agn 10 . when the agn 10 experiences a failure as indicated at 499 the circuit 96 a between the nan 4 and the bn 19 is broken . the bn 19 and the nan 4 , during normal operations , would both detect the failure of the agn 10 . at 501 the nan 4 reports the failure of the agn 10 to the network topology manager ntm 4 , while during 502 the bn 19 monitors its alternate node , the agn 7 . at 503 the network topology manager ntm broadcasts a message about the failure 499 , which is received by the agn 7 . subsequently , the network topology manager ntm 4 transmits an updated circuit assignment to the nan 4 at 505 . the nan 4 then sends the updated circuit assignment to the agn 7 at 507 ; and the agn 7 sends the updated circuit assignment to the bn 19 . the updated circuit assignment causes the bn 19 to switch the agn 7 to be its active node hierarchically above . subsequently , the agn 7 dynamically allocated bandwidth to the bn 19 . as a result , circuit 96 b between the nan 4 and the bn 19 is established . the circuit 96 b employs the agn 7 as a relay node for circuit traffic sent between the nan 4 and the bn 19 . what has been described is merely illustrative of the application of the principles of the invention . other arrangements and methods can be implemented by those skilled in the art without departing from the spirit and scope of the present invention . for example , in some embodiments of the invention a network node in a first state is configured to function as a bn and in a second state , the same network node , is configured to function as an agn . in some embodiments , a change of state is caused by a system trigger , such as an expansion of a multi - hop wireless backhaul network including the introduction of one or more new bns . moreover , it is also to be understood that in some embodiments bns may communicate using service and maintenance channels to exchange operation and management ( oam ) information with one another , but not backhaul network traffic .