The increasing popularity of the Internet and networking has resulted in a significant growth in Internet traffic, coupled with an increase in the number of Internet routers. The increase in routers has resulted in the development of more complex routing algorithms, larger routing tables (requiring more memory), ultimately increasing the time required to search the lookup table. The Cartesian network is an attempt to overcome these problems. Instead of improving the search algorithm, it entirely removes the need for a table lookup. The Cartesian unicast routing algorithm is a novel routing methodology in which a packet's route is determined by the position of the router relative to that of the destination. This paper describes the hardware design, development, and implementation of the Cartesian routers. A parallel architecture is proposed for the Cartesian routers. Field programmable gate arrays (FPGA) devices are selected as a target platform for hardware implementation.
{"title":"The design and implementation of a Cartesian router","authors":"Mohammad Farajmandi, Larry Hughes","doi":"10.1109/CNSR.2005.59","DOIUrl":"https://doi.org/10.1109/CNSR.2005.59","url":null,"abstract":"The increasing popularity of the Internet and networking has resulted in a significant growth in Internet traffic, coupled with an increase in the number of Internet routers. The increase in routers has resulted in the development of more complex routing algorithms, larger routing tables (requiring more memory), ultimately increasing the time required to search the lookup table. The Cartesian network is an attempt to overcome these problems. Instead of improving the search algorithm, it entirely removes the need for a table lookup. The Cartesian unicast routing algorithm is a novel routing methodology in which a packet's route is determined by the position of the router relative to that of the destination. This paper describes the hardware design, development, and implementation of the Cartesian routers. A parallel architecture is proposed for the Cartesian routers. Field programmable gate arrays (FPGA) devices are selected as a target platform for hardware implementation.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129728583","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}
Sriram Ganapathi Subramanian, S. Sivakumar, W. Phillips, W. Robertson
TCP is the widely used transport protocol across the Internet but it was originally designed for wired networks. In satellite networks, TCP encounters serious problems due to the physical properties of the wireless medium. The high delays in GEO networks and high variability of delay in LEO systems are the most significant factors affecting TCP performance. This paper identifies and illustrates TCP performance issues in satellite links by making a detailed comparison between these two common satellite altitudes. In low altitude satellite constellations, the propagation and switching delays are highly variable because of routing changes and handovers. Previous work on variable delay has focused explicitly on the retransmit timer. This paper makes a flow based analysis of abrupt delay changes to better understand TCP performance in LEO systems. Simulations are performed with the NS 2 satellite extension using the iridium constellation. It is observed that TCP performs better in LEO than in GEO systems because of its lower latency. It is also shown that large receiver buffers and intermediate buffers can alleviate the effect of abrupt delay changes in satellite networks.
{"title":"Investigating TCP performance issues in satellite networks","authors":"Sriram Ganapathi Subramanian, S. Sivakumar, W. Phillips, W. Robertson","doi":"10.1109/CNSR.2005.37","DOIUrl":"https://doi.org/10.1109/CNSR.2005.37","url":null,"abstract":"TCP is the widely used transport protocol across the Internet but it was originally designed for wired networks. In satellite networks, TCP encounters serious problems due to the physical properties of the wireless medium. The high delays in GEO networks and high variability of delay in LEO systems are the most significant factors affecting TCP performance. This paper identifies and illustrates TCP performance issues in satellite links by making a detailed comparison between these two common satellite altitudes. In low altitude satellite constellations, the propagation and switching delays are highly variable because of routing changes and handovers. Previous work on variable delay has focused explicitly on the retransmit timer. This paper makes a flow based analysis of abrupt delay changes to better understand TCP performance in LEO systems. Simulations are performed with the NS 2 satellite extension using the iridium constellation. It is observed that TCP performs better in LEO than in GEO systems because of its lower latency. It is also shown that large receiver buffers and intermediate buffers can alleviate the effect of abrupt delay changes in satellite networks.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131128712","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}
Mehran Nadjarbashi-Noghani, Jie Zhang, S. H. Sadat-Mohtasham, A. Ghorbani
A framework has been developed as a basis for design and implementation of adaptive Web systems. This framework and the respective architecture support the idea of high-level synthesis and facilitate different types of adaptation. In this paper, we describe main components in the framework, and introduce an example application from e-News domain, a personalized electronic news system (PENS). PENS is implemented as the proof of concept and to demonstrate how Web pages are synthesized with different attributes from the same description, and to show adaptation based on users' behavior and client-side characteristics.
{"title":"PENS: a personalized electronic news system","authors":"Mehran Nadjarbashi-Noghani, Jie Zhang, S. H. Sadat-Mohtasham, A. Ghorbani","doi":"10.1109/CNSR.2005.49","DOIUrl":"https://doi.org/10.1109/CNSR.2005.49","url":null,"abstract":"A framework has been developed as a basis for design and implementation of adaptive Web systems. This framework and the respective architecture support the idea of high-level synthesis and facilitate different types of adaptation. In this paper, we describe main components in the framework, and introduce an example application from e-News domain, a personalized electronic news system (PENS). PENS is implemented as the proof of concept and to demonstrate how Web pages are synthesized with different attributes from the same description, and to show adaptation based on users' behavior and client-side characteristics.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120859361","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}
Mobile IP provides node mobility by allowing change in point of attachment to the network. Handling the mobile network performance degradation due to critical packet loss during handoff is the main focus of this paper. Critical packets are defined according to application objectives. Combination of efficient scheduling algorithms, optimum window size and priority buffers have been proposed as a solution to decrease the critical packet loss and improve the quality of service. Simulation results substantiate the ideas presented in this paper.
{"title":"Multi-level priority queue scheduling algorithm for critical packet loss elimination during handoff","authors":"M. Madani, J. Light","doi":"10.1109/CNSR.2005.42","DOIUrl":"https://doi.org/10.1109/CNSR.2005.42","url":null,"abstract":"Mobile IP provides node mobility by allowing change in point of attachment to the network. Handling the mobile network performance degradation due to critical packet loss during handoff is the main focus of this paper. Critical packets are defined according to application objectives. Combination of efficient scheduling algorithms, optimum window size and priority buffers have been proposed as a solution to decrease the critical packet loss and improve the quality of service. Simulation results substantiate the ideas presented in this paper.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123739715","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}
SCTP (stream control transmission protocol) is a recently standardized transport level protocol that has several features not present in TCP. These features make SCTP a better transport level protocol to support MPI (message passing interface). MPI is a message passing library that is widely used to parallelize scientific and compute intensive programs. Recently there has been interest in porting MPI programs to execute in a wide area network. We evaluated the use of SCTP and designed and modified a public domain version of the MPI middleware to use SCTP. We describe the advantages and disadvantages of SCTP and describe the changes that were necessary to the MPI middleware.
{"title":"SCTP-based middleware for MPI in wide-area networks","authors":"Humaira Kamal, Brad Penoff, Alan S. Wagner","doi":"10.1109/CNSR.2005.56","DOIUrl":"https://doi.org/10.1109/CNSR.2005.56","url":null,"abstract":"SCTP (stream control transmission protocol) is a recently standardized transport level protocol that has several features not present in TCP. These features make SCTP a better transport level protocol to support MPI (message passing interface). MPI is a message passing library that is widely used to parallelize scientific and compute intensive programs. Recently there has been interest in porting MPI programs to execute in a wide area network. We evaluated the use of SCTP and designed and modified a public domain version of the MPI middleware to use SCTP. We describe the advantages and disadvantages of SCTP and describe the changes that were necessary to the MPI middleware.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121784624","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}
Wireless sensor networks (WSNs) present a new generation of real-time embedded systems with limited computation, energy and memory resources that are being used in a wide variety of applications where traditional networking infrastructure is practically infeasible. Appropriate cluster-head node election can drastically reduce the energy consumption and enhance the lifetime of the network. In this paper, a fuzzy logic approach to cluster-head election is proposed based on three descriptors-energy, concentration and centrality. Simulation shows that depending upon network configuration, a substantial increase in network lifetime can be accomplished as compared to probabilistically selecting the nodes as cluster-heads using only local information.
{"title":"Cluster-head election using fuzzy logic for wireless sensor networks","authors":"Indranil Gupta, Denis Riordan, S. Sampalli","doi":"10.1109/CNSR.2005.27","DOIUrl":"https://doi.org/10.1109/CNSR.2005.27","url":null,"abstract":"Wireless sensor networks (WSNs) present a new generation of real-time embedded systems with limited computation, energy and memory resources that are being used in a wide variety of applications where traditional networking infrastructure is practically infeasible. Appropriate cluster-head node election can drastically reduce the energy consumption and enhance the lifetime of the network. In this paper, a fuzzy logic approach to cluster-head election is proposed based on three descriptors-energy, concentration and centrality. Simulation shows that depending upon network configuration, a substantial increase in network lifetime can be accomplished as compared to probabilistically selecting the nodes as cluster-heads using only local information.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130518471","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}
Jian-guo Zhou, Xiao Chen, P. Yan, Jing Wu, Gui-wen Yang
This paper presents a speed based active queue management scheme. This scheme predicts the incoming and outgoing speed of every active flow in the next sample intervals according to the history data. And then with the queue length of every flow at the end of last a few intervals, predicted incoming and outgoing rate and expected queue length, drop probability in this interval is calculated. The goal of this scheme is to achieve both stabilized queue length and per-flow fairness. Through ns-2 simulation, we compare SBAQM against FRED and SRED and obtain satisfying results.
{"title":"A speed based active queue management scheme","authors":"Jian-guo Zhou, Xiao Chen, P. Yan, Jing Wu, Gui-wen Yang","doi":"10.1109/CNSR.2005.18","DOIUrl":"https://doi.org/10.1109/CNSR.2005.18","url":null,"abstract":"This paper presents a speed based active queue management scheme. This scheme predicts the incoming and outgoing speed of every active flow in the next sample intervals according to the history data. And then with the queue length of every flow at the end of last a few intervals, predicted incoming and outgoing rate and expected queue length, drop probability in this interval is calculated. The goal of this scheme is to achieve both stabilized queue length and per-flow fairness. Through ns-2 simulation, we compare SBAQM against FRED and SRED and obtain satisfying results.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374918","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}
Zikuan Liu, J. Almhana, V. Choulakian, R. McGorman
Internet traffic is usually represented by a time series of number of packets or number of bits received in each time slot. There exists a class of Internet traffic traces that have slowly decreasing autocorrelation, their marginal distributions of the number of packets are fit by negative binomial distributions and the time series of number of bits are fit by Gamma distributions. To model this class of traffic, this paper divides the traffic input stream into several sub-streams by decomposing their autocorrelation functions, and models each substream as a negative binomial time series or a Gamma time series. The proposed models can simultaneously capture the autocorrelation and the marginal distribution. A queue performance criterion is used to validate the models.
{"title":"Modeling Internet traffic using nonGaussian time series models","authors":"Zikuan Liu, J. Almhana, V. Choulakian, R. McGorman","doi":"10.1109/CNSR.2005.41","DOIUrl":"https://doi.org/10.1109/CNSR.2005.41","url":null,"abstract":"Internet traffic is usually represented by a time series of number of packets or number of bits received in each time slot. There exists a class of Internet traffic traces that have slowly decreasing autocorrelation, their marginal distributions of the number of packets are fit by negative binomial distributions and the time series of number of bits are fit by Gamma distributions. To model this class of traffic, this paper divides the traffic input stream into several sub-streams by decomposing their autocorrelation functions, and models each substream as a negative binomial time series or a Gamma time series. The proposed models can simultaneously capture the autocorrelation and the marginal distribution. A queue performance criterion is used to validate the models.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"19 S1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125820772","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}
We consider the inter-antenna separation in a distributed antenna array. We introduce a new separation constraint with respect to the signalling wavelength, which equals the chip wavelength in DS-CDMA systems and the symbol wavelength in non-spread systems. This constraint ensures the phases of the frequency responses are exercised over 2/spl pi/ in the baseband channel matrix. The diverse phases provide a better channel matrix for signal detection. The multiuser performance improvement due to this constraint has been named as the signalling wavelength antenna placement (SWAP) gain.
{"title":"Signalling wavelength in an antenna array for space-time wireless over LOS channels","authors":"Guangran Zhu, B. Petersen, B. Colpitts","doi":"10.1109/CNSR.2005.58","DOIUrl":"https://doi.org/10.1109/CNSR.2005.58","url":null,"abstract":"We consider the inter-antenna separation in a distributed antenna array. We introduce a new separation constraint with respect to the signalling wavelength, which equals the chip wavelength in DS-CDMA systems and the symbol wavelength in non-spread systems. This constraint ensures the phases of the frequency responses are exercised over 2/spl pi/ in the baseband channel matrix. The diverse phases provide a better channel matrix for signal detection. The multiuser performance improvement due to this constraint has been named as the signalling wavelength antenna placement (SWAP) gain.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130262478","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}
Implementation of modern digital transceivers requires an expertise in numerous fields. Conventional transceiver design methods are no longer sufficient to guarantee a fast conversion from initial concept to final product. Moreover, in the testing phase, system simulations alone cannot provide the full insight into the system parameters and performance, especially at the RF stages, where the modeling of power amplifier non-linearities is a highly complex task. To address these design gaps, this paper utilizes software radio solutions. Specifically, it elaborates on transceiver architectural methods at the baseband involving hardware/software partitioning, as well as automatic digital signal processing (DSP) coding strategies that allow for rapid prototyping, testing and verification of algorithms developed in the design simulation stages. In particular, DSP processor and field programmable gate array (FPGA)-based testbeds are described that offer different advantages in the transceiver rapid prototyping methodology. These testbeds were designed to eventually be used in experiments geared towards demonstrating the effectiveness of compensation algorithms for wireless systems like wireless local area network (WLAN) and digital audio broadcasting (DAB), where orthogonal frequency division multiplexed (OFDM) signaling is deployed.
{"title":"Rapid prototyping hardware platforms for the development and testing of OFDM based communication systems","authors":"Craig Jamieson, S. Melvin, J. Ilow","doi":"10.1109/CNSR.2005.51","DOIUrl":"https://doi.org/10.1109/CNSR.2005.51","url":null,"abstract":"Implementation of modern digital transceivers requires an expertise in numerous fields. Conventional transceiver design methods are no longer sufficient to guarantee a fast conversion from initial concept to final product. Moreover, in the testing phase, system simulations alone cannot provide the full insight into the system parameters and performance, especially at the RF stages, where the modeling of power amplifier non-linearities is a highly complex task. To address these design gaps, this paper utilizes software radio solutions. Specifically, it elaborates on transceiver architectural methods at the baseband involving hardware/software partitioning, as well as automatic digital signal processing (DSP) coding strategies that allow for rapid prototyping, testing and verification of algorithms developed in the design simulation stages. In particular, DSP processor and field programmable gate array (FPGA)-based testbeds are described that offer different advantages in the transceiver rapid prototyping methodology. These testbeds were designed to eventually be used in experiments geared towards demonstrating the effectiveness of compensation algorithms for wireless systems like wireless local area network (WLAN) and digital audio broadcasting (DAB), where orthogonal frequency division multiplexed (OFDM) signaling is deployed.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130930489","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
扫码关注我们
求助内容：
应助结果提醒方式：