Real-time bandwidth measurements over mobile connections

Combine federated learning with the mobile network a good opportunity for the introduction of AI technology research and application in the mobile communication network.This article proposes a kind of the mobile network architecture based on FL to promote the integration of FL technologies with mobile communication network and to meet the joint modelling needs of users, operators, and industries. And points out some key technologies of the mobile network to illustrate how the mobile network to support FL working. Meanwhile, proposes some use cases to illustrate what possible application scenarios and values, if the FL technology is introduced into the mobile communication network.

High speed downlink packet access (HSDPA) was originally introduced in release 5 of WCDMA to boost data rates of packet switched traffic in the downlink. With increasing demand for streaming services and recent efforts to provide mobile TV, the standard has also been considered for delivering streaming services over cellular networks. While much attention has been paid to optimizing transmission of non real time application, this paper aims at providing a comprehensive study of particular requirements and performance aspects of transmission of streaming services over HSDPA. We compare performances of different scheduling algorithms in pure streaming scenarios for constant bit rate as well as variable bit rate streams and different streaming rates. We further study the impact of code multiplexing of different streaming users on the system performance and examine the system behavior when both streaming and best effort services are present.

This article investigates the efficient transmission of file download services to several users simultaneously in 3G mobile networks with HSDPA (High-Speed Downlink Packet Access) and MBMS (Multimedia Broadcast Multicast Services). HSDPA supports high speed point-to-point (p-t-p) transmissions (up to several Mb/s), whereas with MBMS the same content can be transmitted with a point-to-multipoint (p-t-m) connection to multiple users in a unidirectional fashion. Multicast delivery can be implemented through only p-t-p transmissions with HSDPA, a single p-t-m transmission with MBMS, or using both jointly in a hybrid approach by employing HSDPA for error repair of the MBMS p-t-m transmission. We investigate the optimum HSDPA and MBMS transmission configuration when they are used separately, and the trade-off between the initial MBMS file p-t-m transmission and the HSDPA error repair for the hybrid delivery. The approach of minimizing the transmission energy (product of the transmit power times the transmission time) to achieve a target file acquisition probability (percentage of users that successfully receive the file) has been adopted.

This paper presents an analytical model of the cell and user throughput of high-speed downlink packet access (HSDPA) that can be used to compare the performance and efficiency of various schedulers. The focus is on the proportional fair (PF), score-based (SB), and Max C/I schedulers. The radio channel is assumed to be a composite multipath/shadowing channel, with the path amplitude following a Nakagami distribution. The effect of the correlation between paths on the HSDPA throughput performance is taken into account in the modeling. The analytical model is confronted with a simulation using the NS2 network simulator and shown to provide reasonably close results to the simulation in view of the modeling assumptions.

HSDPA (high-speed downlink packet access), introduced in WCDMA release 5, provides a high-bandwidth shared channel with short transmission time interval (TTI). The short TTI together with appropriate scheduling enable HSDPA to support efficient multiplexing of traffic. We explain the performance of four scheduling algorithms when transmitting a traffic mix consisting of both conversational (VoIP) traffic and background (Web) traffic over the high-speed downlink shared channel (HS-DSCH) of HSDPA. We consider both cell throughput and user satisfaction. The proportional fair (PF), the maximum rate (MR) scheduler and two extended versions of MR, are tested for different VoIP scheduling delay budgets and varying load. To understand the behaviour of the schedulers, we use the ns-2 simulator extended with a model of HS-DSCH to simulate a mixed traffic scenario. Our results show that a scheduler that gradually increases the VoIP priority and considers the user's current possible rate, performs well. A more drastic increase in VoIP priority is however needed when the delay budget is short. Furthermore, attempting to uphold quality for both VoIP and Web traffic makes the system sensitive to overload situations.

High speed downlink packet access (HSDPA) is a packet-based data service in UMTS networks that supports data rates of several Mbit/s, making it suitable for data applications ranging from file transfer to multimedia streaming. In spite of the fairly high data rates that HSDPA offers, the shared downlink radio channel used in HSDPA is a challenging environment for delay- and loss-sensitive applications. It is relatively easy to partition resources over wired links with known link capacity. Nevertheless, such partitioning is complex for wireless links with variable capacity; due to the dynamic nature of the link, it is difficult to effectively allocate the resources (i.e., time slots) between users who may be paying different prices for different services. In this paper we study the general problem of resource partitioning for shared wireless links like HSDPA. We consider different QoS classes or user groups, and the use of MAC-layer scheduling for resource partitioning between groups and between individual users. We propose a variant of an existing HSDPA scheduler called required activity detection (RAD) scheduler. The proposal is studied using a detailed UMTS/HSDPA simulator.

