Pub Date : 2002-11-07DOI: 10.1109/ISCC.2002.1021714
Jun Jiang, S. Papavassiliou
We propose the use of the optimal least weight routing (OLWR) algorithm for routing QoS flows in high-speed networks. The main principle of our algorithm is that the choice of the most appropriate route, is based on a set of parameters that estimate the impact that, the acceptance and routing decision of a call request belonging to a specific class, would have on the network and other classes of service. The performance evaluation results demonstrated that OLWR outperforms both the multi-hop least-loaded routing algorithms and the multihop most-loaded routing algorithms in terms of both revenue and carried load.
{"title":"End-to-end quality of service in multi-class service high-speed networks via optimal least weight routing","authors":"Jun Jiang, S. Papavassiliou","doi":"10.1109/ISCC.2002.1021714","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021714","url":null,"abstract":"We propose the use of the optimal least weight routing (OLWR) algorithm for routing QoS flows in high-speed networks. The main principle of our algorithm is that the choice of the most appropriate route, is based on a set of parameters that estimate the impact that, the acceptance and routing decision of a call request belonging to a specific class, would have on the network and other classes of service. The performance evaluation results demonstrated that OLWR outperforms both the multi-hop least-loaded routing algorithms and the multihop most-loaded routing algorithms in terms of both revenue and carried load.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124313640","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.1021746
S. Székely
In the year 2000 the telecommunication market entered a very deep recession. In the current marketplace the service providers must improve network management to reduce operation costs. ATM network service providers offered mainly permanent virtual circuit connections to customers in the last few years, but recently there is an increasing interest in offering switched virtual circuit (SVC) connections to end users. The SVC is based on the use of signalling protocols. Our paper focuses on the performance of call processing in ATM networks. Based on a series of measurement results that have a wide generality among ATM switches, we have built up a node-model to design large ATM signalling networks. The paper shows that a cascaded network is a good estimator for the signalling performance of an arbitrary network. In addition, it is shown that the call density of the network is an important network parameter, which is closely related to the maximum network-level call arrival rate. The case studies are extended from homogeneous networks to hybrid networks.
{"title":"Signalling performance evaluation of large ATM networks based on measurements of isolated switches","authors":"S. Székely","doi":"10.1109/ISCC.2002.1021746","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021746","url":null,"abstract":"In the year 2000 the telecommunication market entered a very deep recession. In the current marketplace the service providers must improve network management to reduce operation costs. ATM network service providers offered mainly permanent virtual circuit connections to customers in the last few years, but recently there is an increasing interest in offering switched virtual circuit (SVC) connections to end users. The SVC is based on the use of signalling protocols. Our paper focuses on the performance of call processing in ATM networks. Based on a series of measurement results that have a wide generality among ATM switches, we have built up a node-model to design large ATM signalling networks. The paper shows that a cascaded network is a good estimator for the signalling performance of an arbitrary network. In addition, it is shown that the call density of the network is an important network parameter, which is closely related to the maximum network-level call arrival rate. The case studies are extended from homogeneous networks to hybrid networks.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"59 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":"115268250","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.1021749
A. Miaoudakis, Apostolos Koukourgiannis, G. Kalivas
The performance of carrier frequency offset (CFO) estimators is examined when applied to Hiperlan2 modems. The performance of various estimator procedures is evaluated by means of simulation. A new estimation scheme is proposed for Hiperlan2 that takes advantage of the structure of the physical frames. Its major advantage is that the estimator operating range is extended to fulfil a worst-case scenario of CFO for Hiperlan2. A CFO correction architecture is also proposed which consists of 2 parts; a coarse CFO estimator that feeds a numerically controlled oscillator (NCO) to remove a part of CFO, and a fine CFO estimator-corrector that uses linear phase extrapolation to correct the phase shift caused by the remaining CFO.
{"title":"Carrier frequency offset estimation and correction for Hiperlan/2 WLANs","authors":"A. Miaoudakis, Apostolos Koukourgiannis, G. Kalivas","doi":"10.1109/ISCC.2002.1021749","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021749","url":null,"abstract":"The performance of carrier frequency offset (CFO) estimators is examined when applied to Hiperlan2 modems. The performance of various estimator procedures is evaluated by means of simulation. A new estimation scheme is proposed for Hiperlan2 that takes advantage of the structure of the physical frames. Its major advantage is that the estimator operating range is extended to fulfil a worst-case scenario of CFO for Hiperlan2. A CFO correction architecture is also proposed which consists of 2 parts; a coarse CFO estimator that feeds a numerically controlled oscillator (NCO) to remove a part of CFO, and a fine CFO estimator-corrector that uses linear phase extrapolation to correct the phase shift caused by the remaining CFO.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"67 3 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":"117233218","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.1021702
A. Voyiatzis, D. Serpanos
Active hardware attacks succeed in deriving cryptographic secrets from target devices. They were originally proposed for systems implementing RSA, Fiat-Shamir (1988) scheme, and Schnorr's scheme. Common targets for these attacks are systems used for client authentication in order to access services, e.g., pay-per view TV, video distribution and cellular telephony. These client systems hold secrets, typically cryptographic keys, owned by the service provider and often implement the Fiat-Shamir identification scheme. Given the strength of active attacks and the increasingly wide deployment of client systems, it is desirable to design proactive countermeasures for them. We focus on the Fiat-Shamir scheme. We prove that the conventional active attack can be easily avoided through appropriate system and protocol configuration; we denote this configuration as the precautious Fiat-Shamir Scheme. We argue that proactive countermeasures against active attacks are feasible and lead to systems that are inherently resistant to active attacks by careful protocol design, rather than ad hoc solutions.
{"title":"Active hardware attacks and proactive countermeasures","authors":"A. Voyiatzis, D. Serpanos","doi":"10.1109/ISCC.2002.1021702","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021702","url":null,"abstract":"Active hardware attacks succeed in deriving cryptographic secrets from target devices. They were originally proposed for systems implementing RSA, Fiat-Shamir (1988) scheme, and Schnorr's scheme. Common targets for these attacks are systems used for client authentication in order to access services, e.g., pay-per view TV, video distribution and cellular telephony. These client systems hold secrets, typically cryptographic keys, owned by the service provider and often implement the Fiat-Shamir identification scheme. Given the strength of active attacks and the increasingly wide deployment of client systems, it is desirable to design proactive countermeasures for them. We focus on the Fiat-Shamir scheme. We prove that the conventional active attack can be easily avoided through appropriate system and protocol configuration; we denote this configuration as the precautious Fiat-Shamir Scheme. We argue that proactive countermeasures against active attacks are feasible and lead to systems that are inherently resistant to active attacks by careful protocol design, rather than ad hoc solutions.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"112 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":"124739497","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.1021720
Alain Pannetrat, R. Molva
We propose a new stream authentication scheme that is suitable for live packet streams distributed over a lossy channel, such as an IP-multicast group. Packets are signed together in a block and the recipient can authenticate this block if the loss rate per block is lower than a certain threshold, which can be chosen based on the characteristic of the communication channel. This scheme provides both integrity and non repudiation of origin, and in a majority of situations, it performs with less overhead in bytes per packet than previously proposed practical live stream authentication schemes.
{"title":"Authenticating real time packet streams and multicasts","authors":"Alain Pannetrat, R. Molva","doi":"10.1109/ISCC.2002.1021720","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021720","url":null,"abstract":"We propose a new stream authentication scheme that is suitable for live packet streams distributed over a lossy channel, such as an IP-multicast group. Packets are signed together in a block and the recipient can authenticate this block if the loss rate per block is lower than a certain threshold, which can be chosen based on the characteristic of the communication channel. This scheme provides both integrity and non repudiation of origin, and in a majority of situations, it performs with less overhead in bytes per packet than previously proposed practical live stream authentication schemes.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"26 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":"124971825","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.1021717
D. Nace
We consider the fair flow problem in a multiple source multiple sink network, as applied to telecommunication networks. We present an iterative algorithm for computing fair routing in networks where the available resources are shared among competing flows according to a max-min fair sharing criterion. Our main objective is computing optimal routing paths, with regard to max-min fairness, in stable and known traffic conditions. It is a linear programming based approach which permits a lexicographical maximization of the vector of fair-share attributed to the connections competing for network resources. An optimality proof and some computational results are also presented.
{"title":"A linear programming based approach for computing optimal fair splittable routing","authors":"D. Nace","doi":"10.1109/ISCC.2002.1021717","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021717","url":null,"abstract":"We consider the fair flow problem in a multiple source multiple sink network, as applied to telecommunication networks. We present an iterative algorithm for computing fair routing in networks where the available resources are shared among competing flows according to a max-min fair sharing criterion. Our main objective is computing optimal routing paths, with regard to max-min fairness, in stable and known traffic conditions. It is a linear programming based approach which permits a lexicographical maximization of the vector of fair-share attributed to the connections competing for network resources. An optimality proof and some computational results are also presented.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"81 4 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":"126066533","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.1021653
M. Jacobsson, S. Oosthoek, G. Karagiannis
The wide deployment of IP technologies has driven the development of IP-based solutions for wireless networks, like the IP-based radio access networks (RAN). Such wireless networks have different characteristics than traditional IP networks, imposing very strict requirements on quality of service (QoS) solutions. Current QoS solutions are not able to satisfy these requirements. This paper describes the prototype implementation of a QoS-framework, called resource management in differentiated services (RMD), which aims to correct this situation. RMD is a framework offering scalable fine-grained QoS guarantees in differentiated services (DiffServ) networks. It extends the DiffServ architecture with new admission control and resource reservation concepts in a scalable way.
{"title":"Resource management in differentiated services: a prototype implementation","authors":"M. Jacobsson, S. Oosthoek, G. Karagiannis","doi":"10.1109/ISCC.2002.1021653","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021653","url":null,"abstract":"The wide deployment of IP technologies has driven the development of IP-based solutions for wireless networks, like the IP-based radio access networks (RAN). Such wireless networks have different characteristics than traditional IP networks, imposing very strict requirements on quality of service (QoS) solutions. Current QoS solutions are not able to satisfy these requirements. This paper describes the prototype implementation of a QoS-framework, called resource management in differentiated services (RMD), which aims to correct this situation. RMD is a framework offering scalable fine-grained QoS guarantees in differentiated services (DiffServ) networks. It extends the DiffServ architecture with new admission control and resource reservation concepts in a scalable way.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"94 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":"126874530","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.1021733
H. Mokhtar, R. Pereira, M. Merabti
Generalized processor sharing (GPS) is an idealized fluid scheduling discipline that has desirable properties for integrated services networks. It provides tight end-to-end guarantees to leaky-bucket constrained streams regardless of the behavior of other connections. It also allocates bandwidth fairly among all connections regardless of whether or not their traffic is constrained. According to their weight assignments, GPS networks are categorized into three classes: rate proportional processor sharing (RPPS), consistent relative session treatment (CRST) and arbitrary weighting. These classes achieve different degrees of complexity, stability, coupling between delay and bandwidth, and utilization gain. We present a new GPS class: the fair-rate GPS. For this class, the weights are set in proportion to both bandwidth and required delay, thus achieving higher utilization while avoiding the coupling. problem. We evaluate the new class using MPEG video traces and show that higher utilization gain can be achieved.
{"title":"Fair-rate GPS: a new class for decoupling delay and bandwidth properties","authors":"H. Mokhtar, R. Pereira, M. Merabti","doi":"10.1109/ISCC.2002.1021733","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021733","url":null,"abstract":"Generalized processor sharing (GPS) is an idealized fluid scheduling discipline that has desirable properties for integrated services networks. It provides tight end-to-end guarantees to leaky-bucket constrained streams regardless of the behavior of other connections. It also allocates bandwidth fairly among all connections regardless of whether or not their traffic is constrained. According to their weight assignments, GPS networks are categorized into three classes: rate proportional processor sharing (RPPS), consistent relative session treatment (CRST) and arbitrary weighting. These classes achieve different degrees of complexity, stability, coupling between delay and bandwidth, and utilization gain. We present a new GPS class: the fair-rate GPS. For this class, the weights are set in proportion to both bandwidth and required delay, thus achieving higher utilization while avoiding the coupling. problem. We evaluate the new class using MPEG video traces and show that higher utilization gain can be achieved.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"410 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":"122791292","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.1021786
R. State
This paper addresses the problem of monitoring packet loss in multicast networks. The proposed approach consists of monitoring a latent factor which is supposed to stand for and cause the observed network behavior. Our paper proposes a scheme based on principal component analysis in order to extract monitoring information and statistical process control in order to provide a methodology for monitoring multicast communication.
{"title":"Latent multicast monitoring","authors":"R. State","doi":"10.1109/ISCC.2002.1021786","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021786","url":null,"abstract":"This paper addresses the problem of monitoring packet loss in multicast networks. The proposed approach consists of monitoring a latent factor which is supposed to stand for and cause the observed network behavior. Our paper proposes a scheme based on principal component analysis in order to extract monitoring information and statistical process control in order to provide a methodology for monitoring multicast communication.","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":"122117726","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.1021731
Haiyun Luo, P. Zerfos, J. Kong, Songwu Lu, Lixia Zhang
Mobile ad hoc networking offers convenient infrastructureless communication over the shared wireless channel. However, the nature of ad hoc networks makes them vulnerable to security attacks. Examples of such attacks include passive eavesdropping over the wireless channel, denial of service attacks by malicious nodes and attacks from compromised nodes or stolen devices. Unlike their wired counterpart, infrastructureless ad hoc networks do not have a clear line of defense, and every node must be prepared for encounters with an adversary. Therefore, a centralized or hierarchical network security solution does not work well.This work provides scalable, distributed authentication services in ad hoc networks. Our design takes a self-securing approach, in which multiple nodes (say, k) collaboratively provide authentication services for other nodes in the network. We first formalize a localized trust model that lays the foundation for the design. We further propose refined localized certification services based on our previous work, and develop a new scalable share update to resist more powerful adversaries. Finally, we evaluate the solution through simulation and implementation.
{"title":"Self-securing ad hoc wireless networks","authors":"Haiyun Luo, P. Zerfos, J. Kong, Songwu Lu, Lixia Zhang","doi":"10.1109/ISCC.2002.1021731","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021731","url":null,"abstract":"Mobile ad hoc networking offers convenient infrastructureless communication over the shared wireless channel. However, the nature of ad hoc networks makes them vulnerable to security attacks. Examples of such attacks include passive eavesdropping over the wireless channel, denial of service attacks by malicious nodes and attacks from compromised nodes or stolen devices. Unlike their wired counterpart, infrastructureless ad hoc networks do not have a clear line of defense, and every node must be prepared for encounters with an adversary. Therefore, a centralized or hierarchical network security solution does not work well.This work provides scalable, distributed authentication services in ad hoc networks. Our design takes a self-securing approach, in which multiple nodes (say, k) collaboratively provide authentication services for other nodes in the network. We first formalize a localized trust model that lays the foundation for the design. We further propose refined localized certification services based on our previous work, and develop a new scalable share update to resist more powerful adversaries. Finally, we evaluate the solution through simulation and implementation.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"91 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":"116624199","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
扫码关注我们
求助内容：
应助结果提醒方式：