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.
Emerging Peer-to-Peer (P2P) technologies have enabled various types of content to be efficiently distributed over the Internet. Most P2P systems adopt selfish peer selection schemes in the application layer that in some sense optimize the user quality of experience. On the network side, traffic engineering (TE) is deployed by ISPs in order to achieve overall efficient network resource utilization...
In this work, we study the traffic adjustment over multipath network in the presence of both inelastic and elastic traffic flows. The characteristics of these two types of traffic differ significantly. Hence, earlier approaches that focus on homogeneous scenarios with a single traffic type are not directly applicable. We formulate a new traffic adjustment problem based on time series prediction and...
Internet traffic is highly dynamic and difficult to predict in current network scenarios. This makes of traffic engineering (TE) a very challenging task for network management and resources optimization. We study the problem of intradomain routing optimization under this traffic uncertainty. Recent works have proposed robust optimization techniques to tackle the problem, conceiving the robust routing...
In recent years application-level networking (e.g. overlay networks, P2P networks) has become key enabling architecture for supporting distributed services on the Internet. We consider overlays to have delay and cost requirements and thus there exists an optimal distribution of the overlay traffic (the service engineering problem) across multi-domain underlay networks such that these requirements...
Delay-sensitive Internet traffic, such as live streaming video, voice over IP, and multimedia teleconferencing, requires low end-to-end delay in order to maintain its interactive and streaming nature. In recent years, the popularity of delay-sensitive applications has been rapidly growing. This paper provides a protocol that minimizes the end-to-end delay experienced by inelastic traffic. We take...
The next generation broadband wireless access networks are expected to support a variety of multimedia rich applications which can lead to very high traffic demand. With the development of high speed radio access technologies the backhaul network can become the bottleneck if not upgraded and configured optimally to support the expected increase in date rates and traffic demands. To deliver high data...
IEEE P1900.4 is an emerging standard for optimized radio resource utilization where cognitive radio technologies are used for efficient spectrum utilization. In this paper, we design and implement a cognitive wireless network system based on open documents of IEEE P1900.4, and evaluate its performance using UDP streaming and HTTP download. Our experiments show interesting results that total network...
This paper describes a new path computation model in Multi-protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. It introduces a path computation element (PCE), which is functionally separate from label switching routers (LSRs). The Path Computation Element (PCE) is an entity that is capable of computing a network path or route based on a network graph, and applying computational...
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.