Thematische Bibliographien / Time-Varying capacity networks

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Time-Varying capacity networks“

Autor: Grafiati

Veröffentlicht am 24. Mai 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Time-Varying capacity networks" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Time-Varying capacity networks"

Sas, Bart, Elena Bernal-Mor, Kathleen Spaey, Vicent Pla, Chris Blondia und Jorge Martinez-Bauset. „Modelling the time-varying cell capacity in LTE networks“. Telecommunication Systems 55, Nr. 2 (08.08.2013): 299–313. http://dx.doi.org/10.1007/s11235-013-9782-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

KUMARI, SUCHI, und ANURAG SINGH. „TIME-VARYING NETWORK MODELING AND ITS OPTIMAL ROUTING STRATEGY“. Advances in Complex Systems 21, Nr. 02 (März 2018): 1850006. http://dx.doi.org/10.1142/s0219525918500066.

Der volle Inhalt der Quelle

Annotation:

Since all the existing real world networks are evolving, the study of traffic dynamics is a challenging task. Avoidance of traffic congestion, system utility maximization and enhancement of network capacity are prominent issues. Network capacity may be improved either by optimizing network topology or enhancing in routing approach. In this context, we propose and design a model of the time-varying data communication networks (TVCN) based on the dynamics of inflowing links. Traffic congestion can be avoided by using a suitable centrality measure, especially betweenness and Eigen vector centralities. If the nodes coming in user’s route are most betweenness central, then that route will be highly congested. Eigen vector centrality is used to find the influence of a node on others. If a node is most influential, then it will be highly congested and considered as least reputed. For that reason, routes are chosen such that the sum of the centralities of the nodes coming in user’s route should be minimum. Furthermore, Kelly’s optimization formulation for a rate allocation problem is used for obtaining optimal rates of distinct users at different time instants and it is found that the user’s path with lowest betweenness centrality and highest reputation will always give maximum rate at the stable point.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bhadra, Sandeep, Yingdong Lu und Mark S. Squillante. „Optimal capacity planning in stochastic loss networks with time-varying workloads“. ACM SIGMETRICS Performance Evaluation Review 35, Nr. 1 (12.06.2007): 227–38. http://dx.doi.org/10.1145/1269899.1254909.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Abrantes, F., Joao Taveira Araújo und M. Ricardo. „Explicit Congestion Control Algorithms for Time Varying Capacity Media“. IEEE Transactions on Mobile Computing 10, Nr. 1 (Januar 2011): 81–93. http://dx.doi.org/10.1109/tmc.2010.143.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Amiri, Ali, und Hasan Pirkul. „Routing and capacity assignment in backbone communication networks under time varying traffic conditions“. European Journal of Operational Research 117, Nr. 1 (August 1999): 15–29. http://dx.doi.org/10.1016/s0377-2217(98)00162-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Supittayapornpong, Sucha, und Poompat Saengudomlert. „Joint Flow Control, Routing and Medium Access Control in Random Access Multi-Hop Wireless Networks with Time Varying Link Capacities“. ECTI Transactions on Electrical Engineering, Electronics, and Communications 8, Nr. 1 (01.08.2009): 22–31. http://dx.doi.org/10.37936/ecti-eec.201081.171988.

Der volle Inhalt der Quelle

Annotation:

This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framework where link capacities vary over time. The overall problem is formulated as a long term network utility maximization (NUM) problem (instead of the existing static NUM problem) that accounts for link capacity variation. This dynamic formulation is more realistic than the static one, and is one step closer to practical networks. Under the stationary and ergodic assumptions on the link capacity variation, the problem is decomposed to form a distributed algorithm. The algorithm samples current link capacities while it is iteratively and locally updating flow rates and link transmission probabilities. Simulation results demonstrate the ability of the algorithm to sustain the optimal average data rates despite the link capacity variation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Huang, Ping, Xiao-Long Chen, Ming Tang und Shi-Min Cai. „Coupled Dynamic Model of Resource Diffusion and Epidemic Spreading in Time-Varying Multiplex Networks“. Complexity 2021 (27.03.2021): 1–11. http://dx.doi.org/10.1155/2021/6629105.

