排序方式: 共有7条查询结果,搜索用时 15 毫秒
1
1.
Modeling video sources for real-time scheduling 总被引:1,自引:0,他引:1
What is the impact of the autocorrelation of variable-bit-rate (VBR) sources on real-time scheduling algorithms? Our results show that the impact of long term, or interframe, autocorrelation is negligible, while the impact of short term, or intraframe, autocorrelation can be significant. Such results are essentially independent of the video coding scheme employed. To derive these results, video sequences are modeled as a collection of stationary subsequences called scenes. Within a scene, a statistical model is derived for both the sequence of frames and of slices. The model captures the distribution and the autocorrelation function of real-time video data. In previous work, the pseudoperiodicity of the slice level auto-correlation function made it difficult to develop a simple yet accurate model. We present a generalization of previous methods that can easily capture this pseudoperiodicity and is suited for modeling a greater variety of autocorrelation functions. By simply tuning a few parameters, the model reproduces the statistic behavior of sources with different types and levels of correlation on both the frame and the slice level. 相似文献
2.
We consider a multiuser network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own selfish performance measure. This measure accounts for the guaranteed call level quality of service, as well as for the cost incurred for reserving the resource. The interaction among the user strategies is formalized as a noncooperative game. We show that the game has a unique Nash equilibrium and that it possesses a certain fairness property. We investigate the dynamics of this game and prove convergence to the Nash equilibrium of both a Gauss-Seidel scheme and a Jacobi scheme. We extend our study to various general network topologies. Finally, the formal results and some extensions thereof are tested by emulating the schemes on an experimental network 相似文献
3.
IP over optical networks: architectural aspects 总被引:10,自引:0,他引:10
Rajagopalan B. Pendarakis D. Saha D. Ramamoorthy R.S. Bala K. 《Communications Magazine, IEEE》2000,38(9):94-102
The Internet transport infrastructure is moving toward a model of high-speed routers interconnected by intelligent optical core networks. A consensus is emerging in the industry on utilizing an IP-centric control plane within optical networks to support dynamic provisioning and restoration of lightpaths. At the same time, there are divergent views on how IP routers must interact with optical core networks to achieve end-to-end connectivity. This article describes the architectural alternatives for interconnecting IP routers over optical networks, considering the routing and signaling issues. Also, the application of IP-based protocols for dynamic provisioning and restoration of lightpaths, as well as the interworking of multivendor optical networks is described 相似文献
4.
5.
6.
7.
Minkyong Kim Zhen Liu Srinivasan Parthasarathy Dimitrios Pendarakis Hao Yang 《Wireless Networks》2012,18(5):535-550
As mobile nodes roam in a wireless network, they continuously associate with different access points and perform handoff operations. Frequent handoffs performed by a mobile device may have undesirable consequences, as they can cause interruptions for interactive applications and increase the energy usage of mobile devices. While existing approaches to this issue focus entirely on improving the latency incurred by individual handoffs, in this paper, we initiate a novel approach to association control of mobile devices with the goal of reducing the frequency of handoffs for mobile devices. We study the handoff minimization problem across multiple dimensions: offline versus online where the complete knowledge of mobility patterns of users is known in advance or unknown respectively; capacity constrained versus unconstrained access points, which imposes limits on the number of mobile devices which could be associated with a given access point at any given point in time; group mobility versus arbitrary mobility of users, which are contrasting ways to model the mobility patterns of the mobile users. We consider various combinations of the above dimensions and present the following: (1) optimal algorithms, (2) provably-good online and offline approximation algorithms, (3) complexity (NP-Completeness) results, and (4) a practical heuristic which is demonstrated to work well on real network traces. 相似文献
1