Pub Date : 2002-07-01DOI: 10.1109/ISCC.2002.1021676
Markus Debusmann, M. Schmid, R. Kröger
The Common Object Request Broker Architecture (CORBA) is often used as backbone middleware for connecting critical business system components and for integrating legacy systems. Therefore, CORBA applications have to be managed in an efficient manner. The emerging trend of service level agreements and service level management requires the management of a system from an end-user's viewpoint, i.e., metrics like application response time and availability are key concerns. This requires a very fine-grained monitoring of the application in order to identify its performance-critical parts. This paper presents a new generic instrumentation approach for CORBA applications that enables the measurement of end-to-end performance characteristics. The measurements are very fine-grained, i.e., complex invocation hierarchies within object meshes can be monitored. The presented solution is based on portable interceptors and the application response measurement (ARM).
{"title":"Measuring end-to-end performance of CORBA applications using a generic instrumentation approach","authors":"Markus Debusmann, M. Schmid, R. Kröger","doi":"10.1109/ISCC.2002.1021676","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021676","url":null,"abstract":"The Common Object Request Broker Architecture (CORBA) is often used as backbone middleware for connecting critical business system components and for integrating legacy systems. Therefore, CORBA applications have to be managed in an efficient manner. The emerging trend of service level agreements and service level management requires the management of a system from an end-user's viewpoint, i.e., metrics like application response time and availability are key concerns. This requires a very fine-grained monitoring of the application in order to identify its performance-critical parts. This paper presents a new generic instrumentation approach for CORBA applications that enables the measurement of end-to-end performance characteristics. The measurements are very fine-grained, i.e., complex invocation hierarchies within object meshes can be monitored. The presented solution is based on portable interceptors and the application response measurement (ARM).","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127353573","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021762
Csaba Simon, A. Vidács, I. Moldován, Attila Török, K. Ishibashi, A. Koike, H. Ichikawa
In the last decade two major solutions, namely IntServ and DiffServ have been introduced to empower IP networks with quality of service (QoS) capabilities. Among these two the DiffServ, which exhibits a better scalability and is the starting point for this paper is based on a per hop shaping of the traffic. The nodes control independently the flows without knowledge about the network state or/and the limitations suffered by the flows at other hops. Thus, violation of service differentiation can also occur. To correct this inefficiency a network-wide proportional service model is proposed. After presenting the theoretical argumentation and the architecture, we also provide an algorithm that computes the shaping factor needed to sustain our architecture. We use simulation experiments to validate our proposal.
{"title":"End-to-end relative Differentiated Services for IP networks","authors":"Csaba Simon, A. Vidács, I. Moldován, Attila Török, K. Ishibashi, A. Koike, H. Ichikawa","doi":"10.1109/ISCC.2002.1021762","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021762","url":null,"abstract":"In the last decade two major solutions, namely IntServ and DiffServ have been introduced to empower IP networks with quality of service (QoS) capabilities. Among these two the DiffServ, which exhibits a better scalability and is the starting point for this paper is based on a per hop shaping of the traffic. The nodes control independently the flows without knowledge about the network state or/and the limitations suffered by the flows at other hops. Thus, violation of service differentiation can also occur. To correct this inefficiency a network-wide proportional service model is proposed. After presenting the theoretical argumentation and the architecture, we also provide an algorithm that computes the shaping factor needed to sustain our architecture. We use simulation experiments to validate our proposal.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132411542","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021790
A. Tagami, T. Hasegawa, T. Hasegawa, K. Nakao
High-speed links such as OC-48c and OC-192c links need to be used as backbone links of the Internet in order to accommodate rapidly increasing Internet traffic. Network experiments over a test bed are important to check new services and new applications perform well over high-speed Internet backbones. In order to obtain the correct experiment results, it is important to use suitable background traffic at the network experiments. The existing traffic testers use MMPP (Markov modulated Poisson process) and MAP (Markov arrival process) as traffic models to generate background traffic. However, MMPP and MAP are so simplistic that the network experiments may produce misleading results. In order to solve the problem, we have developed an OC-48c traffic tester for generating and analyzing long-range dependence traffic because the traffic model is considered one of the most realistic traffic models. The traffic tester achieves the OC-48 rate traffic generation using hardware logic, and enables the long-range dependence traffic generation using time series data of packet numbers or byte numbers.
{"title":"OC-48c traffic tester for generating and analyzing long-range dependence traffic","authors":"A. Tagami, T. Hasegawa, T. Hasegawa, K. Nakao","doi":"10.1109/ISCC.2002.1021790","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021790","url":null,"abstract":"High-speed links such as OC-48c and OC-192c links need to be used as backbone links of the Internet in order to accommodate rapidly increasing Internet traffic. Network experiments over a test bed are important to check new services and new applications perform well over high-speed Internet backbones. In order to obtain the correct experiment results, it is important to use suitable background traffic at the network experiments. The existing traffic testers use MMPP (Markov modulated Poisson process) and MAP (Markov arrival process) as traffic models to generate background traffic. However, MMPP and MAP are so simplistic that the network experiments may produce misleading results. In order to solve the problem, we have developed an OC-48c traffic tester for generating and analyzing long-range dependence traffic because the traffic model is considered one of the most realistic traffic models. The traffic tester achieves the OC-48 rate traffic generation using hardware logic, and enables the long-range dependence traffic generation using time series data of packet numbers or byte numbers.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122199237","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021703
J. Ye, S. Papavassiliou, G. Anastasi, A. Puliafito
We propose an integrated solution for QoS management in mobile wireless networks that can be dynamically adapted to user requirements and resource availability. Due to the strong variability of the environment under examination, we propose to use mobile agents as the underlying enabling technology. We propose a proactive approach that tries to satisfy the user requirements by utilizing advance resource reservations, and a reactive approach which tries to negotiate network resources when significative changes in the demand of resources arise. We also propose a combination of the two approaches in an integrated hybrid system that combines a mobility predictive advanced bandwidth reservation scheme with a call admission control and resource reconfiguration strategy to support flexible QoS management.
{"title":"Strategies for dynamic management of the QoS of mobile users in wireless networks through software agents","authors":"J. Ye, S. Papavassiliou, G. Anastasi, A. Puliafito","doi":"10.1109/ISCC.2002.1021703","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021703","url":null,"abstract":"We propose an integrated solution for QoS management in mobile wireless networks that can be dynamically adapted to user requirements and resource availability. Due to the strong variability of the environment under examination, we propose to use mobile agents as the underlying enabling technology. We propose a proactive approach that tries to satisfy the user requirements by utilizing advance resource reservations, and a reactive approach which tries to negotiate network resources when significative changes in the demand of resources arise. We also propose a combination of the two approaches in an integrated hybrid system that combines a mobility predictive advanced bandwidth reservation scheme with a call admission control and resource reconfiguration strategy to support flexible QoS management.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130692970","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021759
G. Samaras, Constantinos Spyrou, E. Pitoura
The View Generator (VG) is a system that provides the necessary components for the definition, materialization, storage, maintenance and re-use of views over remote Web-accessible databases. Through the system, clients identify Web databases of interest, access their metadata and create personalized views that can be shared by other clients. Creating personalized views provides a more efficient way of data processing than directly issuing complex queries to the data sources especially in the case of lightweight and wireless clients that suffer from scarce local resources, limited bandwidth and high communication costs. VG's multi-tier architecture implemented using mobile Java agents allows automatic code deployment as well as dynamic relocation of views.
{"title":"View Generator (VG): a mobile agent based system for the creation and maintenance of Web views","authors":"G. Samaras, Constantinos Spyrou, E. Pitoura","doi":"10.1109/ISCC.2002.1021759","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021759","url":null,"abstract":"The View Generator (VG) is a system that provides the necessary components for the definition, materialization, storage, maintenance and re-use of views over remote Web-accessible databases. Through the system, clients identify Web databases of interest, access their metadata and create personalized views that can be shared by other clients. Creating personalized views provides a more efficient way of data processing than directly issuing complex queries to the data sources especially in the case of lightweight and wireless clients that suffer from scarce local resources, limited bandwidth and high communication costs. VG's multi-tier architecture implemented using mobile Java agents allows automatic code deployment as well as dynamic relocation of views.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130731460","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021697
H. Seba, N. Badache, A. Bouabdallah
It is now well recognised that the consensus problem is a fundamental problem when one has to implement fault-tolerant distributed services. We extend the consensus paradigm to asynchronous distributed mobile systems prone to disconnection and process crash failures. The paper, first, shows that a consensus problem between mobile hosts is reducible to two agreement problems (a consensus problem and a group membership problem) between fixed hosts. Then, following an approach investigated by Guerraoui and Schiper (see IEEE Transactions on Software Engineering, vol.27, no.1, p.29-41, 2001), the paper uses a genetic consensus service as a basic building block to construct a modular and simple solution.
{"title":"Solving the consensus problem in a dynamic group: an approach suitable for a mobile environment","authors":"H. Seba, N. Badache, A. Bouabdallah","doi":"10.1109/ISCC.2002.1021697","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021697","url":null,"abstract":"It is now well recognised that the consensus problem is a fundamental problem when one has to implement fault-tolerant distributed services. We extend the consensus paradigm to asynchronous distributed mobile systems prone to disconnection and process crash failures. The paper, first, shows that a consensus problem between mobile hosts is reducible to two agreement problems (a consensus problem and a group membership problem) between fixed hosts. Then, following an approach investigated by Guerraoui and Schiper (see IEEE Transactions on Software Engineering, vol.27, no.1, p.29-41, 2001), the paper uses a genetic consensus service as a basic building block to construct a modular and simple solution.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116784256","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021773
Zici Zheng, R. Kinicki
Using ns-2 simulations, this paper evaluates an adaptive explicit congestion notification (AECN) router. By receiving round-trip time (RTT) source hints from each TCP flow, AECN divides flows into flow groups based on RTT ranges. AECN uses distinct flow group drop probabilities and a mark front scheme to provide higher goodput and better fairness than random early detection (RED) and explicit congestion notification (ECN) routers.
{"title":"Adaptive explicit congestion notification","authors":"Zici Zheng, R. Kinicki","doi":"10.1109/ISCC.2002.1021773","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021773","url":null,"abstract":"Using ns-2 simulations, this paper evaluates an adaptive explicit congestion notification (AECN) router. By receiving round-trip time (RTT) source hints from each TCP flow, AECN divides flows into flow groups based on RTT ranges. AECN uses distinct flow group drop probabilities and a mark front scheme to provide higher goodput and better fairness than random early detection (RED) and explicit congestion notification (ECN) routers.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131170336","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021750
D. Gerakoulis, P. Salmi
We present an ultra wide bandwidth (UWB) wireless network for in-home cordless networking and wireless distribution of cable TV channels. The article describes the network services, the media access control, the physical link transmitter and receiver design and the link bit error rate (BER) performance. The physical link is based on an interference suppressing OFDM (IS-OFDM) in which the total number of frequency bins (subcarriers) of the UWB channel is divided into groups. Every frequency bin in a group carries all transmitted symbols for that group which are distinguished and separated from each other by orthogonal Hadamard sequences. The proposed design may then suppress narrow-band interference which is often present in UWB channels. In an indoor multipath channel, IS-OFDM has also a significant advantage over ordinary OFDM, which, as shown, does not offer acceptable performance for this type of channel. The IS-OFDM link then is expected to satisfy the high bit rate needs and meet the required quality of service with a minimum transmit power so that it does not cause interference beyond the perimeter of the home.
{"title":"Link performance of an ultra wide bandwidth wireless in-home network","authors":"D. Gerakoulis, P. Salmi","doi":"10.1109/ISCC.2002.1021750","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021750","url":null,"abstract":"We present an ultra wide bandwidth (UWB) wireless network for in-home cordless networking and wireless distribution of cable TV channels. The article describes the network services, the media access control, the physical link transmitter and receiver design and the link bit error rate (BER) performance. The physical link is based on an interference suppressing OFDM (IS-OFDM) in which the total number of frequency bins (subcarriers) of the UWB channel is divided into groups. Every frequency bin in a group carries all transmitted symbols for that group which are distinguished and separated from each other by orthogonal Hadamard sequences. The proposed design may then suppress narrow-band interference which is often present in UWB channels. In an indoor multipath channel, IS-OFDM has also a significant advantage over ordinary OFDM, which, as shown, does not offer acceptable performance for this type of channel. The IS-OFDM link then is expected to satisfy the high bit rate needs and meet the required quality of service with a minimum transmit power so that it does not cause interference beyond the perimeter of the home.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133046877","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021683
Maria Barra, A. Lannaccone, Giuseppina Palmieri, V. Scarano
We present an adaptive system for training and teaching. Our system integrates an adaptive training environment and a cooperative environment for exams both accessible via Internet by standard Java-enabled browsers. In this paper we present details on the architecture, describe the project with regard to the adaptive self-training part, and report on an experiment that demonstrates the effectiveness of the strategy: to draw attention of students to the topics they need to study. We experimented the system in a real case study with students attending a first year course, "Laboratorio di Informatica" of the Laurea degree in computer science in our University.
我们提出了一个适应性的培训和教学系统。我们的系统集成了一个自适应的训练环境和一个协作的考试环境，这两个环境都可以通过标准的支持java的浏览器通过互联网访问。在本文中，我们详细介绍了该策略的架构，描述了关于自适应自我训练部分的项目，并报告了一个实验，证明了该策略的有效性:将学生的注意力吸引到他们需要学习的主题上。我们在一个真实的案例研究中对这个系统进行了实验，研究对象是参加我们大学计算机科学Laurea学位一年级课程“laboratoro di Informatica”的学生。
{"title":"Test++: an adaptive training system on the Internet","authors":"Maria Barra, A. Lannaccone, Giuseppina Palmieri, V. Scarano","doi":"10.1109/ISCC.2002.1021683","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021683","url":null,"abstract":"We present an adaptive system for training and teaching. Our system integrates an adaptive training environment and a cooperative environment for exams both accessible via Internet by standard Java-enabled browsers. In this paper we present details on the architecture, describe the project with regard to the adaptive self-training part, and report on an experiment that demonstrates the effectiveness of the strategy: to draw attention of students to the topics they need to study. We experimented the system in a real case study with students attending a first year course, \"Laboratorio di Informatica\" of the Laurea degree in computer science in our University.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122815067","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021784
Emre Yetginer, Ezhan Karasan
In this paper we study traffic engineering of restorable paths in multiprotocol label switching (MPLS) networks. We consider off-line computation of working and restoration paths with path rerouting as the restoration scheme. First we compute a link-disjoint path set for given set of demands. Using this path set we study four approaches for selecting working and restoration paths, and formulate each method as an integer linear programming (ILP) problem. A traffic uncertainty model is developed in order to compare these approaches based on their robustness with respect to changing traffic patterns. We obtain numerical results and compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network.
{"title":"Robust path design algorithms for traffic engineering with restoration in MPLS networks","authors":"Emre Yetginer, Ezhan Karasan","doi":"10.1109/ISCC.2002.1021784","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021784","url":null,"abstract":"In this paper we study traffic engineering of restorable paths in multiprotocol label switching (MPLS) networks. We consider off-line computation of working and restoration paths with path rerouting as the restoration scheme. First we compute a link-disjoint path set for given set of demands. Using this path set we study four approaches for selecting working and restoration paths, and formulate each method as an integer linear programming (ILP) problem. A traffic uncertainty model is developed in order to compare these approaches based on their robustness with respect to changing traffic patterns. We obtain numerical results and compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128810233","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
扫码关注我们
求助内容：
应助结果提醒方式：