Der volle Inhalt der Quelle

Annotation:

In the real world, individual resources are crucial for patients when epidemics outbreak. Thus, the coupled dynamics of resource diffusion and epidemic spreading have been widely investigated when the recovery of diseases significantly depends on the resources from neighbors in static social networks. However, the social relationships of individuals are time-varying, which affects such coupled dynamics. For that, we propose a coupled resource-epidemic (RNR-SIS) dynamic model (coupled model for short) on a time-varying multiplex network to synchronously simulate the resource diffusion and epidemic spreading in dynamic social networks. The equilibrium analysis of the coupled model is conducted in a general scenario where the resource generation varies between susceptible and infected states and the recovery rate changes between resourceful and noresource states. By using the microscopic Markov chain approach and Monte Carlo simulations, we determine a probabilistic framework of the intralayer and interlayer dynamic processes of the coupled model and obtain the outbreak threshold of epidemic spreading. Meanwhile, the experimental results show the trivially asymmetric interactions between resource diffusion and epidemic spreading. They also indicate that the stronger activity heterogeneity and the larger contact capacity of individuals in the resource layer can more greatly promote resource diffusion, effectively suppressing epidemic spreading. However, these two individual characters in the epidemic layer can cause more resource depletion, which greatly promotes epidemic spreading. Furthermore, we also find that the contact capacity finitely impacts the coupled dynamics of resource diffusion and epidemic spreading.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xu, Yao, Renren Wang, Hongqian Lu, Xingxing Song, Yahan Deng und Wuneng Zhou. „Adaptive Event-Triggered Synchronization of Networked Neural Networks with Time-Varying Delay Subject to Actuator Saturation“. Complexity 2021 (07.07.2021): 1–14. http://dx.doi.org/10.1155/2021/9957624.

Der volle Inhalt der Quelle

Annotation:

This paper discusses the adaptive event-triggered synchronization problem of a class of neural networks (NNs) with time-varying delay and actuator saturation. First, in view of the limited communication channel capacity of the network system and unnecessary data transmission in the NCSs, an adaptive event-triggered scheme (AETS) is introduced to reduce the network load and improve network utilization. Second, under the AETS, the synchronization error model of the delayed master-slave synchronization system is constructed with actuator saturation. Third, based on Lyapunov–Krasovskii functional (LKF), a new sufficient criterion to guarantee the asymptotic stability of the synchronization error system is derived. Moreover, by solving the stability criterion expressed in the form of a set of linear matrix inequalities (LMIs), some necessary parameters of the system are obtained. At last, two examples are expressed to demonstrate the feasibility of this method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Shao, Junyi, Shuai Zhang, Weiqiang Sun und Weisheng Hu. „Dimensioning access link capacity for time-varying traffic with mixed packet streams and circuit connections“. Journal of Optical Communications and Networking 13, Nr. 11 (20.08.2021): 276. http://dx.doi.org/10.1364/jocn.432651.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kennedy, Okokpujie, Emmanuel Chukwu, Olamilekan Shobayo, Etinosa Noma-Osaghae, Imhade Okokpujie und Modupe Odusami. „Comparative analysis of the performance of various active queue management techniques to varying wireless network conditions“. International Journal of Electrical and Computer Engineering (IJECE) 9, Nr. 1 (01.02.2019): 359. http://dx.doi.org/10.11591/ijece.v9i1.pp359-368.

Der volle Inhalt der Quelle

Annotation:

This paper demonstrates the robustness of active queue management techniques to varying load, link capacity and propagation delay in a wireless environment. The performances of four standard controllers used in Transmission Control Protocol/Active Queue Management (TCP/AQM) systems were compared. The active queue management controllers were the Fixed-Parameter Proportional Integral (PI), Random Early Detection (RED), Self-Tuning Regulator (STR) and the Model Predictive Control (MPC). The robustness of the congestion control algorithm of each technique was documented by simulating the varying conditions using MATLAB® and Simulink® software. From the results obtained, the MPC controller gives the best result in terms of response time and controllability in a wireless network with varying link capacity and propagation delay. Thus, the MPC controller is the best bet when adaptive algorithms are to be employed in a wireless network environment. The MPC controller can also be recommended for heterogeneous networks where the network load cannot be estimated.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Time-Varying capacity networks"

