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 provides a network flow allocation algorithm that can be used for multipath routing in the wireless ad hoc networks. Called GANFA (Globally Aware Network Flow Allocation), this algorithm assigns a FC (Flow Cost) to every routing path in the network. The FC is a function of end-to-end delay, power consumption and hop distance, and is used to choose multiple routing paths. An optimization...
Multicast inter-session fairness problem is about fairly sharing network resource among a set of multicast sessions. Besides resource allocation fairness, minimum resource adjustment and lowest computational complexity are another two important requirements in real networks. In this paper, we propose a heuristic algorithm to solve the problem in the context of SDN networks for delivering layered encoded...
We investigate the performance of priority-based access in a channel-hopping cognitive network, in particular the interaction between the number of packets each node is allowed to send in a single transmission cycle and the penalty coefficient that determines the amount of sensing to be done upon a successful transmission. Our results indicate that giving higher bandwidth allocation to low priority...
RF front-end characteristics significantly impact the performance of the receiver. Receivers are vulnerable to harmful adjacent channel interference, especially in shared spectrum environments, which allow a free-style of spectrum access with diverse receiver technologies accessing the same band of spectrum. Channel assignments agnostic to receiver characteristics can have a severe detrimental effect...
In this work, the inter-linked problems of bandwidth allocation for wireless service providers (WSPs) and WSP selection for users in heterogeneous cellular networks (HCNs) are addressed by employing a multi-hierarchical game framework. Wherein, while the interaction between users are modelled using evolutionary game theory, the interactions between competing WSP's are modelled as a non-cooperative...
We propose a global dynamic bandwidth optimization algorithm for software defined optical access and aggregation networks, which can support unified optimizations and efficient scheduling by allocating bandwidth resources from a global network view in real-time. The performance benefits of the proposed algorithm in terms of resource utilization rate, average delay and delay of a single mobile user...
We study the problem of utility fair bandwidth allocation via association control in wireless mesh networks (WMNs). We formulate an optimization problem that achieves an utility fairness objective and jointly considers user association and resource allocation in WMNs. As the problem is NP-hard, we propose an approximation algorithm whose solution is very close to the optimal one, which is demonstrated...
Shaping subscriber traffic based on token bucket filter (TBF) by Internet service providers (ISPs) results in waste of network resources in shared access when there are few active subscribers, because it cannot allocate excess bandwidth in the long term. New traffic control schemes have been recently proposed to allocate excess bandwidth among active subscribers proportional to their token generation...
In modern, competitive, and dynamic access networks the underlying bandwidth distribution mechanism has to be capable of understanding user requirements, meeting stringent quality of service (QoS) demands, and satisfying a broad spectrum of user traffic dynamics. Undoubtedly, optical fiber is the dominant transmission medium enabling practical and cost-effective optical infrastructures in the last...
This paper introduces a novel QoS architecture for process automation. The proposed architecture leverages the concept of Software Defined Network. The architecture maintains the real-time communications based on the measured propagation time. It maintains the configurations by detecting and predicting the change of propagation time in addition to queue usage. The authors utilize the OpenFlow with...
CSFQ is used to improve the quality of packet transmission by dividing the network into 2 routers, edge routers perform the scheduling of each packet flow queue and core routers provide a label that contains information the bandwidth allocation of each flow packet queue. However, CSFQ consume bandwidth for each flow, so less fit when applied to peer-to-peer traffic. In this paper, the calculation...
With the rapid growth of data rate, the optical network is evolving from fixed-grid to flexible-grid to provide spectrum-efficient and scalable transport of 100Gb/s services and beyond. In this paper, we analyzed the blocking performances for fixed/flexible-grid and sub-band conversion in optical networks. Flexible-grid and sub-band conversion demonstrated the good performances on traffic blocking...
Network providers are nowadays facing with a big question in allocating network resources due to the constantly increasing of Internet services. While the network resource is not unlimited, users always desire the best quality of experience (QoE) with the huge information exchange. Therefore, finding a justice of network resource allocation based on the user experience is mandatory. In previous studies,...
Current data centers in cloud computing have flexible mechanisms to lease compute resources, but provide little control mechanism to share network resource. Traffic flows from different tenants' VMs will competing network resource on the substrate network, thus can resulting in unpredictable performance degradation. This paper proposes an economic model for fair leasing the network resource between...
This paper formulates the bandwidth allocation problem in train-to-ground wireless communication networks in operational process of trains. It is shown that the Nash Bargaining game provides an Asymmetric Nash Bargaining Solution which is fair to bandwidth allocation problems in different services. We proposed a bandwidth allocation model for train-to-ground communication system. It can effectively...
This paper provides specifications of the parameters defining the design of medium access control (MAC) protocols for orthogonal frequency division multiple access (OFDMA) passive optical networks (PONs). Network architecture has been designed for MAC evaluation based on the wired-wireless converged topology, extendable in reach, subcarriers and optical network units (ONUs), the upstream and downstream...
The first giga-bit class wireless local area network (wireless LAN) below 6 GHz frequency (the IEEE 802.11ac standard) is attracting attention due to its capability of handling much more of the rapidly growing data traffic. The increased density of wireless LAN access points (APs), however, has induced inter-cell interference that severely degrades system performance. This problem seems to be getting...
In this paper, we propose an adaptive bandwidth allocation (BA) and connection admission control (CAC) mechanism based on game theory for polling services in IEEE 802.16 broadband wireless networks. A noncooperative two-person general-sum game is formulated where the base station and a new connection are the players of this game. The game formulation provides not only the decision on accepting or...
The flexibility of Cloud computing allows elastic services to adapt to changes in workload patterns in order to achieve desired Service Level Objectives (SLOs) at a reduced cost. Typically, the service adapts to changes in workload by adding or removing service instances (VMs), which for stateful services will require moving data among instances. The SLOs of a distributed Cloud-based service are sensitive...
In recent years, the BitTorrent (BT) has been one of the most efficient mechanisms for Peer-to-Peer (P2P) non-realtime content distribution. Many approaches for streaming videos over BitTorrent have been proposed by modifying the piece selection policy to cope with the real time requirement. Most of them provide the continuity of video playback at the cost of the variety of pieces on P2P streaming...
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.