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.
Abstract-We explore the physical-layer security for a multisource multi-relay wireless network in the presence of an eavesdropper, in which one of multiple sources is scheduled to send its message to a destination with the assistance of multiple decode-and-forward (DF) relays. One eavesdropper is considered at the receiver side, and assumed to be capable of overhearing the transmission from relays...
This paper investigates the joint user association (UA) and user scheduling (US) for load balancing in a wireless downlink heterogeneous network by formulating a network-wide utility maximization problem. In order to efficiently solve the problem, we first approximate the original non-convex throughput function to a concave function, and demonstrate that the gap for such approximation approaches zero...
Random linear network coding (RLNC) has been shown to efficiently improve the network performance in terms of reducing transmission delays and increasing the throughput in broadcast and multicast communications. However, it can result in increased storage and computational complexity at the receivers end. In our previous work we considered the broadcast transmission of large file to N receivers. We...
We propose a high network utilization CONGestion- Aware load balancing approach, Multi-hop CONGA. It aims at improving the performance of handling traffic asymmetry, which happens occasionally in data centers. It leverages regular Clos topology and overlays for virtualization. In this paper, we schedule at the unit of flowlet, which is the burst of packets belonging to a flow, and make routing decisions...
In big data clusters, task dispatchers assign arriving tasks to one of many workers (servers) for load balancing. Workers schedule task executions for rapidly completing queueing tasks. Both dispatchers and workers are important for optimizing task/job-completion-time (TCT/JCT). Current dispatchers probe loads on workers before assigning every task/job, which incurs expensive message overheads and...
As more and more data-intensive applications have been moved to the cloud, the cloud network has become the new performance bottleneck for cloud applications. To boost application performance, the concept of coflow has been proposed to bring application-awareness into the cloud network. A coflow consists of many individual data flows, and a coflow is completed only when all its component flows are...
In this paper, we investigate the physical-layer security for a wireless communications network comprised of multiple users and a common base station (BS) in the presence of an eavesdropper. We propose a joint user-jammer selection scheme for preventing the eavesdropper from intercepting the confidential user-BS transmission. Specifically, a user is first selected to transmit its message to the BS,...
In this paper, we construct an analytical design framework for energy efficient scheduling for delay-constrained spectrum aggregation (ESSA), where the practical hardware limitations on SA capability bring various technical challenges. Specifically, the conventional water-filling power control cannot be adopted over all the channels, and the delay-aware scheduling solution should interact with the...
We describe a scheduler for multiple servers shared among different packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler allocates tokens to flows in a round-by-round manner, where token allocation to flows at the beginning of each round is weighted max-min fair. We present a packet scheduling scheme where when a server becomes free, it...
This work considers the joint problem of content placement and service scheduling in femtocell caching networks, to maximize the traffic volume served from the cache. The problem is modeled as a Markov decision process. We combine the Edmonds-Karp algorithm and the marginal allocation algorithm to develop an efficient centralized policy called Infinite CAche-filling (ICA), which can get arbitrarily...
This paper considers an energy harvesting sensor node with finite data and energy storage, which transmits data packets with different reward values to its corresponding receiver node. In this regard, we propose an optimal threshold-based transmission scheduling policy for maximizing the long-term average transmission reward. In particular, we first analyze the performance of the proposed threshold-based...
Superposed transmission on the broadcast channel delivers multiple private messages simultaneously to the intended users. Superposed transmission is employed in non-orthogonal multiple access to increase the aggregate throughput and connectivity of wireless cellular systems. Rate-adaptive constellation Expansion Multiple Access (REMA, a.k.a. RA-CEMA) is a non-orthogonal multiple access scheme which...
Governing how network resources are shared among various traffic flows is not a completely solved problem. The ideal system can implement a wide variety of detailed and flexible policies; enforces those policies under all possible offered traffic combinations and scales well with the number of flows. In this paper we introduce a framework that approximates the ideal system well. It consists of flow-aware...
In the Cloud Radio Access Network (C-RAN)architecture, a fronthaul network carries digitized radio signals from Remote Radio Head (RRH) to centralized Baseband Unit (BBU) using the Common Public Radio Interface (CPRI), which has a one-way jitter requirement of several nanoseconds. It is widely believed that Ethernet cannot meet this stringent jitter requirement, thus today's fronthaul networks are...
This work studies the problems of feedback allocation and scheduling for a multichannel downlink cellular network under limited and delayed feedback. We consider a realistic scenario where a fixed and small number of link states can be reported to the base- station (BS) per time-slot. We study the trade- off between knowing at the BS a small number of accurate link states (i.e. that can be...
Scheduling is one of the most important resource allocation for networked systems. Conventional scheduling policies are primarily developed under light-tailed (LT) traffic assumptions. However, recent empirical studies show that heavy-tailed (HT) traffic flows have emerged in a variety of networked systems, such as cellular networks, the Internet, and data centers. The highly bursty nature of HT traffic...
This paper studies privacy-preserving for downlink transmission in multiuser relay systems, where a source communicates with multiple users via a relay employing the amplify-and-forward (AF) protocol. At any scheduling unit, only one user (desired user) is selected to receive the source information, and the other users (undesired users) are viewed as potential eavesdroppers due to the broadcast nature...
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.