Mobile communication network provides the terminals of IOT (Internet of Things) with a convenient way to access the network. However a large number of connected IOT terminals will inevitably produce a significant impact on the existing mobile communication network. After summarizing the characteristics of typical applications of IOT, this review provides analysis of the specific impact of IOT on mobile network, and finally proposes the corresponding solutions.

Overestimating Wireless Demand: Policy and Investment Implications of Upward Bias in Mobile Data Forecasts

During the system providers of mobile communication investing much money to deploy 3G mobile communication networks, computer industry proposes another wireless communication technology: WiMAX (Worldwide Interoperability for Microwave Access) technique, which is also called as IEEE 802.16 communication technology. It is a strong wireless communication technology to provide users being able to quickly and arbitrarily use wireless data communication services, and this technique also has the potential to be a last mile solution of broadband home network connecting to Internet in future. In the example of 802.16a using instead of DSL technique, the theoretical value of transmission range is about 50km and the transmission rate can be up to 75Mbps. In the example of 802.16e using for mobile equipments, the theoretical value of transmission range is about 2-5km and the transmission rate can be up to 15Mbps. Owing to the cost of wireless network infrastructure is lower than that of wire network infrastructure, WiMAX can be regarded as a cheap substitutive scheme of DSL and other broadband wire networks. On the other hand, although the data transmission rate of 3G mobile communication network is faster than the currently mobile telecom network, it is still slower 30 times than that of WiMAX network, and its radio range is also smaller 10 times than that of WiMAX. Therefore, the required number of base station of WiMAX network is fewer than that of 3G mobile communication network, moreover, some parts of frequency bands defined in WiMAX are license-exempt. Present there are 67 member companies of WiMAX Forum in the world using the name of WiMAX to push the standard. The semiconductor giant-Intel corp. fully supports the technique, and the mobile phone and network provider-Nokia corp. also supports this technique standard. Intel corp. begins to include WiMAX technique in its chip platform, and plans to sell the WiMAX chip in the next half year. The analysts of MIC predict that there will be 25% notebooks installed this sort of wireless technique till 2008. Nemcek believes that consumers will get the convenience brought from WiMAX in 3 or 4 years, and the market of WiMAX will grow in 2007 or 2008. In this thesis” Analysis and Implementation of IEEE 802.16 WiMAX System Software Architecture on Linux Operating System” is to analyze and implement WiMAX wireless system on Linux operating system. For system analyzing, study the standard speciation of IEEE 802.16 series at first, then start to design software architecture for Linux system. For system implementation, use standard PC for software implementation, and then for others to follow the system architecture to implement Linux Device Driver for WiMAX. The system architecture will also consider the efficiency of porting and development of the embedded system. Also implement Software Emulate Physical Layer to verity the Linux Device Driver for WiMAX.

In Wideband Code Division Multiple Access (WCDMA) networks the Signaling Radio Bearer (SRB) is transmitted downlink to inform the user i.a. when it needs to make a handover. When transmitting e.g. Voice over IP (VoIP) on High Speed Downlink Packet Access (HSDPA) SRB is mapped on HSDPA user data channel, high-speed downlink shared channel (HS-DSCH) in order to maximize voice capacity. The lack of support for soft handover (SHO) of HS-DSCH may compromise the reception of SRB and thus also a possible incoming serving HSDPA cell change command especially at the cell borders. This can lead to serious VoIP service degradation due to prolonged camping on a poor cell and in the worst case even to call dropping, if the cell change command is not received before VoIP call drop criterion is met. This paper considers the performance of SRB transmission on source cell HS-DSCH during a handover process. Also a strategy of transmitting the serving cell change command from the target cell is analyzed. The study is done by the means of fully dynamic system simulations and they consider both macro-cell and manhattan scenarios. The results show that a relatively low SRB/handover error rate is experienced in a macro cell scenario but in a more challenging manhattan scenario the error rate is higher. Transmitting the serving cell change command from the target cell HS-SCCH results in similar handover failure rates in manhattan scenario than using SRB on HS-DSCH in macro-cell scenario when static power allocation for HS-SCCH is in use.

