The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Proxy Mobile IPv6(PMIPv6) [1], as one of the most promising technologies for the next generation IP network, has attracted much attention in academia and industry. As an extension of PMIPv6, localized routing optimization can improve the performance of local communication greatly. However, recent study on localized routing optimizations only focus on singleaccess scenario, while the multi-access scenario...
In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in nonJackson networks. This simplifying double-limit model, however, lends itself to conservative numerical results in finite regimes. To properly account for queueing behavior beyond a simple calculus based on average rates, we advocate...
A lot of transition mechanisms have been proposed and standardized in Internet Engineering Task Force (IETF), to support the coexistence and interoperability of IPv4 and IPv6. Among them, the 4over6/6over4 edge network tunneling technique has become a particular hot subject recently. To apply this technique into real ISP networks, there is a practical problem: planning the placement of the tunnel...
We consider architecture of data center networks (DCN), which adds wireless network card to each router [1 -- 3]. Existing redundancy elimination (RE) mechanisms reduce link loads and increase network capacity in several environments by removing strings that have appeared in earlier packets through encoding and decode them several hops downstream. This article is the first to explore RE mechanisms...
Maximizing network throughput is one of the main objectives in wireless multi-hop networks. However, small link bandwidth and severe interference become two great obstacles in network throughput improvement. Single route always encounters great congestion, especially for multiple flows with the same source and destination. Multi-path routing can solve the bandwidth shortage issue to some extent, but...
Next generation networks call for novel network architectures in order to support QoS-oriented applications. However, existing QoS architectures mostly suffer from the unscalability problem. In this paper we propose a novel connectionless QoS routing framework for high-speed core networks. Unlike traditional QoS architectures, neither resource reservation nor per-flow management exists in the proposed...
As the IPv6 networks rapidly deployed, the transition problem has been changed. Because the transition of applications is a steady process with a far longer duration in comparison to the transition of infrastructure, providers cannot give up the duty of serving IPv4 traffics for the time being. On the other hand, operating a dual-stack backbone is highly costing for large-scale deployment of new networks...
Being an important and yet a challenging problem, the QoS-based routing in the converging Internet has received significant attention from the research community. However, most of the QoS-based routing research is conducted in the context of intra-domain routing, leaving QoS-based inter-domain routing relatively open. In this paper, we specifically investigate how to extend the current inter-domain...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.