Pub Date : 2003-09-21DOI: 10.1109/APCC.2003.1274290
Torgny Holmberg, J. Karlsson
In HiperAccess, the scheduling problem takes two forms; firstly, the base station reserves capacity on the uplink for the different terminals, and secondly, the terminals schedule their respective traffic in its assigned share of the channel capacity. Further, the base station generally has less and older information than the terminals, hence, the base station and the terminals may act differently for a given scenario. In view of this, scheduling traffic with quality of service (QoS) demands can be very difficult. In this paper, we propose a terminal scheduler capable of serving real-time and best-effort traffic with demands on QoS. Further, a new measure of fairness which is well suited for time-slotted systems is proposed.
{"title":"Fair scheduling of uplink traffic in HiperAccess","authors":"Torgny Holmberg, J. Karlsson","doi":"10.1109/APCC.2003.1274290","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274290","url":null,"abstract":"In HiperAccess, the scheduling problem takes two forms; firstly, the base station reserves capacity on the uplink for the different terminals, and secondly, the terminals schedule their respective traffic in its assigned share of the channel capacity. Further, the base station generally has less and older information than the terminals, hence, the base station and the terminals may act differently for a given scenario. In view of this, scheduling traffic with quality of service (QoS) demands can be very difficult. In this paper, we propose a terminal scheduler capable of serving real-time and best-effort traffic with demands on QoS. Further, a new measure of fairness which is well suited for time-slotted systems is proposed.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"24-25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121790790","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274254
Ong Tian Choon, A. Samsudin
Computational grid scientists had spent tireless amount of effort to come up with a secure environment for sharing resources. However, advance intruders still compromising machines on the grid, which justify the research in intrusion detection system for grid environment. This paper describes the detail concept of having a grid-based intrusion detection system (GIDS) for the grid environment. We give few scenarios on how GIDS can take place on the grid environment. We also discuss some issues of the GIDS on grid environment with suggested solutions. A proposed solution is discussed from conceptual framework toward technical architecture.
{"title":"Grid-based intrusion detection system","authors":"Ong Tian Choon, A. Samsudin","doi":"10.1109/APCC.2003.1274254","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274254","url":null,"abstract":"Computational grid scientists had spent tireless amount of effort to come up with a secure environment for sharing resources. However, advance intruders still compromising machines on the grid, which justify the research in intrusion detection system for grid environment. This paper describes the detail concept of having a grid-based intrusion detection system (GIDS) for the grid environment. We give few scenarios on how GIDS can take place on the grid environment. We also discuss some issues of the GIDS on grid environment with suggested solutions. A proposed solution is discussed from conceptual framework toward technical architecture.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130149912","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274284
M. Bag-Mohammadi, S. Samadian-Barzoki, N. Yazdani
Many multicast routing protocols construct SPTs (shortest path trees) to deliver multicast data packets to the receivers with the minimum delay. Some protocols, on the other hand, try to minimize the bandwidth consumption in the multicast distribution tree using Steiner trees. In this paper, we propose a new multicast routing protocol called NRBP (near receiver branching point) which can construct a wide range of multicast distribution trees between these two extremes. Changing the protocol parameters controls the tree characteristics. Our protocol is not only able to build SPT with minimum total tree cost, but also it can create semi-Steiner tree with less data delivery delay. Benefits of the proposed protocol include some sort of congestion avoidance, controlling the MFT (multicast forwarding table) memory requirements and QoS provisioning.
{"title":"Near receiver branching point multicast protocol","authors":"M. Bag-Mohammadi, S. Samadian-Barzoki, N. Yazdani","doi":"10.1109/APCC.2003.1274284","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274284","url":null,"abstract":"Many multicast routing protocols construct SPTs (shortest path trees) to deliver multicast data packets to the receivers with the minimum delay. Some protocols, on the other hand, try to minimize the bandwidth consumption in the multicast distribution tree using Steiner trees. In this paper, we propose a new multicast routing protocol called NRBP (near receiver branching point) which can construct a wide range of multicast distribution trees between these two extremes. Changing the protocol parameters controls the tree characteristics. Our protocol is not only able to build SPT with minimum total tree cost, but also it can create semi-Steiner tree with less data delivery delay. Benefits of the proposed protocol include some sort of congestion avoidance, controlling the MFT (multicast forwarding table) memory requirements and QoS provisioning.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134361133","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274319
Shen Gang, Jin Shan, Zhang Kaibing, Gui Luoning
Real-time periodic transmission across packet switched networks that experience stochastic-delays requires clock recovery at the destination. In this paper, improved self-adaptive clock recovery methods are proposed. Since these methods fully consider network characteristic's influence to clock recovery, they have the ability to filter out buffer level fluctuation efficiently and remove the negative contribution of delay jitter in clock recovery. As compared to the existing ones, new methods enable the destination clock to be synchronized with the source faster and with more accuracy.
{"title":"Self-adaptive clock recovery methods for time periodic traffic across packet switched networks","authors":"Shen Gang, Jin Shan, Zhang Kaibing, Gui Luoning","doi":"10.1109/APCC.2003.1274319","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274319","url":null,"abstract":"Real-time periodic transmission across packet switched networks that experience stochastic-delays requires clock recovery at the destination. In this paper, improved self-adaptive clock recovery methods are proposed. Since these methods fully consider network characteristic's influence to clock recovery, they have the ability to filter out buffer level fluctuation efficiently and remove the negative contribution of delay jitter in clock recovery. As compared to the existing ones, new methods enable the destination clock to be synchronized with the source faster and with more accuracy.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126577708","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274314
D. Sahu, D. Ghosh, I. Chakrabarti
The present paper proposes architecture for quality-adaptive real-time transmission of audio streams over the Internet. A feedback mechanism between the transport layer and the application layer, that ensures the quality adjustment of real-time streams, forms the backbone of this architecture. A rate adaptation protocol, based on the additive increase/multiplicative decrease principle, is the underlying protocol for the transport layer. It has been proved to be TCP-friendly, fair and effective in keeping the network congestion control separate from the application layer. A quality-adaptive layered coder serves to achieve reliability in the application layer.
{"title":"A quality-adaptive TCP-friendly architecture for real-time streams in the Internet","authors":"D. Sahu, D. Ghosh, I. Chakrabarti","doi":"10.1109/APCC.2003.1274314","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274314","url":null,"abstract":"The present paper proposes architecture for quality-adaptive real-time transmission of audio streams over the Internet. A feedback mechanism between the transport layer and the application layer, that ensures the quality adjustment of real-time streams, forms the backbone of this architecture. A rate adaptation protocol, based on the additive increase/multiplicative decrease principle, is the underlying protocol for the transport layer. It has been proved to be TCP-friendly, fair and effective in keeping the network congestion control separate from the application layer. A quality-adaptive layered coder serves to achieve reliability in the application layer.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131018339","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274447
P. Chacko, G.C. Kuan, T.T. Slew, Edgar Yee
Low phase noise is one of the most important criteria for a good VCO design. In typical VCO design, a high Q tank circuitry must be used to achieve a good phase noise performance. As part of the effort to achieve high Q, resonator is used in favor to coil. Here, we propose the possibility of using coil yet maintaining a good phase noise performance. By using coil, design cost and area will be saved. However to adopt this concept, some design guidelines must be followed and they will be discussed. In this paper, a cost-saving concept for a good VCO design will be presented.
{"title":"Can coil replace resonator in VCO design?","authors":"P. Chacko, G.C. Kuan, T.T. Slew, Edgar Yee","doi":"10.1109/APCC.2003.1274447","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274447","url":null,"abstract":"Low phase noise is one of the most important criteria for a good VCO design. In typical VCO design, a high Q tank circuitry must be used to achieve a good phase noise performance. As part of the effort to achieve high Q, resonator is used in favor to coil. Here, we propose the possibility of using coil yet maintaining a good phase noise performance. By using coil, design cost and area will be saved. However to adopt this concept, some design guidelines must be followed and they will be discussed. In this paper, a cost-saving concept for a good VCO design will be presented.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133642463","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274354
R. Jayaparvathy, S. Anand, S. Srikanth
In this paper, we present a performance analysis of OFDM based cellular systems when using dynamic packet assignment in the uplink. We propose a two dimensional Markov chain to model the state of the traffic in each cell of a cellular system with data-only traffic and solve this Markov chain to compute the buffering probability, mean delay, and the average system throughput. We perform simulations to determine the optimum position of the base station at which we obtain the best system performance in terms of mean delay. We show that dynamic packet assignment provides improved performance compared to dynamic channel assignment in terms of Erlang capacity. We also show that our analytical model is accurate and computationally efficient.
{"title":"Dynamic packet assignment in OFDM based cellular systems - performance analysis","authors":"R. Jayaparvathy, S. Anand, S. Srikanth","doi":"10.1109/APCC.2003.1274354","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274354","url":null,"abstract":"In this paper, we present a performance analysis of OFDM based cellular systems when using dynamic packet assignment in the uplink. We propose a two dimensional Markov chain to model the state of the traffic in each cell of a cellular system with data-only traffic and solve this Markov chain to compute the buffering probability, mean delay, and the average system throughput. We perform simulations to determine the optimum position of the base station at which we obtain the best system performance in terms of mean delay. We show that dynamic packet assignment provides improved performance compared to dynamic channel assignment in terms of Erlang capacity. We also show that our analytical model is accurate and computationally efficient.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058315","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274306
A. Rostami, G. Rostami
Bragg grating has key role both in monolithic and hybrid optical integrated circuits. For digital optical signal processing, all we need are optical monolithic logic gates. For the realization of digital optical integrated circuits (DOIC), the optical limiter is one of the important unit to be considered. In this paper, we present the exact solution for forward and backward travelling electric fields in Kerr-like nonlinear grating. Based on our predicted result, we show that, the limiter behavior can be obtained. Also, this result applied to special index of refraction profiles and compared together.
{"title":"Integrated optical limiter using Kerr-like nonlinear Bragg grating","authors":"A. Rostami, G. Rostami","doi":"10.1109/APCC.2003.1274306","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274306","url":null,"abstract":"Bragg grating has key role both in monolithic and hybrid optical integrated circuits. For digital optical signal processing, all we need are optical monolithic logic gates. For the realization of digital optical integrated circuits (DOIC), the optical limiter is one of the important unit to be considered. In this paper, we present the exact solution for forward and backward travelling electric fields in Kerr-like nonlinear grating. Based on our predicted result, we show that, the limiter behavior can be obtained. Also, this result applied to special index of refraction profiles and compared together.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114455623","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274321
A. Girotra, S. Johar, D. Ghosh, I. Chakrabarti
With the ever-increasing demand for real-time video applications, a dedicated and efficient architecture for motion estimation has become a necessity. In this paper, we present an architecture for affine motion estimation which meets the real-time application requirements. The architecture employs a modular memory structure for efficient pipelined parallel implementation of affine motion estimation using the one-dimensional hierarchical search (IDHS) algorithm. Implementation results in terms of the number of clock cycles and PSNR values demonstrate the efficiency of the proposed architecture.
{"title":"An architecture for affine motion estimation in real-time video coding","authors":"A. Girotra, S. Johar, D. Ghosh, I. Chakrabarti","doi":"10.1109/APCC.2003.1274321","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274321","url":null,"abstract":"With the ever-increasing demand for real-time video applications, a dedicated and efficient architecture for motion estimation has become a necessity. In this paper, we present an architecture for affine motion estimation which meets the real-time application requirements. The architecture employs a modular memory structure for efficient pipelined parallel implementation of affine motion estimation using the one-dimensional hierarchical search (IDHS) algorithm. Implementation results in terms of the number of clock cycles and PSNR values demonstrate the efficiency of the proposed architecture.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114926643","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 : 2003-09-21DOI: 10.1109/APCC.2003.1274428
L. Latiff, N. Fisal
This paper presents a review of current routing protocols used in mobile ad hoc network (MANET). Routing is a challenging issue in ad hoc network since nodes are mobile and the topology of the networks is ever changing. Besides, all nodes need to communicate via wireless infrastructure. Routing metrics used such as shortest path, link quality, power conservation and position location (PL) will reduce route discovery time and also message update cost.
{"title":"Routing protocols in wireless mobile ad hoc network - a review","authors":"L. Latiff, N. Fisal","doi":"10.1109/APCC.2003.1274428","DOIUrl":"https://doi.org/10.1109/APCC.2003.1274428","url":null,"abstract":"This paper presents a review of current routing protocols used in mobile ad hoc network (MANET). Routing is a challenging issue in ad hoc network since nodes are mobile and the topology of the networks is ever changing. Besides, all nodes need to communicate via wireless infrastructure. Routing metrics used such as shortest path, link quality, power conservation and position location (PL) will reduce route discovery time and also message update cost.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115051686","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
扫码关注我们
求助内容：
应助结果提醒方式：