Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240670
Shudong Jin, Azer Bestavros
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Internet topologies, but also for the proper evaluation of network algorithms and protocols. Along this line, this paper tries to answer how small-world behavior arises in the Internet topologies and how it impacts the performance of multicast techniques. First, we attribute small-world behavior to two possible causes: the variability of vertex degree and the preference of vertices to have local connections. We found that both factors contribute with different relative degrees to the small-world behavior of the AS-level and router-level Internet topologies. For the AS-level topology, we have observed that extremely high variability of vertex degree is sufficient to cause small-world behavior, but for the router-level topology, preference for local connectivity plays a more important role. Second, we propose simple models to generate more realistic small-world Internet topologies. Our models consider both causes of small-world behavior. Third, we demonstrate the significance of our work by studying the scaling behavior of IP multicast tree size. We show that if topology generators capture only the variability of vertex degree, they are likely to underestimate the efficacy of multicast techniques.
{"title":"Small-world characteristics of the Internet and multicast scaling","authors":"Shudong Jin, Azer Bestavros","doi":"10.1109/MASCOT.2003.1240670","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240670","url":null,"abstract":"Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Internet topologies, but also for the proper evaluation of network algorithms and protocols. Along this line, this paper tries to answer how small-world behavior arises in the Internet topologies and how it impacts the performance of multicast techniques. First, we attribute small-world behavior to two possible causes: the variability of vertex degree and the preference of vertices to have local connections. We found that both factors contribute with different relative degrees to the small-world behavior of the AS-level and router-level Internet topologies. For the AS-level topology, we have observed that extremely high variability of vertex degree is sufficient to cause small-world behavior, but for the router-level topology, preference for local connectivity plays a more important role. Second, we propose simple models to generate more realistic small-world Internet topologies. Our models consider both causes of small-world behavior. Third, we demonstrate the significance of our work by studying the scaling behavior of IP multicast tree size. We show that if topology generators capture only the variability of vertex degree, they are likely to underestimate the efficacy of multicast techniques.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119440","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240646
Ming Zhang, Qing Yang, Xubin He
In this paper we introduce SPEK (storage performance evaluation kernel module), a benchmarking tool for measuring and characterizing raw performance of data storage systems at block level. It can be used for both DAS (direct attached storage) and block level networked storage systems. Each SPEK tool consists of a controller, several workers, and one or more probers. Each worker is a kernel module generating I/O requests to lower level SCSI layer directly. Compared to traditional file system I/O and disk I/O benchmarking tools, SPEK is highly accurate and efficient since it runs at kernel level and eliminates file system overheads. It is specially suitable for accurately measuring raw performance of data storages at block level without influence of file system cache or buffer cache. Using SPEK, a user can easily simulate realistic workloads and produce detailed profiling data for networked storage as well as DAS. We have built a prototype on Linux and our experiments have demonstrated its accuracy and efficiency in measuring block level storage systems.
{"title":"SPEK: a storage performance evaluation kernel module for block level storage systems","authors":"Ming Zhang, Qing Yang, Xubin He","doi":"10.1109/MASCOT.2003.1240646","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240646","url":null,"abstract":"In this paper we introduce SPEK (storage performance evaluation kernel module), a benchmarking tool for measuring and characterizing raw performance of data storage systems at block level. It can be used for both DAS (direct attached storage) and block level networked storage systems. Each SPEK tool consists of a controller, several workers, and one or more probers. Each worker is a kernel module generating I/O requests to lower level SCSI layer directly. Compared to traditional file system I/O and disk I/O benchmarking tools, SPEK is highly accurate and efficient since it runs at kernel level and eliminates file system overheads. It is specially suitable for accurately measuring raw performance of data storages at block level without influence of file system cache or buffer cache. Using SPEK, a user can easily simulate realistic workloads and produce detailed profiling data for networked storage as well as DAS. We have built a prototype on Linux and our experiments have demonstrated its accuracy and efficiency in measuring block level storage systems.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128316096","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240653
K. Al-Begain, I. Awan
One of the main features of the third generation (3G) mobile networks is their capability to provide different classes of services; especially multimedia and real-time services in addition to the traditional telephony and data services. These new services, however, will require higher quality of service (QoS) constraints on the network mainly regarding delay, delay variation and packet loss. Additionally, the overall traffic profile in both the air interface and inside the network will be rather different than used to be in today's mobile networks. Therefore, providing QoS for the new services will require more than what a call admission control algorithm can achieve at the border of the network. Continuous buffer control in both the wireless and the fixed part of the network ensures that higher priority traffic is treated in the proper way. This paper proposes and analytically evaluates a buffer management scheme that is based on multilevel priority and partial buffer sharing (PBS) policy for all buffers at the border and inside the wireless network. The analytical model is based on the G/G/1/N censored queue with single server and R (R /spl ges/ 2) priority classes under the head of line (HOL) service rule for the PBS scheme. The traffic is modelled using the generalised exponential distribution. The paper presents an analytical solution based on the approximation using the maximum entropy (ME) principle. The numerical results show the capability of the space prioritised buffer management scheme to provide higher QoS for the higher priority service classes.
{"title":"Modelling differentiated services in UMTS networks","authors":"K. Al-Begain, I. Awan","doi":"10.1109/MASCOT.2003.1240653","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240653","url":null,"abstract":"One of the main features of the third generation (3G) mobile networks is their capability to provide different classes of services; especially multimedia and real-time services in addition to the traditional telephony and data services. These new services, however, will require higher quality of service (QoS) constraints on the network mainly regarding delay, delay variation and packet loss. Additionally, the overall traffic profile in both the air interface and inside the network will be rather different than used to be in today's mobile networks. Therefore, providing QoS for the new services will require more than what a call admission control algorithm can achieve at the border of the network. Continuous buffer control in both the wireless and the fixed part of the network ensures that higher priority traffic is treated in the proper way. This paper proposes and analytically evaluates a buffer management scheme that is based on multilevel priority and partial buffer sharing (PBS) policy for all buffers at the border and inside the wireless network. The analytical model is based on the G/G/1/N censored queue with single server and R (R /spl ges/ 2) priority classes under the head of line (HOL) service rule for the PBS scheme. The traffic is modelled using the generalised exponential distribution. The paper presents an analytical solution based on the approximation using the maximum entropy (ME) principle. The numerical results show the capability of the space prioritised buffer management scheme to provide higher QoS for the higher priority service classes.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128100720","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240656
M. Bernardo
TwoTowers is a software tool for the functional verification and performance evaluation of computer, communication and software systems represented through stochastic process algebra (SPA). In this paper we describe a novel version (3.0), in which the modeling language is no longer a pure SPA, but a SPA-based architectural description language called AEmilia. We show that Two Towers 3.0 improves on the previous version in terms of usability, because AEmilia hides most of the technicalities of SPA, and also in terms of efficiency, because a new algorithm for state space generation has been implemented.
{"title":"Twotowers 3.0: enhancing usability","authors":"M. Bernardo","doi":"10.1109/MASCOT.2003.1240656","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240656","url":null,"abstract":"TwoTowers is a software tool for the functional verification and performance evaluation of computer, communication and software systems represented through stochastic process algebra (SPA). In this paper we describe a novel version (3.0), in which the modeling language is no longer a pure SPA, but a SPA-based architectural description language called AEmilia. We show that Two Towers 3.0 improves on the previous version in terms of usability, because AEmilia hides most of the technicalities of SPA, and also in terms of efficiency, because a new algorithm for state space generation has been implemented.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"432 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114431634","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240645
H. T. Kaur, Tao Ye, S. Kalyanaraman, K. Vastola
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using online simulation. We have chosen packet loss rate in the network as the optimization metric as it is a good indicator of congestion and impacts the performance of the underlying applications. We have formulated packet loss rate in the network in terms of the link parameters, such as bandwidth and buffer space, and the parameters of the traffic demands. A GI/M/1/K queuing model has been used to compute the packet drop probability on a given link. The problem of optimizing OSPF weights is known to be NP-hard even for the case of a linear objective function Bernard Fortz and Mikkel Thorup (2000), We use online simulation (OLS) framework T. Ye et al. (2001) to search for a good link weight setting and as a tool for automatic network management. OLS uses fast, scalable recursive random search (RRS) algorithm to search the parameter space. Our results demonstrate that the RRS takes 50-90% fewer function evaluations as compared to the local search heuristic Bernard Fortz and Mikkel Thorup (2000) of to find a "good" link weight setting. The amount of improvement depends on the network topology, traffic conditions and optimization metric. We have simulated the proposed OSPF optimization scheme using ns and our results demonstrate improvements of the order of 30-60% in the total packet drop rate for the traffic and topologies considered.
{"title":"Minimizing packet loss by optimizing OSPF weights using online simulation","authors":"H. T. Kaur, Tao Ye, S. Kalyanaraman, K. Vastola","doi":"10.1109/MASCOT.2003.1240645","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240645","url":null,"abstract":"In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using online simulation. We have chosen packet loss rate in the network as the optimization metric as it is a good indicator of congestion and impacts the performance of the underlying applications. We have formulated packet loss rate in the network in terms of the link parameters, such as bandwidth and buffer space, and the parameters of the traffic demands. A GI/M/1/K queuing model has been used to compute the packet drop probability on a given link. The problem of optimizing OSPF weights is known to be NP-hard even for the case of a linear objective function Bernard Fortz and Mikkel Thorup (2000), We use online simulation (OLS) framework T. Ye et al. (2001) to search for a good link weight setting and as a tool for automatic network management. OLS uses fast, scalable recursive random search (RRS) algorithm to search the parameter space. Our results demonstrate that the RRS takes 50-90% fewer function evaluations as compared to the local search heuristic Bernard Fortz and Mikkel Thorup (2000) of to find a \"good\" link weight setting. The amount of improvement depends on the network topology, traffic conditions and optimization metric. We have simulated the proposed OSPF optimization scheme using ns and our results demonstrate improvements of the order of 30-60% in the total packet drop rate for the traffic and topologies considered.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122640318","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240664
N. Bartolini, E. Casalicchio, Salvatore Tucci
This paper addresses the problem of mobility management in content delivery networks (CDN). We introduce a CDN architecture where admission control is performed at mobility aware access routers. We formulate a Markov modulated Poisson decision process for access control that captures the bursty nature of data and packetized traffic together with the heterogeneity of multimedia services. The optimization of performance parameters, like the blocking probabilities and the overall utilization, is conducted and the structural properties of the optimal solutions are also studied. Heuristics are proposed to encompass the computational difficulties of the optimal solution when several classes of multimedia traffic are considered.
{"title":"Optimal mobility-aware admission control in content delivery networks","authors":"N. Bartolini, E. Casalicchio, Salvatore Tucci","doi":"10.1109/MASCOT.2003.1240664","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240664","url":null,"abstract":"This paper addresses the problem of mobility management in content delivery networks (CDN). We introduce a CDN architecture where admission control is performed at mobility aware access routers. We formulate a Markov modulated Poisson decision process for access control that captures the bursty nature of data and packetized traffic together with the heterogeneity of multimedia services. The optimization of performance parameters, like the blocking probabilities and the overall utilization, is conducted and the structural properties of the optimal solutions are also studied. Heuristics are proposed to encompass the computational difficulties of the optimal solution when several classes of multimedia traffic are considered.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121949523","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240655
R. Iyer
The efficient use of cache hierarchies is crucial to the performance of uni-processor (desktop) and multiprocessor (enterprise) platforms. A plethora of research exists on the various structures and protocols that are of interest when considering caches. To enable the performance analysis of various cache hierarchies and associated allocation/coherence protocols, we developed a trace-driven simulation framework called CASPER - cache architecture simulation & performance exploration using refstreams. The CASPER simulation framework provides a rich set of features to model various cache organization alternatives, coherence protocols & optimizations, allocation/replacement policies, prefetching and partitioning techniques. In this paper, we describe the methodology behind CASPER, its detailed design and currently supported set of functionalities. CASPER has been used extensively for various research studies; a brief overview of some of these CASPER-based evaluation studies and their salient results will also be discussed. Based on its wide-ranging applicability, we believe CASPER is a useful addition to the performance analysis community for evaluating cache structures and hierarchies of various kinds.
{"title":"On modeling and analyzing cache hierarchies using CASPER","authors":"R. Iyer","doi":"10.1109/MASCOT.2003.1240655","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240655","url":null,"abstract":"The efficient use of cache hierarchies is crucial to the performance of uni-processor (desktop) and multiprocessor (enterprise) platforms. A plethora of research exists on the various structures and protocols that are of interest when considering caches. To enable the performance analysis of various cache hierarchies and associated allocation/coherence protocols, we developed a trace-driven simulation framework called CASPER - cache architecture simulation & performance exploration using refstreams. The CASPER simulation framework provides a rich set of features to model various cache organization alternatives, coherence protocols & optimizations, allocation/replacement policies, prefetching and partitioning techniques. In this paper, we describe the methodology behind CASPER, its detailed design and currently supported set of functionalities. CASPER has been used extensively for various research studies; a brief overview of some of these CASPER-based evaluation studies and their salient results will also be discussed. Based on its wide-ranging applicability, we believe CASPER is a useful addition to the performance analysis community for evaluating cache structures and hierarchies of various kinds.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126719631","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240662
Michele C. Weigle, K. Jeffay, F. D. Smith
We assess the state-of-the-art in Internet congestion control and error recovery through a controlled study that considers the integration of standards-track TCP error recovery and both TCP and router-based congestion control. The goal is to examine and quantify the benefits of deploying standards-track technologies for Internet traffic as a function of the level of offered network load. We limit our study to the dominant and most stressful class of Internet traffic: bursty HTTP flows. Contrary to expectations and published prior work, we find that for HTTP flows (1) there is no clear benefit in using TCP SACK over TCP Reno, (2) unless congestion is a serious concern (i.e., unless average link utilization is above approximately 80%), there is little benefit to using Adaptive RED queue management, (3) above 80% link utilization there is potential benefit to using Adaptive RED with ECN marking, however, complex performance trade-offs exist and results are sensitive to parameter settings.
{"title":"Quantifying the effects of recent protocol improvements to standards-track TCP","authors":"Michele C. Weigle, K. Jeffay, F. D. Smith","doi":"10.1109/MASCOT.2003.1240662","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240662","url":null,"abstract":"We assess the state-of-the-art in Internet congestion control and error recovery through a controlled study that considers the integration of standards-track TCP error recovery and both TCP and router-based congestion control. The goal is to examine and quantify the benefits of deploying standards-track technologies for Internet traffic as a function of the level of offered network load. We limit our study to the dominant and most stressful class of Internet traffic: bursty HTTP flows. Contrary to expectations and published prior work, we find that for HTTP flows (1) there is no clear benefit in using TCP SACK over TCP Reno, (2) unless congestion is a serious concern (i.e., unless average link utilization is above approximately 80%), there is little benefit to using Adaptive RED queue management, (3) above 80% link utilization there is potential benefit to using Adaptive RED with ECN marking, however, complex performance trade-offs exist and results are sensitive to parameter settings.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121650767","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240665
Ioannis Charitakis, K. Anagnostakis, E. Markatos
Scaling network intrusion detection to high network speeds can be achieved using multiple sensors operating in parallel coupled with a suitable load balancing traffic splitter. This paper examines a splitter architecture that incorporates two methods for improving system performance: the first is the use of early filtering where a portion of the packets is processed on the splitter instead of the sensors. The second is the use of locality buffering, where the splitter reorders packets in a way that improves memory access locality on the sensors. Our experiments suggest that early filtering reduces the number of packets to be processed by 32%, giving a 8% increase in sensor performance, while locality buffers improve sensor performance by about 10%. Combined together, the two methods result in an overall improvement of 20% while the performance of the slowest sensor is improved by 14%.
{"title":"An active traffic splitter architecture for intrusion detection","authors":"Ioannis Charitakis, K. Anagnostakis, E. Markatos","doi":"10.1109/MASCOT.2003.1240665","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240665","url":null,"abstract":"Scaling network intrusion detection to high network speeds can be achieved using multiple sensors operating in parallel coupled with a suitable load balancing traffic splitter. This paper examines a splitter architecture that incorporates two methods for improving system performance: the first is the use of early filtering where a portion of the packets is processed on the splitter instead of the sensors. The second is the use of locality buffering, where the splitter reorders packets in a way that improves memory access locality on the sensors. Our experiments suggest that early filtering reduces the number of packets to be processed by 32%, giving a 8% increase in sensor performance, while locality buffers improve sensor performance by about 10%. Combined together, the two methods result in an overall improvement of 20% while the performance of the slowest sensor is improved by 14%.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132395625","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240643
X. Dimitropoulos, G. Riley
Modeling the Internet infrastructure is a challenging endeavor. Complex interactions between protocols, increasing traffic volumes and the irregular structure of the Internet lead to demanding requirements for the simulation developer. These requirements include implementation detail, memory efficiency and scalability, among others. We introduce a simulation model of the Border Gateway Protocol that we call BGP++, which is built on the popular ns-2 simulation environment. A novel development approach is presented that incorporates the public domain routing software GNU Zebra in the simulator. Most of the original software functionality is retained, while the transition to the simulation environment required a manageable amount of effort. Moreover, the discussed design inherits much of the maturity of the original software, since the later is only minimally modified. We analyze BGP++ features and highlight its potential to provide significant aid in BGP research and modeling.
{"title":"Creating realistic BGP models","authors":"X. Dimitropoulos, G. Riley","doi":"10.1109/MASCOT.2003.1240643","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240643","url":null,"abstract":"Modeling the Internet infrastructure is a challenging endeavor. Complex interactions between protocols, increasing traffic volumes and the irregular structure of the Internet lead to demanding requirements for the simulation developer. These requirements include implementation detail, memory efficiency and scalability, among others. We introduce a simulation model of the Border Gateway Protocol that we call BGP++, which is built on the popular ns-2 simulation environment. A novel development approach is presented that incorporates the public domain routing software GNU Zebra in the simulator. Most of the original software functionality is retained, while the transition to the simulation environment required a manageable amount of effort. Moreover, the discussed design inherits much of the maturity of the original software, since the later is only minimally modified. We analyze BGP++ features and highlight its potential to provide significant aid in BGP research and modeling.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132178498","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
扫码关注我们
求助内容：
应助结果提醒方式：