Ky, Joël Roman. „Anomaly Detection and Root Cause Diagnosis for Low-Latency Applications in Time-Varying Capacity Networks“. Electronic Thesis or Diss., Université de Lorraine, 2025. http://www.theses.fr/2025LORR0026.

Der volle Inhalt der Quelle

Annotation:

L'évolution des réseaux a conduit à l'émergence d'applications à faible latence (FL) telles que le cloud gaming (CG) et la réalité virtuelle basée sur le cloud (Cloud VR), qui exigent des conditions réseau strictes, notamment une faible latence et une bande passante élevée. Cependant, les réseaux à capacité variable introduisent des dégradations, telles que du délai, des fluctuations de bande passante et des pertes de paquets, qui peuvent significativement altérer l'expérience utilisateur sur les applications FL. Cette thèse vise à concevoir des méthodologies pour détecter et diagnostiquer les anomalies de performance des applications FL fonctionnant sur des réseaux cellulaires et Wi-Fi. Pour atteindre cet objectif, des bancs d'essai expérimentaux réalistes ont été mis en place pour collecter des bases de données caractérisant les performances du réseau et capturant les indicateurs clés de performance (KPI) des applications CG et Cloud VR dans des environnements 4G et Wi-Fi. Ces données constituent la base de l'évaluation et du développement d'algorithmes de détection d'anomalies et de diagnostic basés sur l'apprentissage automatique. Les principales contributions de cette thèse incluent le développement de CATS, une solution de détection d'anomalies basé sur l'apprentissage contrastif, capable d'identifier efficacement les dégradations de l'expérience utilisateur dans les applications CG tout en restant robuste face à la contamination des données. De plus, cette thèse introduit RAID, un système de diagnostic en deux étapes conçu pour identifier les causes racines des problèmes de performance dans le Cloud VR. RAID a démontré une grande efficacité dans le diagnostic des dégradations Wi-Fi, même avec un nombre limité de données annotées. Les résultats de ce travail font progresser les domaines de la détection d'anomalies et du diagnostic des causes racines, offrant des perspectives concrètes aux opérateurs de réseaux pour optimiser les performances de leurs réseaux et améliorer la fiabilité des services et mieux supporter les applications FL, qui sont appelées à révolutionner les technologies de communication et à stimuler l'innovation dans de nombreuses industries
The evolution of networks has driven the emergence of low-latency (LL) applications such as cloud gaming (CG) and cloud virtual reality (Cloud VR), which demand stringent network conditions, including low latency and high bandwidth. However, time-varying capacity networks introduce impairments such as delays, bandwidth fluctuations, and packet loss, which can significantly degrade user experience on LL applications. This research aims to design methodologies for detecting and diagnosing performance anomalies in LL applications operating over cellular and Wi- Fi networks. To achieve this, realistic experimental testbeds were established to collect datasets that characterize network performance and capture key performance indicators (KPIs) of CG and Cloud VR applications over 4G and Wi-Fi environments. These datasets serve as the foundation for evaluating and developing machine learning-based anomaly detection and diagnostic frameworks. The key contributions of this thesis include the development of CATS, a contrastive learning-based anomaly detection framework capable of efficiently identifying user experience degradation in CG applications while remaining robust to data contamination. Additionally, this research introduces RAID, a two-stage root causes diagnosis framework designed to pinpoint the root causes of performance issues in Cloud VR. RAID demonstrated high efficiency in diagnosing Wi-Fi impairments, even with limited labeled data. The findings of this work advance the fields of anomaly detection and root cause diagnosis, offering actionable insights for network operators to optimize network performance and enhance service reliability to support LL applications, which are set to revolutionize communication technologies and drive innovation across various industries

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Time-Varying capacity networks"

