The objective of this paper is to present a broad scope of the current status and the challenges to be faced by Mexico around the satellite networks industry (SNI), the telecommunications industry (TI) deregulation process and the new emerging broadband internetworking technologies (BBINT) penetration. The recent launch of e-government initiative called e-Mexico and specially related to the nation wide deployment of e-kiosks for social and educational services through a satellite system has created an important milestone and a positive impact on the growth rate over the rest of broadband networks and services offered around the country. A tele-density analysis, plus a fixed, mobile and major local satellite players positioning and their user penetration services are discussed here versus Mexican market conditions and technology infrastructure trends.
{"title":"Telecom deregulation and fast-changing broadband internetworking technologies: status, impacts and trends in the Mexican market","authors":"G. Chavez","doi":"10.1109/ISCC.2005.142","DOIUrl":"https://doi.org/10.1109/ISCC.2005.142","url":null,"abstract":"The objective of this paper is to present a broad scope of the current status and the challenges to be faced by Mexico around the satellite networks industry (SNI), the telecommunications industry (TI) deregulation process and the new emerging broadband internetworking technologies (BBINT) penetration. The recent launch of e-government initiative called e-Mexico and specially related to the nation wide deployment of e-kiosks for social and educational services through a satellite system has created an important milestone and a positive impact on the growth rate over the rest of broadband networks and services offered around the country. A tele-density analysis, plus a fixed, mobile and major local satellite players positioning and their user penetration services are discussed here versus Mexican market conditions and technology infrastructure trends.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120968939","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}
P. Pavón-Mariño, C. López-Bravo, J. García-Haro, F. González-Castaño
The deployment of optical packet switching (OPS) in dense wavelength division multiplexing (DWDM) backbone networks is perceived as a medium term promising alternative. Scalability restrictions imply that conventional switching architectures are unfeasible in this large-scale scenario. In a previous paper, the wavelength-distributed knockout architecture was proposed as a cost-effective scaling strategy for OPS switching fabrics. In this paper, this growable architecture is applied to OPS switching fabrics able to emulate output buffering. We also propose an scheduling algorithm which provides optimum performance if knockout packet losses are made negligible. The mathematical analysis to evaluate the knockout packet loss probability of this architecture is obtained, under uniform and non-uniform traffic patterns. To complement the switch dimensioning process, an upper bound assuring 0-knockout packet losses is compared with the exact analytical results.
{"title":"Knockout packet loss probability analysis of SCWP optical packet switching wavelength distributed knockout architecture","authors":"P. Pavón-Mariño, C. López-Bravo, J. García-Haro, F. González-Castaño","doi":"10.1109/ISCC.2005.91","DOIUrl":"https://doi.org/10.1109/ISCC.2005.91","url":null,"abstract":"The deployment of optical packet switching (OPS) in dense wavelength division multiplexing (DWDM) backbone networks is perceived as a medium term promising alternative. Scalability restrictions imply that conventional switching architectures are unfeasible in this large-scale scenario. In a previous paper, the wavelength-distributed knockout architecture was proposed as a cost-effective scaling strategy for OPS switching fabrics. In this paper, this growable architecture is applied to OPS switching fabrics able to emulate output buffering. We also propose an scheduling algorithm which provides optimum performance if knockout packet losses are made negligible. The mathematical analysis to evaluate the knockout packet loss probability of this architecture is obtained, under uniform and non-uniform traffic patterns. To complement the switch dimensioning process, an upper bound assuring 0-knockout packet losses is compared with the exact analytical results.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134094966","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}
Security is a serious bottleneck for the future of VoIP. Because of the time-critical nature of VoIP most of the same security measures currently implemented in today's data networks could not be used in VoIP networks. Two main factors affect voice traffic over secure IP channels. The first is the time required to encrypt payload and headers and the construction of the new ones. The second is the increased packet size because of the headers added to the original IP packet. Techniques that could be adopted to overcome these two problems in addition to the compression QoS issues associated with audio codecs put more strain on end-point CPU's. In this paper we propose a new QoS control scheme that uses a simple protocol to detect the end-point CPU capabilities, and according to this information, we choose dynamically the most suitable techniques for the transmission of voice over a secure IP channel to provide a superior QoS control performance, in terms of perceived speech quality.
{"title":"QoS control using an end-point CPU capability detector in a secure VoIP system","authors":"A. Elbayoumy, S. Shepherd","doi":"10.1109/ISCC.2005.129","DOIUrl":"https://doi.org/10.1109/ISCC.2005.129","url":null,"abstract":"Security is a serious bottleneck for the future of VoIP. Because of the time-critical nature of VoIP most of the same security measures currently implemented in today's data networks could not be used in VoIP networks. Two main factors affect voice traffic over secure IP channels. The first is the time required to encrypt payload and headers and the construction of the new ones. The second is the increased packet size because of the headers added to the original IP packet. Techniques that could be adopted to overcome these two problems in addition to the compression QoS issues associated with audio codecs put more strain on end-point CPU's. In this paper we propose a new QoS control scheme that uses a simple protocol to detect the end-point CPU capabilities, and according to this information, we choose dynamically the most suitable techniques for the transmission of voice over a secure IP channel to provide a superior QoS control performance, in terms of perceived speech quality.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131132745","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}
In this paper, we propose to use a dynamic load balancing scheme that utilizes fixed relay stations placed in a cellular geographical coverage area to improve the handover performance in cellular networks. To this end, we develop closed-form performance expressions and derive the handover dropping probability in terms of the main system parameters, such as the new call and handover arrival rates, the number of fixed and load-balancing channels per cell, the load balancing probability for new and handover calls, etc. Our results show that by employing a dynamic load balancing scheme, not only the new call blocking probability, but also the handover dropping probability can be improved substantially, without reserving any channels or assigning any priority to handover calls. In fact, employing dynamic load balancing without any guard channels outperforms a conventional system that employs the well-known guard channel method (GCM).
{"title":"Handover performance of dynamic load balancing schemes in cellular networks","authors":"E. Yanmaz, O. Tonguz","doi":"10.1109/ISCC.2005.76","DOIUrl":"https://doi.org/10.1109/ISCC.2005.76","url":null,"abstract":"In this paper, we propose to use a dynamic load balancing scheme that utilizes fixed relay stations placed in a cellular geographical coverage area to improve the handover performance in cellular networks. To this end, we develop closed-form performance expressions and derive the handover dropping probability in terms of the main system parameters, such as the new call and handover arrival rates, the number of fixed and load-balancing channels per cell, the load balancing probability for new and handover calls, etc. Our results show that by employing a dynamic load balancing scheme, not only the new call blocking probability, but also the handover dropping probability can be improved substantially, without reserving any channels or assigning any priority to handover calls. In fact, employing dynamic load balancing without any guard channels outperforms a conventional system that employs the well-known guard channel method (GCM).","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133062936","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}
Programmable network architectures facilitate dynamically updatable functionality to enable selective and trusted third parties on-demand service deployment. Resource and security management of such architectures on shared infrastructure have proven as challenging tasks. This is due to the extent of functionality provided to users and the heterogenous nature of service resource requirements and resource availability. In this paper we present a new programmable network platform that enables safe sharing by providing each trusted user (e.g., an Internet service provider) with a secure, separate, and resource assured partition, representing a 'virtual router', to accommodate their services. To allocate router internal resources among these partitions and among competing services within a partition, this paper uses a new scalable and adaptive mechanism called control plane-quality of service (C-QoS).
{"title":"Partitioning and differentiated resource allocation in programmable networks","authors":"B. Yousef, D. Hoang, G. Rogers","doi":"10.1109/ISCC.2005.119","DOIUrl":"https://doi.org/10.1109/ISCC.2005.119","url":null,"abstract":"Programmable network architectures facilitate dynamically updatable functionality to enable selective and trusted third parties on-demand service deployment. Resource and security management of such architectures on shared infrastructure have proven as challenging tasks. This is due to the extent of functionality provided to users and the heterogenous nature of service resource requirements and resource availability. In this paper we present a new programmable network platform that enables safe sharing by providing each trusted user (e.g., an Internet service provider) with a secure, separate, and resource assured partition, representing a 'virtual router', to accommodate their services. To allocate router internal resources among these partitions and among competing services within a partition, this paper uses a new scalable and adaptive mechanism called control plane-quality of service (C-QoS).","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114934282","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}
F. González-Castaño, F. Gil-Castiñeira, M. Rodelgo-Lacruz, R. Asorey-Cacheda
HomePlug powerline communications networks link individual computers or network segments via low-voltage power lines. The powerline medium is a harsh channel, since it varies in time and has a high attenuation. This makes difficult to communicate different devices in distant places in a building. A possible solution is the HomePlug repeater we propose in this paper. We show that it is impossible to develop a repeater at the physical layer, so we have developed it at medium access control (MAC) level. Its main distinctive features are transparency (no planning is necessary) and availability (it is built from off-the-shelf hardware).
{"title":"Off-the-shelf transparent HomePlug range extension","authors":"F. González-Castaño, F. Gil-Castiñeira, M. Rodelgo-Lacruz, R. Asorey-Cacheda","doi":"10.1109/ISCC.2005.108","DOIUrl":"https://doi.org/10.1109/ISCC.2005.108","url":null,"abstract":"HomePlug powerline communications networks link individual computers or network segments via low-voltage power lines. The powerline medium is a harsh channel, since it varies in time and has a high attenuation. This makes difficult to communicate different devices in distant places in a building. A possible solution is the HomePlug repeater we propose in this paper. We show that it is impossible to develop a repeater at the physical layer, so we have developed it at medium access control (MAC) level. Its main distinctive features are transparency (no planning is necessary) and availability (it is built from off-the-shelf hardware).","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134217414","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}
Multicast routing protocols today still scale poorly to a large number of concurrent multicast sessions in terms of forwarding states. Unlike previous approaches which concentrated on reducing forwarding states after constructing multicast trees, our approach is to make the underlying routing algorithms aware of the scalability requirement. This scalability-aware approach can be applied to many existing multicast state reduction methods, such as aggregated multicast (AM) and dynamic tunnel multicast (DTM). We have formulated both AM-aware and DTM-aware routing problems as multicriteria optimization problems, and proposed algorithms to solve them.
{"title":"Forwarding state scalability-aware multicast routing","authors":"Guangming Hu, R. Chang","doi":"10.1109/ISCC.2005.73","DOIUrl":"https://doi.org/10.1109/ISCC.2005.73","url":null,"abstract":"Multicast routing protocols today still scale poorly to a large number of concurrent multicast sessions in terms of forwarding states. Unlike previous approaches which concentrated on reducing forwarding states after constructing multicast trees, our approach is to make the underlying routing algorithms aware of the scalability requirement. This scalability-aware approach can be applied to many existing multicast state reduction methods, such as aggregated multicast (AM) and dynamic tunnel multicast (DTM). We have formulated both AM-aware and DTM-aware routing problems as multicriteria optimization problems, and proposed algorithms to solve them.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133056700","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}
J. M. Pérez, Luis Miguel Sánchez, Félix García Carballeira, A. Calderón, J. Carretero
Currently there is a growing interest in using Java for high performance computing. Java has many advantages for high performance computing: it is based on a high-level and object-oriented programming model with support for multithreading and distributed computing. Furthermore, Java 's virtual machine allows applications to run on multiple heterogeneous platforms. A major problem with the use of Java for high performance computing is the I/O. This problem has been solved traditionally in clusters using parallel file systems and parallel I/O libraries, however there is a lack of parallel file systems for Java applications. In this paper, we present a Java parallel I/O library called jExpand. It provides high performance I/O by using several NFS servers in parallel, as NFS can be found in multiple platforms (Linux, Solaris, Windows 2000, etc), we provide a universal parallel file system that can be used everywhere. jExpand requires no changes in the NFS server as it uses RPC operations to provide parallel access to the same file. The paper describes the design, implementation and evaluation of jExpand.
{"title":"High performance Java input/output for heterogeneous distributed computing","authors":"J. M. Pérez, Luis Miguel Sánchez, Félix García Carballeira, A. Calderón, J. Carretero","doi":"10.1109/ISCC.2005.79","DOIUrl":"https://doi.org/10.1109/ISCC.2005.79","url":null,"abstract":"Currently there is a growing interest in using Java for high performance computing. Java has many advantages for high performance computing: it is based on a high-level and object-oriented programming model with support for multithreading and distributed computing. Furthermore, Java 's virtual machine allows applications to run on multiple heterogeneous platforms. A major problem with the use of Java for high performance computing is the I/O. This problem has been solved traditionally in clusters using parallel file systems and parallel I/O libraries, however there is a lack of parallel file systems for Java applications. In this paper, we present a Java parallel I/O library called jExpand. It provides high performance I/O by using several NFS servers in parallel, as NFS can be found in multiple platforms (Linux, Solaris, Windows 2000, etc), we provide a universal parallel file system that can be used everywhere. jExpand requires no changes in the NFS server as it uses RPC operations to provide parallel access to the same file. The paper describes the design, implementation and evaluation of jExpand.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129323488","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}
This paper presents a new solution to the dynamic all-pairs shortest path routing problem, using a linear reinforcement learning scheme. It involves finding the shortest path in a stochastic network, where there are continuous probabilistically-based updates in link-costs. In this paper we present the details of the algorithm and also provide an example to illustrate how the algorithm would function. The initial experimental results of the algorithm show that the algorithm is few orders of magnitude superior to the algorithms available in the literature. It can be used to find the shortest path (between all pairs of nodes in a network) within the "statistical" average network, which converges irrespective of whether there are new changes in link-costs or not. On the other hand, the existing algorithms fails to exhibit such a behavior and would recalculate the affected shortest paths after each link-cost update.
{"title":"New algorithms for maintaining all-pairs shortest paths","authors":"S. Misra, B. Oommen","doi":"10.1109/ISCC.2005.107","DOIUrl":"https://doi.org/10.1109/ISCC.2005.107","url":null,"abstract":"This paper presents a new solution to the dynamic all-pairs shortest path routing problem, using a linear reinforcement learning scheme. It involves finding the shortest path in a stochastic network, where there are continuous probabilistically-based updates in link-costs. In this paper we present the details of the algorithm and also provide an example to illustrate how the algorithm would function. The initial experimental results of the algorithm show that the algorithm is few orders of magnitude superior to the algorithms available in the literature. It can be used to find the shortest path (between all pairs of nodes in a network) within the \"statistical\" average network, which converges irrespective of whether there are new changes in link-costs or not. On the other hand, the existing algorithms fails to exhibit such a behavior and would recalculate the affected shortest paths after each link-cost update.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121744375","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}
Future IP networks demand increased resilience. We present two new routing algorithms which provide at each node two or more next hops towards every destination, so that nodes can react quickly without further signaling to link or node failures. We derive formal requirements of this approach on the routing graphs, describe and analyze two algorithms and introduce a new link weight metric dependent on the network topology only. Both algorithms are evaluated in terms of the number of protected nodes and links.
{"title":"Two routing algorithms for failure protection in IP networks","authors":"C. Reichert, Yuri Glikman, T. Magedanz","doi":"10.1109/ISCC.2005.150","DOIUrl":"https://doi.org/10.1109/ISCC.2005.150","url":null,"abstract":"Future IP networks demand increased resilience. We present two new routing algorithms which provide at each node two or more next hops towards every destination, so that nodes can react quickly without further signaling to link or node failures. We derive formal requirements of this approach on the routing graphs, describe and analyze two algorithms and introduce a new link weight metric dependent on the network topology only. Both algorithms are evaluated in terms of the number of protected nodes and links.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"2009 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127331561","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
扫码关注我们
求助内容：
应助结果提醒方式：