—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
In this paper we propose a new solution to increase the security of BGP/MPLS IP VPNs established across multiple domains. In general, layer 3 VPNs already present a number of secur...
We propose a mobile multicast routing protocol based on the timer-based mobile multicast (TBMOM). A mobile host that stays in a foreign network receives multicast datagrams from a ...
A common objective of Internet traffic engineering is to minimize the maximal link utilization in a network in order to accommodate more traffic and reduce the chance of congestion...