Salazar, Jonathan, Diego Carrión und Manuel Jaramillo. „Impact Analysis on Voltage Stability by Inserting Non-Linear Loads Through a Dynamic Stability Index“. In Lecture Notes in Networks and Systems, 373–83. Cham: Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-87065-1_34.

Der volle Inhalt der Quelle

Annotation:

Abstract Modern power systems are exposed to various operating conditions that affect the steady-state operation of the system. Several researchers focus on monitoring dynamic loads and their impact on short-term stability, considering factors such as planning, expansion, management, and system capacity through VQ sensitivity analysis, determining the most sensitive bus to reactive power variation. Determining short-term stability helps operators take predictive actions in case of changes in the system, such as the entry of induction machines. The present research is focused on establishing a stability index to evaluate the system’s stability in a short-term dynamic state by incorporating nonlinear dynamic loads, as in the case of induction motors. The behavior of the proposed dynamic index, which has been called the Novel Index Stability Index (NISV), has been evaluated in several scenarios considering the IEEE 14-bar system, where the performance of the index is verified and how, when varying different conditions of the nonlinear load in time, it presents unstable conditions when faced with changes of the same.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yan, Gongjun, Danda B. Rawat, Bhed Bahadur Bista, Wu He und Awny Alnusair. „Privacy Protection in Vehicular Ad-Hoc Networks“. In Transportation Systems and Engineering, 272–309. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-8473-7.ch013.

Der volle Inhalt der Quelle

Annotation:

The first main contribution of this chapter is to take a non-trivial step towards providing a robust and scalable solution to privacy protection in vehicular networks. To promote scalability and robustness the authors employ two strategies. First, they view vehicular networks as consisting of non-overlapping subnetworks, each local to a geographic area referred to as a cell. Each cell has a server that maintains a list of pseudonyms that are valid for use in the cell. Each pseudonym has two components: the cell's ID and a random number as host ID. Instead of issuing pseudonyms to vehicles proactively (as virtually all existing schemes do) the authors issue pseudonyms only to those vehicles that request them. This strategy is suggested by the fact that, in a typical scenario, only a fraction of the vehicles in an area will engage in communication with other vehicles and/or with the infrastructure and, therefore, do not need pseudonyms. The second main contribution is to model analytically the time-varying request for pseudonyms in a given cell. This is important for capacity planning purposes since it allows system managers to predict, by taking into account the time-varying attributes of the traffic, the probability that a given number of pseudonyms will be required at a certain time as well as the expected number of pseudonyms in use in a cell at a certain time. Empirical results obtained by detailed simulation confirm the accuracy of the authors' analytical predictions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yan, Gongjun, Danda B. Rawat, Bhed Bahadur Bista, Wu He und Awny Alnusair. „Privacy Protection in Vehicular Ad-Hoc Networks“. In Security, Privacy, Trust, and Resource Management in Mobile and Wireless Communications, 295–332. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-4691-9.ch013.

Der volle Inhalt der Quelle

Annotation:

The first main contribution of this chapter is to take a non-trivial step towards providing a robust and scalable solution to privacy protection in vehicular networks. To promote scalability and robustness the authors employ two strategies. First, they view vehicular networks as consisting of non-overlapping subnetworks, each local to a geographic area referred to as a cell. Each cell has a server that maintains a list of pseudonyms that are valid for use in the cell. Each pseudonym has two components: the cell’s ID and a random number as host ID. Instead of issuing pseudonyms to vehicles proactively (as virtually all existing schemes do) the authors issue pseudonyms only to those vehicles that request them. This strategy is suggested by the fact that, in a typical scenario, only a fraction of the vehicles in an area will engage in communication with other vehicles and/or with the infrastructure and, therefore, do not need pseudonyms. The second main contribution is to model analytically the time-varying request for pseudonyms in a given cell. This is important for capacity planning purposes since it allows system managers to predict, by taking into account the time-varying attributes of the traffic, the probability that a given number of pseudonyms will be required at a certain time as well as the expected number of pseudonyms in use in a cell at a certain time. Empirical results obtained by detailed simulation confirm the accuracy of the authors’ analytical predictions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ma, Maode, und Jinchang Lu. „QoS Support Mechanisms in WiMAX“. In Wireless Network Traffic and Quality of Service Support, 330–46. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-61520-771-8.ch013.

