E. Magaña, D. Morató, M. Izal, J. Aracil, F. Naranjo, F. Astiz, U. Alonso, I. Csabai, P. Hága, G. Simon, J. Stéger, G. Vattay
{"title":"The European traffic observatory measurement infrastructure (ETOMIC)","authors":"E. Magaña, D. Morató, M. Izal, J. Aracil, F. Naranjo, F. Astiz, U. Alonso, I. Csabai, P. Hága, G. Simon, J. Stéger, G. Vattay","doi":"10.1109/IPOM.2004.1547611","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547611","url":null,"abstract":"The European traffic observatory is a European Union VI framework program sponsored effort, within the integrated project EVERGROW, that aims at providing an panEuropean traffic measurement infrastructure with high-precision, GPS-synchronized monitoring nodes. This paper describes the system and node architectures, together with the management system.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124293685","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}
{"title":"A new wavelength scheduling algorithm for achieving fairness in OBS networks","authors":"Yiqun Hu, Yuefeng Ji, Zehua Gao","doi":"10.1109/IPOM.2004.1547609","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547609","url":null,"abstract":"As a burst travels through OBS networks, its residual offset time decreases, and the blocking probability increases. This phenomenon has adverse effects on fairness and throughout of OBS networks. In this paper, we propose a new wavelength scheduling algorithm giving priority to the bursts with more network resources which they have already reserved to resolve the unfairness problem. The simulation results show when offered load is 0.6, the ratio of blocking probability of bursts with longest route lengths to that of bursts with shortest route lengths is 1700 and 2 respectively for standard JET and our algorithm. The results also show the algorithm can significant reduce the blocking probability with burst duration weighting.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"503 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126780515","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}
{"title":"A semantic active policy-based management architecture","authors":"M. Chamoun, R. Kilany, A. Serhrouchni","doi":"10.1109/IPOM.2004.1547621","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547621","url":null,"abstract":"The task of managing information technology resources becomes increasingly complex as managers must take heterogeneous systems, different networking technologies, and distributed applications into consideration. Policy-based networking (PBN) has emerged as a promising paradigm for configuration management and service provisioning. The common open policy service (COPS) and its extension for policy provisioning (COPS-PR) are currently being developed as the protocols to implement PBN. This paper describes an active policy-based network management architecture which demonstrates how a policy-based management approach can be adapted into an active node framework. For this purpose, we defined and deployed a policy-based management protocol, in conformity to the COPS protocol, in order to exchange policy information between a policy server and its clients. Our implementation is done on a Web services based active network platform named ASWA. This paper also proposes a new approach for the definition of network policy management information, in order to enhance its semantic expressiveness and facilitate its maintenance, by using OWL the Web ontology language.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126148726","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}
{"title":"Improving passive estimation of TCP round-trip times using TCP timestamps","authors":"H. Yan, Kang Li, S. Watterson, D. Lowenthal","doi":"10.1109/IPOM.2004.1547614","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547614","url":null,"abstract":"In order to make accurate routing and queueing decisions, passive measurement of TCP flows is becoming increasingly common. Passive measurement techniques have the advantage that they do not inject extra traffic into the connection. These techniques work by associating packet pairs (e.g., a data packet and its acknowledgement during slow start) and then measuring the RTT for those pairs. Unfortunately, such association is difficult in the general case, primarily because an acknowledgement can rarely be associated with the data packets that it triggers. This paper presents a new passive measurement technique that associates packet pairs using TCP timestamps. The basic idea is to capture all packets that pass through the measurement point, and match two pairs of packets, where one timestamp is common to both pairs. Unlike previous techniques, this allows us to obtain samples throughout the lifetime of the connection. Results show that our technique has less than a 1% error on average for an ftp download. As most end hosts currently employ the timestamp option, our technique is widely applicable in practice.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115590865","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}
{"title":"Scalable network monitors for high-speed links: a bottom-up approach","authors":"T. Nguyen, M. Cristea, W. De Bruijn, H. Bos","doi":"10.1109/IPOM.2004.1547586","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547586","url":null,"abstract":"Monitoring traffic on high-speed links using commodity hardware is difficult due to relatively slow buses and memories. It is possible to alleviate the burden on these resources by pushing down packet processing to programmable NICs. Until now, however, the use of such cards for monitoring by network administrators has not been a practical solution, because programming the cards is too complex. For this purpose, we introduce NIC-FIX, a monitoring framework for network processors that scales to high link rates and is easy to use.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122276516","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}
{"title":"An incentive-based quality of service aware algorithm for offline inter-AS traffic engineering","authors":"Kin-ho Ho, G. Pavlou, M. Howarth, Ning Wang","doi":"10.1109/IPOM.2004.1547589","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547589","url":null,"abstract":"This paper focuses on incentive-based offline inter-AS traffic engineering with end-to-end quality of service (QoS) guarantees. We investigate a key inter-AS traffic engineering problem, the \"egress router selection problem\". The objective is to select an egress router for each expected aggregate inter-AS traffic flow so that the required end-to-end QoS is provided and the capacity constraint of each inter-AS link is met while minimizing the total inter-AS transit cost. The problem is NP-hard and we propose a genetic algorithm to solve it. Simulation results show that our proposed approach performs better than conventional greedy-based approaches.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115222248","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}