Router, network comprising a router, method for routing data in a network
View Patent ↗A router for a network is arranged for guiding data traffic from one of a first plurality Ni of inputs (I) to one or more of a second plurality No of outputs (O). The inputs each have a third plurality m of input queues for buffering data. The third plurality m is greater than 1, but less than the second plurality No. The router includes a first selection facility for writing data received at an input to a selected input queue of the input, and a second selection facility for providing data from an input queue to a selected output. Pairs of packets having different destinations Oj and Ok are arranged in the same queue for a total number of Nj,k inputs, characterized in that Nj,k<N for each j,k.
1. Router for a network, the router being arranged for guiding data traffic from one of a first plurality Ni of inputs (I) to one or more of a second plurality N o of outputs (O), the inputs each having a third plurality m of input queues for buffering data, the third plurality m being greater than 1, but less than the second plurality N o , the router comprising:
a first selection facility for writing data received at an input to a selected input queue of said input,
a second selection facility for providing data from an input queue to a selected output,
the first selection facility arranges pairs of packets having different destinations O j and O k in the same queue for a total number of N j,k inputs, characterized in that N j,k <N with N=N i for each j,k, characterized in that the difference
max
j
∑
k
=
1
N
ɛ
i
,
j
,
k
*
λ
i
,
k
-
min
j
∑
k
=
1
N
ɛ
i
,
j
,
k
*
λ
i
,
k
is minimized for each i, wherein λ i,k is the intensity of the data traffic from input I i to output O k and ε i,j,k is 1 if two packets both arriving at input I i and one having outputs O j and O k as destinations respectively are assigned to the same queue, and is 0 if they are not assigned to the same queue.
2. Router according to claim 1 , characterized in that Nj,k<=N−m for each j,k.
3. Router according to claim 2 , characterized in that the difference
MAX
j
,
k
(
N
j
,
k
)
-
MIN
j
,
k
(
N
j
,
k
)
≤
1.
4. System on chip having a network comprising at least one router according to claim 1 which interconnects a plurality of functional units.
5. Computer network which remotely couples a plurality of computer systems, comprising at least one router according to claim 1 .
6. Method for routing data traffic from one of a first plurality N i of inputs to one or more of a second plurality N o of outputs, which method comprises the following steps:
for a packet arriving at an input selecting one of a plurality m of input queues for buffering the packet,
selecting which packets at an output of the queues are to be forwarded to the outputs,
arranging pairs of packets having different destinations O j and O k in the same queue for a total number of N j,k inputs characterized in that N j,k <Ni for each j,k, characterized in that the difference
max
j
∑
k
=
1
N
ɛ
i
,
j
,
k
*
λ
i
,
k
-
min
j
∑
k
=
1
N
ɛ
i
,
j
,
k
*
λ
i
,
k
is minimized for each i, wherein λ i,k is the intensity of the data traffic from input I i , to output O k and ε i,j,k is 1 if two packets both arriving at input I i , and one having outputs O j and O k as destinations respectively are assigned to the same queue, and is 0 if they are not assigned to the same queue.