Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper presents a new multipath delay based algorithm, MPPERT (Multipath Probabilistic Early response TCP), which provides high throughput and efficient load balancing. In all-PERT environment, MPPERT suffers no packet loss and maintains much smaller queue sizes compared to existing MPTCP, making it suitable for real time data transfer. MPPERT is suitable for incremental deployment in a heterogeneous...
With the onset of multiple wireless technologies, the end-host devices of today are multi-homed. This has led to research in the simultaneous use of multiple paths between the multi-homed end devices. New multipath transport protocols such as Multipath TCP and Concurrent Multipath Transfer SCTP need to be fair to the existing transport protocols like TCP and SCTP in a congested network. One way of...
This paper proposes a scheduling approach for mobile uplink WiMAX system that provides a trade-off between delay requirement satisfaction and throughput maximization. The paper starts by introducing three scheduling algorithms each with a different objective. The first aim is to maximize the throughput of the system, while maintaining the user fairness. The second aim is to satisfy the delay requirements...
A network model with both social and communication characteristics is considered. Different capacity regions are computed as a function of the social network size for each node. It has been shown that as the social connectivity among nodes improves, the likelihood of finding shorter path between source-destination pairs in the network increases which results in increase in the capacity compared to...
The IEEE 802.11 standard does not define any feedback policy for the multicast transport. Hence missing multicast packets are not retransmitted and are definitely lost. In this paper we define the Block Negative-Ack (BNAK) recovery policy. Using our protocol, the multicast source transmits a block of multicast packets followed by a Block NAK Request (BNR). Upon reception of a BNR, a multicast member...
The Enhanced Distributed Channel Access (EDCA) mechanism has been adopted by media access control (MAC) layer of IEEE 802.11p to provide contention-based differentiated channel access for packets with different priorities. To analyze the performance of EDCA mechanism, the two-dimensional Markov chain model with the different contention windows(CW) and the internal collision and the frozen mechanism,...
Optimal resource allocation is an outstanding issue in wireless communication systems. In this work we focus on the ever challenging optimization of the tradeoff between throughput and fairness. Specifically, we propose a novel framework to analytically derive the maximum average throughput versus fairness under the assumptions that the throughput of each user i) increases if more resources are allocated...
In cognitive radio network, cooperation between primary users and secondary users can improve their data rate and achieve dynamic spectrum sharing. This paper proposes a novel spectrum sharing model to solve the opportunistic access problem in cooperative cognitive radio network (CCRN). In this model, primary users select sets of secondary users as their relays and allocate channel resource to secondary...
We study a system of multiple routers traversed by multiple TCP connections using TCP New Reno, CUBIC and Compound. More than one router may be congested. To analyze this system we will use earlier theoretical models of TCP New Reno and CUBIC but develop a new model of TCP Compound experiencing random packet losses and queuing delays. We model the router queues as M/GI/1 queues with arrival rates...
Scheduling multicast traffic in input-queued switches requires solving a hard combinatorial optimization problem in a very short time. This task advocates the design of algorithms that are simple to implement and efficient in terms of performance. We propose a new scheduling algorithm, based on message passing and inspired by the belief propagation paradigm, meant to approximate the provably optimal...
Web services are loosely-coupled business applications willing to cooperate in distributed settings within different groups called communities. Communities aim to provide better visibility, efficiency, market share and total payoff. There are a number of proposed mechanisms and models on aggregating web services and making them cooperate within their communities. However, forming optimal and stable...
In this paper, the problem of location classification in OFDMA-based FFR systems is considered for two FFR schemes, namely Strict FFR (FFR-A) and Soft Frequency Reuse (FFR-B). The FFR systems considered in the literature are mostly studied with static resource partitioning where a greater portion of the sub-carrier resources are reserved for users in the cell centre and a smaller portion for users...
In this paper, we address the problem of channel assignment considering partially overlapping channels (POCs) for interference avoidance in 802.11-based wireless mesh networks. A novel interference model is proposed which provides a systematic approach of measuring the interference caused by links operating on POCs by taking into account both the adjacent channel interference and the corresponding...
In this paper, we investigate the impact of the deployment of a second relay node in a cooperative communication scheme. The relay nodes relay packets from a number of users to a destination node. We assume that the two relays do not have packets of their own and the users have saturated queues and random access to the medium with slotted time. We obtain analytical expressions for the arrival and...
This work studies the joint scheduling — admission control (SAC) problem over a fading channel. In particular, the optimal trade-off between maximizing the throughput and minimizing the queue size (or average congestion) is investigated. The SAC problem is formulated as a constrained Markov decision process (MDP) to maximize a utility defined as a function of the throughput and the queue size. The...
The advent of cloud computing has offered to developers a new appealing paradigm to deploy their applications without capital investments. Resources can now be acquired on-demand in a flexible, scalable and rapid way. However, cloud providers lack of native mechanisms to guarantee the Quality of Service required by specific application domains. High availability can be achieved by replication of critical...
The femto-access-point (FAP), a low power small cellular base station provides better signal quality for the indoor users as to provide high data-rate communications with improved coverage, access network capacity and quality of service. Highly dense femtocellular deployments — the ultimate goal of the femtocellular technology — will require significant degree of self-organization in lieu of manual...
Data availability is critical in distributed storage systems, especially when node failures are prevalent in real life. A key requirement is to minimize the amount of data transferred among nodes when recovering the lost or unavailable data of failed nodes. This paper explores recovery solutions based on regenerating codes, which are shown to provide fault-tolerant storage and minimum recovery bandwidth...
Backoff algorithm is a technique to reduce packet collisions and to improve throughput efficiency in wireless local area network (WLAN). In this research, we propose a new backoff algorithm which is named Binary Exponential Increment Half Decrement (BEIHD) backoff algorithm. Furthermore, we introduce a new discrete Markov chain model for modeling the performance analysis of wireless local area network...
In LTE base-stations, RoHC is a processing-intensive algorithm that may limit the system from serving a large number of users when it is used to compress the VoIP packets of mobile traffic. In this paper, a hardware-software and a full-hardware solution are proposed to accelerate the RoHC compression algorithm in LTE base-stations and enhance the system throughput and capacity. Results for both solutions...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.