B. Rong, Jacques Lebeau, M. Bennani, M. Kadoch, A. Elhakeem
In this paper, a traffic aggregation based SIP over MPLS network architecture is proposed to integrate SIP protocol with traffic engineering (TE) enabled MPLS network seamlessly and speed up the SIP call setup. We rely on OPNET simulation to assess the performance of this new network architecture. As a highlighted part, basic design concepts and implementation details of the simulation model are depicted intensively. The simulation results show that traffic aggregation based SIP over MPLS network architecture has satisfying performance in terms of SIP call setup delay, call blocking probability, and bandwidth utility efficiency.
本文提出了一种基于流量聚合的SIP over MPLS网络架构，将SIP协议与支持TE的MPLS网络无缝集成，加快了SIP呼叫的建立速度。我们依靠OPNET仿真来评估这种新网络架构的性能。重点介绍了仿真模型的基本设计概念和实现细节。仿真结果表明，基于流量聚合的SIP over MPLS网络架构在SIP呼叫建立延迟、呼叫阻塞概率和带宽利用效率等方面具有令人满意的性能。
{"title":"Modeling and simulation of traffic aggregation based SIP over MPLS network architecture","authors":"B. Rong, Jacques Lebeau, M. Bennani, M. Kadoch, A. Elhakeem","doi":"10.1109/ANSS.2005.31","DOIUrl":"https://doi.org/10.1109/ANSS.2005.31","url":null,"abstract":"In this paper, a traffic aggregation based SIP over MPLS network architecture is proposed to integrate SIP protocol with traffic engineering (TE) enabled MPLS network seamlessly and speed up the SIP call setup. We rely on OPNET simulation to assess the performance of this new network architecture. As a highlighted part, basic design concepts and implementation details of the simulation model are depicted intensively. The simulation results show that traffic aggregation based SIP over MPLS network architecture has satisfying performance in terms of SIP call setup delay, call blocking probability, and bandwidth utility efficiency.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"126 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132770013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Susanne Bürklen, P. Marrón, S. Fritsch, K. Rothermel
The performance evaluation of Web applications usually requires the analysis of sequences of user requests for specific Web pages. These sequences can be obtained, for example, by applying empirical methods (recording the real sequence of requests), or by applying a formal model for generating synthetic results. In this paper, we present our Web browsing model and its implementation as part of our novel user centric walk algorithm. By taking into account the hyperlink structure as well as the different user behavior on the Web, user centric walk allows us to generate accurate synthetic data that can be used instead of empirically obtained requests. Additionally, in this paper we show using empirical data that the probability of choosing some hyperlink from a given page as well as the probability of a user leaving a page without following a hyperlink is best characterized by a power-law. Finally, we show the flexibility and applicability of our model by performing the required correlations to empirical data, in order to validate our approach.
{"title":"User centric walk: an integrated approach for modeling the browsing behavior of users on the Web","authors":"Susanne Bürklen, P. Marrón, S. Fritsch, K. Rothermel","doi":"10.1109/ANSS.2005.44","DOIUrl":"https://doi.org/10.1109/ANSS.2005.44","url":null,"abstract":"The performance evaluation of Web applications usually requires the analysis of sequences of user requests for specific Web pages. These sequences can be obtained, for example, by applying empirical methods (recording the real sequence of requests), or by applying a formal model for generating synthetic results. In this paper, we present our Web browsing model and its implementation as part of our novel user centric walk algorithm. By taking into account the hyperlink structure as well as the different user behavior on the Web, user centric walk allows us to generate accurate synthetic data that can be used instead of empirically obtained requests. Additionally, in this paper we show using empirical data that the probability of choosing some hyperlink from a given page as well as the probability of a user leaving a page without following a hyperlink is best characterized by a power-law. Finally, we show the flexibility and applicability of our model by performing the required correlations to empirical data, in order to validate our approach.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"299302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116580313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Although the grid allows the researcher to tap a vast amount of resources, the complexity involved in utilizing this power can make it unwieldy and time-consuming. The Grid Interface for Parameter Sweeps and Exploration (GIPSE) toolset aims to solve this issue by freeing users from script debugging, storage issues, and other minutiae involved in managing simulations on the grid. GIPSE, which interacts seamlessly with existing grid software, abstracts interactions with the grid to present a research-centric view of the process rather than the typical task-centric view. GIPSE offers an alternative interface to the grid that removes the need for application specific wrappers around parameter-driven simulations and provides an interface to build data sets for visualization. In this paper, the authors discussed how GIPSE bridges a critical gap between existing tools and management of the overarching data result.
{"title":"GIPSE: streamlining the management of simulation on the grid","authors":"J. Wozniak, A. Striegel, D. Salyers, J. Izaguirre","doi":"10.1109/ANSS.2005.22","DOIUrl":"https://doi.org/10.1109/ANSS.2005.22","url":null,"abstract":"Although the grid allows the researcher to tap a vast amount of resources, the complexity involved in utilizing this power can make it unwieldy and time-consuming. The Grid Interface for Parameter Sweeps and Exploration (GIPSE) toolset aims to solve this issue by freeing users from script debugging, storage issues, and other minutiae involved in managing simulations on the grid. GIPSE, which interacts seamlessly with existing grid software, abstracts interactions with the grid to present a research-centric view of the process rather than the typical task-centric view. GIPSE offers an alternative interface to the grid that removes the need for application specific wrappers around parameter-driven simulations and provides an interface to build data sets for visualization. In this paper, the authors discussed how GIPSE bridges a critical gap between existing tools and management of the overarching data result.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131729744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The scalability of routing in large scale networks, such as the Internet, is critical to achieve low delay and high throughput. The lack of scalability of routing protocols in large-scale networks results from the prohibitive overhead incurred during dissemination of path metric values across the network. This paper addresses this problem and proposes a cluster-based scheme, referred to as d-median, which strikes a balance between scalability and routing efficiency. In this scheme, the link metric information is exchanged on a per-cluster basis, rather than on a per-node basis thereby reducing considerably the routing overhead. The simulation results show that the scheme exhibits better performance compared to existing models.
{"title":"On the Internet delay-based clustering","authors":"Nattaphol Jariyakul, T. Znati","doi":"10.1109/ANSS.2005.32","DOIUrl":"https://doi.org/10.1109/ANSS.2005.32","url":null,"abstract":"The scalability of routing in large scale networks, such as the Internet, is critical to achieve low delay and high throughput. The lack of scalability of routing protocols in large-scale networks results from the prohibitive overhead incurred during dissemination of path metric values across the network. This paper addresses this problem and proposes a cluster-based scheme, referred to as d-median, which strikes a balance between scalability and routing efficiency. In this scheme, the link metric information is exchanged on a per-cluster basis, rather than on a per-node basis thereby reducing considerably the routing overhead. The simulation results show that the scheme exhibits better performance compared to existing models.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115100390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：