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.
This paper studies the problem of admission control and air interface (AI) selection in heterogeneous network environments. The statistics of random user arrivals, channel conditions and service durations are considered for the optimization of heterogeneous access management strategies with respect to minimizing the expected mean cost for blocking events. Based on state aggregation in a semi-Markov...
One of the important concepts in MPLS Traffic Engineering (TE) is LSP setup routing. The objective of routing algorithm is to increase the number of accepted request and satisfying Quality of Service (QoS) constrains. Although much work has been done on laying MPLS paths to optimize performance, most has focused on satisfying bandwidth requirements as QoS constrains. The previously published research...
A network traffic system can be tuned by three factors: (i) the topology of underlying infrastructure; (ii) the distribution of traffic resources; (iii) the routing strategy. In this paper, we propose a model to study the optimization of network capacity based on complex network theory. We study the optimization method of network traffic in several situations corresponding to the real cases. The model...
We consider the problem of maximizing network revenue from the perspective of bandwidth allocation and route selection. The objective is to perform offline maximization of revenue from served demands in the context of self-similar (long range dependent) traffic. We use an alpha-stable distribution for the aggregate demand volume to capture the appropriate level of traffic burstiness. We take a centralized...
This paper studies a joint coding/routing optimization between network lifetime and rate-distortion, by applying information theory to wireless visual sensor networks for correlated sources. Arbitrary coding (distributed source coding and network coding) from both combinatorial optimization and information theory could make significant progress towards the performance limit of information networks...
This work proposes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks loosely mimicking the foraging behavior of ants, which in the past has originated the Ant Colony Optimization (ACO) metaheuristic. The distributed framework consists of additional data structures stored at the nodes and special control packets used to estimate the goodness of the routing...
In this paper, we consider joint end-to-end congestion control and multiuser scheduling in multi-hop wireless networks, where orthogonal frequency-division multiple access (OFDMA) is the air interface. Compared to its single-channel counterpart, this problem is significantly more challenging because subchannel assignment and power allocation for all nodes and network traffic need to be jointly optimized...
Return network traffic (from servers to clients) in thin-client systems is modeled as a mixture of interactive data flows corresponding to keystrokes and bulk data flows related to screen updates. Users are very sensitive to delay and jitter of the former flows. Thus our goal is to minimize the latency of interactive data transfer without increasing latency of bulk data transfer. Through simulation...
Open shortest path first (OSPF) is the most commonly used intra-domain Internet routing protocol. As the routes of paths are determined by basically only the link metrics, many paths may pass a link with small metric; therefore, there is high possibility that it causes the congestion of the link. It is essential that the number of the paths with large traffic in a link is limited to avoid a congestion;...
Resource reservation call admission control (CAC) schemes constitute an efficient solution for prioritizing high priority calls. Issues concerning fairness among calls arise during the implementation of CAC. In this paper, a new optimization model selecting the admission probability in thinning schemes is proposed to provide fairness in resource sharing among different input call stream flows. The...
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...
Peer-to-Peer (P2P) systems have gained much popularity over the past few years. P2P networks contribute a significant portion of the Internet traffic and cause increasing costs incurred by Internet service providers (ISP). Present P2P systems are generally selecting peers in random manner, regardless of the network cost, which generates much redundant traffic over the core network and congest the...
In recent years peer-to-peer (P2P) systems gain much attention. Growing popularity in P2P based protocol implementations for file sharing purposes caused that the P2P traffic exceeds Web traffic, once of the dominant traffic on the Internet. In fact of that, the use of P2P systems introduce many new problems related to traffic engineering or network optimization. In accordance to our previous works...
Remote adaptation of network parameters such as antenna tilts and pilot power levels brings important gains to the network performance in terms of capacity. The problem of finding the optimal combination for those parameters across all sectors is represented as an optimization problem and solved with heuristic algorithms. The remote functionality allows a frequent adaptation with no additional costs...
This paper studies the network synthesis problem, which is common in the design of telecommunication networks and considers a set of practical constraints, such as arc capacity, node capacity and degree, and hop limit. To obtain the minimum cost for the given traffic flows, we propose a concretized model and a branch and bound algorithm for the problem. A schema based on Lagrangian relaxation is introduced...
Open shortest path first (OSPF) is a dynamic and inter-domain routing protocol with hierarchical architecture used in Internet networks routing. Area border router (ABR) had been proved to be an effective solution to the complicated network and scalability problem. Obviously, manual selection of ABR can not satisfy the dynamic change in the network load. A new scheme, based on the traffic engineering...
Many efforts have been devoted to maximizing network throughput in a multi-channel multi-radio wireless mesh network. Current solutions are based on either pure static or pure dynamic channel allocation approaches. In this paper, we propose a hybrid multi-channel multi-radio wireless mesh networking architecture, where each mesh node has both static and dynamic interfaces. We first present an Adaptive...
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...
This paper investigates the non-convexity of utility-based resource allocation problems in orthogonal frequency division multiple access (OFDMA) networks with heterogeneous traffic classes. Efficient transmission in OFDMA networks requires optimal resource allocation to users based on their current channel states. Also, utility-based resource allocation improves the network resource utilization and...
This paper presents a novel cross-layer design for joint power and end-to-end rate control optimization in DS-CDMA wireless networks, along with a detailed implementation and evaluation in the network simulator ns-2. Starting with a network utility maximization formulation of the problem, we derive distributed power control, transport rate and queue management schemes that jointly achieve the optimal...
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.