[PDF] Top 20 Optimal routing in the De Bruijn networks

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

... occupying the same wavelength, which is rooted from the source and terminated at the ...light-tree, the light-hierarchy structure accepts the cycles introduced by the Cross Pair ... Voir le document complet

... The number of transmissions required to deliver the I frame to the clients is thereby reduced from the size of the union of lost I frame packets to maximum number of I frame losse[r] ... Voir le document complet

... We may now compactly express the linear optimal control problem with linear state and control variable inequality constraints which represents the data communication network d[r] ... Voir le document complet

... of the existing routing protocols for ad hoc networks are designed to scale in networks of a few hundred ...of the network or links on the route between a source and a ... Voir le document complet

... work. In the context of SRLG, basic network connectivity problems have been proven much more difficult to address than their usual ...instance, the problem of finding a “SRLG-shortest” st-path that ... Voir le document complet

... Geographic routing [1]–[3], relying on the knowledge of geographic location information of nodes to make local route decisions, is a promising routing solution to the demand of developing ... Voir le document complet

... of the total IP video traffic (80 percent by 2018 of the global IP traffic according ...of the most important models able to replace the client-server model ...of the fundamental ... Voir le document complet

... Each node i in the network maintains a topology table T i called its main topology table. A topology table is a list of the operational status of each link in the netw[r] ... Voir le document complet

... included in most multicast distribution ...selection, the sender of a multicast packet can explicitly select the distribution path (usually a tree) of a single multicast ...packet in order to ... Voir le document complet

... Many routing protocols have been proposed to keep the connectivity between nodes, including the AODV protocol (Ad Hoc On-Demand Distance Vector), which is maintained a[r] ... Voir le document complet

... 5, the ad hoc communicating mode can sometimes be faster (the path is shorter) and should be used to speed up the routing ...use, the node u first asks the value of hc(v) to AP ... Voir le document complet

... noted in the previous section, EAN are a special case of k-trees, with k = d + ...purpose. In particular, they are constructed using the fact that, at each step, a vertex is added to a ... Voir le document complet

... Unicast routing with multiple metrics Path computing problem for multiple metrics has been widely investigated in the ...However the problem is inherently hard and a polynomial time algorithm ... Voir le document complet

... however, routing protocols require that each node in the network is uniquely ...identified. In the Internet, as we have already seen, this unique name is an IP ...nodes in a ... Voir le document complet

... ple, in (Wu, Ke, & Huang, 2007) potential senders use an ALOHA based random MAC scheme to send reservation requests to the central ...lost, the reservation process needs an explicit confirmation. ... Voir le document complet

... generated in the optimization of cut and flow ...On the other hand, the computational time is roughly the same as the formulation with flows [11]: sub-linear in the ... Voir le document complet

... when the time scale over which the fading states vary is much longer than the time that it takes to transmits a unit of information between two ...that the receiver is able to measure ... Voir le document complet

... from the fact that it has been shown that the break-even line length where optical communication lines become more effective than their electrical counterparts is less than 1cm, in terms of speed and ... Voir le document complet

... in Theorem 3.1. Indeed, let us show with a counterexample that the total length policy is not ...optimal. In Figure 7 the origin nodes for each packet are labeled with small letters, ... Voir le document complet