Der volle Inhalt der Quelle

Annotation:

Quality of service (QoS) provisioning is an important issue in the deployment of broadband wireless access networks e.g. WiMAX (IEEE Std 802.16-2004, 2004) networks with real-time and non-real-time traffic integrated. To design a QoS support framework tailored for WiMAX networks is more challenge as wireless channel has unique characteristics such as time-varying channel and limited channel capacity. This chapter presents various QoS support mechanisms in WiMAX networks. Existing proposals with the state-of-the-art technology have been classified into three main categories: QoS support architecture, bandwidth management mechanism, and packet scheduling schemes. Representative schemes from each of the categories have been evaluated with respect to major distinguishing characteristics of the WiMAX MAC layer and PHY layer as specified in the IEEE 802.16d standard. Suggestions and research trends on QoS support in WiMAX networks are highlighted.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gao, Yuan, Hai Fang und Kan Wang. „Cost-Efficient Service Function Chaining with CoMP Zero-Forcing Beamforming in Mobile Edge Networks“. In Frontiers in Artificial Intelligence and Applications. IOS Press, 2022. http://dx.doi.org/10.3233/faia220568.

Der volle Inhalt der Quelle

Annotation:

As two promising paradigms in next generation cellular systems, service function chaining (SFC) and mobile edge computing (MEC) have attracted great interests, and would bring more delay-sensitive services to users in proximity. Nevertheless, owing to time-varying channel conditions and finite server resources, the SFC deployment in edge networks is nontrivial. In this work, leveraging both the coordinated multiple points (CoMP)-based zero-forcing beamforming and ℓp (0 < p < 1) norm-based successive convex approximation (SCA) methods, we investigate the SFC deployment in the edge. First, under the constraints of processing and link capacity, transmission power and service function ordering, we build a mixed-integer nonlinear programming (MINLP)-based cost optimization problem, to minimize both the flow and power cost. Then, using the dirty paper-based CoMP zero-forcing beamforming method, the interference among SFSs is canceled, and the original problem is recast as a interference-free one. Next, the ℓp (0 < p < 1) norm-based SCA method works to produce a series of convex subproblem, the iterative solution of which is proved to converge to optimal solution of original one at a linear convergence rate. Finally, numerical results are used to validate proposed method, showing that the wireless resource management deserves special interests in the SFC deployment in edge networks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vendictis, Andrea De, und Andrea Baiocchi. „Investigating TCP single source behavior in time-varying capacity network scenarios“. In Providing Quality of Service in Heterogeneous Environments, Proceedings of the 18th International Teletraffic Congress - ITC-18, 671–80. Elsevier, 2003. http://dx.doi.org/10.1016/s1388-3437(03)80216-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bojkovic, Zoran, Bojan Bakmaz und Miodrag Bakmaz. „Principles and Enabling Technologies of 5G Network Slicing“. In Paving the Way for 5G Through the Convergence of Wireless Systems, 271–84. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7570-2.ch011.

Der volle Inhalt der Quelle

Annotation:

5G mobile systems can be comprehended as highly flexible and programmable E2E networking infrastructures that provide increased performance in terms of capacity, latency, reliability, and energy efficiency while meeting a plethora of diverse requirements from multiple services. Network slicing is emerging as a prospective paradigm to meet these requirements with reduced operating cost and improved time and space functionality. A network slice is the way to provide better resource isolation and increased statistical multiplexing. With dynamic slicing, 5G will operate on flexible zone of the network, permitting varying, adaptable levels or bandwidth and reliability. In this chapter, a comprehensive survey of network slicing is presented from an E2E perspective, detailing its origination and current standardization efforts, principal concepts, enabling technologies, as well as applicable solutions. In particular, it provides specific slicing solutions for each part of the 5G systems, encompassing orchestration and management in the radio access and the core network domains.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Azzam-ul-Asar, M. Sadeeq Ullah, Mudasser F. Wyne, Jamal Ahmed und Riaz-ul-Hasnain. „Traffic Responsive Signal Timing Plan Generation based on Neural Network“. In Intelligent, Adaptive and Reasoning Technologies, 229–40. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-60960-595-7.ch012.