Inspired by the need for performability models for HSDPA user equipment, a Markovian queue with varying number of servers is conceived. The arrival and the service processes, the number of allocated or active servers of the queue are inherently, and independently (or jointly) Markov modulated. Batch arrivals, batch services, autocorrelation of inter-arrival times, and autocorrelation of batch sizes can be accommodated in the queue, by a suitable use of Markov modulation and generalized exponential distribution. The queue has a provision for negative customers too. Transformations of the balance equations into a computable form are proposed in order to obtain the steady state probabilities with the Spectral Expansion method. This queue is used to model the High Speed Downlink Packet Access (HSDPA) wireless networks. The model is an integrated one with respect to HSDPA, capable of accommodating many of the intricate aspects of HSDPA such as, channel allocation policy, loss of packets due to channel fading, bursty and correlated traffic. Good agreement is observed between the numerical results of the proposed analytical model and those of an independent simulator of real HSDPA and radio channel behaviors. The comparison of the terminal categories specified by the 3rd Generation Partnership Project (3GPP) is also presented.

Call-blocking probabilities are among the key performance measures in mobile communications networks. For their analysis, mobile networks can be modelled as networks of Erlang loss queues with common capacity restrictions dictated by the allocation of frequencies to the cells of the network. However, due to the time-varying load offered to the cells of such networks, blocking probabilities usually cannot be obtained in closed form. The relation between networks of Erlang loss queues and networks of infinite server queues, for which the time-dependent occupancy distribution is multidimensional Poisson, suggests to use that distribution as approximate distribution for the network of Erlang loss queues. This paper extends this so-called Modified Offered Load (MOL) approximation to networks of Erlang loss queues, and also allows subscribers that find their call blocked to redial to continue their call. For GSM networks operating under Fixed Channel Allocation, it is shown that blocking probabilities are increasing in the redial rates so that the MOL approximation that is most accurate for maximal redial rates turns out to be fairly accurate for the resulting upper bound for blocking probabilities. The accuracy is explicitly evaluated in an application of the results towards blocking probabilities in a hot spot travelling along a road through a GSM network.

The research of heterogeneous data collection devices and methods for mobile networks is an important research topic in the field of mobile communication nowadays. After the development of 3G, 4G and 5G, mobile communication networks are becoming more and more complex, the number of network elements is increasing, and the types of services are becoming more and more diversified. Traditional mobile networks encounter problems such as poor filtering flexibility and lack of good load balancing mechanism in the process of data collection. This paper optimizes the design of heterogeneous data collection devices and methods for mobile networks based on DPDK technology, which can greatly simplify the signaling collection scheme, increase the utilization, make the network more flexible, and improve the versatility of data collection equipment.

High-speed downlink packet access (HSDPA) achieves high data rates and high spectral efficiency by using adaptive modulation and coding schemes and employing multicode CDMA. In this paper, we present opportunistic algorithms for scheduling HSDPA users and selecting modulation/coding and multicode schemes that exploit channel and buffer variations to increase the probability of uninterrupted media play-out. First, we introduce a stochastic discrete event model for a HSDPA system. By employing the discrete event model, we transform the scheduling problem of providing uninterrupted play-out to a feasibility problem that considers two sets of stochastic quality-of-service (QoS) constraints: stability constraints and robustness constraints. A methodology for obtaining a feasible solution is then proposed by starting with a so-called stable algorithm that satisfies the stability QoS constraints. Next, we present stochastic approximation algorithms that adapt the parameters of the stable algorithm in a way that a feasible point for the robustness QoS is reached within the feasibility region of the stability QoS

Only best-effort traffic was supported by traditional packet switching networks, but newer applications need network services that allow an end-client to transport data with performance guarantees. The choice of packet-scheduling algorithm used at switching nodes is crucial in providing Quality of Service (QoS). This paper proposes a downlink packet scheduling algorithm for QoS provisioning in High Speed Downlink Packet Access (HSDPA) based UMTS networks. In HSDPA, a single logical channel is shared amongst multiple contending users. Besides better link utilization, scheduling disciplines seek to achieve fair allocation of this shared resource. However, these two criteria can potentially be in conflict. The scheduling algorithm proposed in this paper, Wireless Fair High Speed Scheduling, addresses this conflict. The basic idea is to allocate the wireless channel fairly amongst users, even during short time scales, according to their data rate requirements. Simulation results show that the proposed scheduling algorithm provides better link utilization, as well as long-term and short-term fairness amongst users, even under heavy load conditions.