Der volle Inhalt der Quelle

Annotation:

This paper proposes a neural network based traffic signal controller, which eliminates most of the problems associated with the Traffic Responsive Plan Selection (TRPS) mode of the closed loop system. Instead of storing timing plans for different traffic scenarios, which requires clustering and threshold calculations, the proposed approach uses an Artificial Neural Network (ANN) model that produces optimal plans based on optimized weights obtained through its learning phase. Clustering in a closed loop system is root of the problems and therefore has been eliminated in the proposed approach. The Particle Swarm Optimization (PSO) technique has been used both in the learning rule of ANN as well as generating training cases for ANN in terms of optimized timing plans, based on Highway Capacity Manual (HCM) delay for all traffic demands found in historical data. The ANN generates optimal plans online to address real time traffic demands and thus is more responsive to varying traffic conditions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Time-Varying capacity networks"

Gao, Ying, Ruiying Li und Rui Kang. „Capacity and Time Reliability Evaluation for Time-Varying Networks“. In 2024 IEEE 24th International Conference on Software Quality, Reliability, and Security Companion (QRS-C), 170–76. IEEE, 2024. http://dx.doi.org/10.1109/qrs-c63300.2024.00032.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhu, Xiangming, Yong LI, Depeng Jin und Pan Hui. „Temporal capacity graphs for time-varying mobile networks“. In the 23rd International Conference. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2567948.2579362.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bouterse, Brian, Harry Perros und David Thuente. „Multiobjective cloud capacity planning for time-varying customer demand“. In 2014 11th Annual High-capacity Optical Networks and Emerging/Enabling Technologies (HONET). IEEE, 2014. http://dx.doi.org/10.1109/honet.2014.7029367.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Taylor, Stephen, und Parastoo Sadeghi. „Capacity analysis of time-varying flat-fading channels using particle methods“. In 2007 Australasian Telecommunication Networks and Applications Conference (ATNAC 2007). IEEE, 2007. http://dx.doi.org/10.1109/atnac.2007.4665274.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wu, Meng, Wenda Ni, Yabin Ye, Xiaoping Zheng, Yili Guo und Hanyi Zhang. „Capacity allocation for time-varying traffic in survivable WDM mesh networks“. In Asia Pacific Optical Communications, herausgegeben von Weisheng Hu, Shoa-Kai Liu, Ken-ichi Sato und Lena Wosinska. SPIE, 2008. http://dx.doi.org/10.1117/12.804301.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bhadra, Sandeep, Yingdong Lu und Mark S. Squillante. „Optimal capacity planning in stochastic loss networks with time-varying workloads“. In the 2007 ACM SIGMETRICS international conference. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1254882.1254909.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Iosifidis, George, Iordanis Koutsopoulos und Georgios Smaragdakis. „The impact of storage capacity on end-to-end delay in time varying networks“. In IEEE INFOCOM 2011 - IEEE Conference on Computer Communications. IEEE, 2011. http://dx.doi.org/10.1109/infcom.2011.5934938.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khattabi, Yazid, und Mustafa M. Matalgah. „Performance analysis of AF cooperative networks with time-varying links: Error rate and capacity“. In 2014 Wireless Telecommunications Symposium (WTS). IEEE, 2014. http://dx.doi.org/10.1109/wts.2014.6835001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sas, B., E. Bernal-Mor, K. Spaey, V. Pla, C. Blondia und J. Martinez-Bauset. „An analytical model to study the impact of time-varying cell capacity in LTE networks“. In 2011 4th Joint IFIP Wireless and Mobile Networking Conference. IEEE, 2011. http://dx.doi.org/10.1109/wmnc.2011.6097234.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Karimi, H. R., N. A. Duffie und S. Dashkovskiy. „Local capacity H∞ control for production networks of autonomous work systems with time-varying delays“. In 2009 European Control Conference (ECC). IEEE, 2009. http://dx.doi.org/10.23919/ecc.2009.7074761.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!