Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366593
A. Rahman, M. Murshed, L. Dooley
A new unified video indexing and retrieval method is presented to classify temporal texture videos using spatial as well as temporal cooccurrence statistics of block-based motion vectors, so keeping the computational complexity for retrieval within a real-time bound. Experimental results clearly demonstrate the superiority of the proposed method over existing temporal cooccurrence matrix-based solutions.
{"title":"A new video indexing and retrieval method for temporal textures using block-based cooccurrence statistics","authors":"A. Rahman, M. Murshed, L. Dooley","doi":"10.1109/INCC.2004.1366593","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366593","url":null,"abstract":"A new unified video indexing and retrieval method is presented to classify temporal texture videos using spatial as well as temporal cooccurrence statistics of block-based motion vectors, so keeping the computational complexity for retrieval within a real-time bound. Experimental results clearly demonstrate the superiority of the proposed method over existing temporal cooccurrence matrix-based solutions.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115010599","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 : 2004-06-11DOI: 10.1109/INCC.2004.1366584
M.S.A. Khan, S.M.A. Burney, M. Naseem
A key implementation issue of multicast switching systems is the reduction of cell conflicts which occur when two, or more, cells approach for the same link, internal link or output link, simultaneously. When a cell conflict occurs, only one of the contending cells is allowed to access the link and the others are dropped or stored in internal buffers. The cell contention is the basic reason that the switch throughput drops. Several contention resolution schemes have been proposed. Each input port is associated with a tag queue for storing a routing text of arriving cells, and a cell-scheduling controller is provided to resolve the output contention problem according to the HOL (head-of-line) entries of tag queues. The proposed algorithm differs from previous algorithms in that we consider the output contention resolution for multiple slots instead of only the current time slot. Like a window based scheduling algorithm, our algorithm allows cells behind an HOL cell to be transmitted prior to the HOL cell in the same input port. Thus, HOL blocking can be alleviated. The delay throughput performance of our algorithm outperforms most of those algorithms that consider the output contention resolution only for the current time slot.
{"title":"Multislot scheduling algorithm in ATM networks","authors":"M.S.A. Khan, S.M.A. Burney, M. Naseem","doi":"10.1109/INCC.2004.1366584","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366584","url":null,"abstract":"A key implementation issue of multicast switching systems is the reduction of cell conflicts which occur when two, or more, cells approach for the same link, internal link or output link, simultaneously. When a cell conflict occurs, only one of the contending cells is allowed to access the link and the others are dropped or stored in internal buffers. The cell contention is the basic reason that the switch throughput drops. Several contention resolution schemes have been proposed. Each input port is associated with a tag queue for storing a routing text of arriving cells, and a cell-scheduling controller is provided to resolve the output contention problem according to the HOL (head-of-line) entries of tag queues. The proposed algorithm differs from previous algorithms in that we consider the output contention resolution for multiple slots instead of only the current time slot. Like a window based scheduling algorithm, our algorithm allows cells behind an HOL cell to be transmitted prior to the HOL cell in the same input port. Thus, HOL blocking can be alleviated. The delay throughput performance of our algorithm outperforms most of those algorithms that consider the output contention resolution only for the current time slot.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114199130","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 : 2004-06-11DOI: 10.1109/INCC.2004.1366585
G. Shen, Mohamed H. M. Nizam, E. Liu, L. Gui, X. Xu
Real-time periodic transmission across packet switched networks requires clock recovery at the destination. The stochastic nature of packet traffic makes clock recovery difficult. A new packet network clock recovery algorithm is proposed for fast and accurate synchronization. The algorithm has the ability to filter out buffer level fluctuations efficiently and remove the negative contribution of delay jitter in clock recovery. As compared with existing algorithms, the new algorithm enables the destination clock to be synchronized with the source more quickly and more accurately.
{"title":"Fast and accurate clock recovery in packet switched networks","authors":"G. Shen, Mohamed H. M. Nizam, E. Liu, L. Gui, X. Xu","doi":"10.1109/INCC.2004.1366585","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366585","url":null,"abstract":"Real-time periodic transmission across packet switched networks requires clock recovery at the destination. The stochastic nature of packet traffic makes clock recovery difficult. A new packet network clock recovery algorithm is proposed for fast and accurate synchronization. The algorithm has the ability to filter out buffer level fluctuations efficiently and remove the negative contribution of delay jitter in clock recovery. As compared with existing algorithms, the new algorithm enables the destination clock to be synchronized with the source more quickly and more accurately.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126782920","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 : 2004-06-11DOI: 10.1109/INCC.2004.1366579
M. Zia, A. A. Siddiqui
The enormous growth of wireless networks has made efficient use of the radio spectrum which is divided into a set of disjoint channels. These channels can be used simultaneously by using an optimal channel allocation scheme. The main limitation with such wireless systems is the number of available channels. Frequency reuse and channel assignment techniques are used to increase the system capacity. In order to avoid interference with other channels, each channel is given a frequency, a time slot, a spreading code or a combination of any of these. Two non-borrowing FCA (fixed channel assignment) schemes, non-prioritized scheme (NPS) and reserved channel scheme (RCS), are compared. In NPS, all the channels in a cell are available for both initial and handoff calls; in RCS, some channels are reserved for handoff calls and the remaining channels can be utilized for both initial and handoff calls. The formulae for computing blocking probabilities for initial and handoff calls are derived using steady state balance equations defined by a Markov chain model. From simulation results, graphs are plotted of blocking probabilities versus total number of channels. These show that the blocking probability is a decreasing function of the number of channels.
{"title":"New calls blocking analysis in cellular systems based on Markov chain model","authors":"M. Zia, A. A. Siddiqui","doi":"10.1109/INCC.2004.1366579","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366579","url":null,"abstract":"The enormous growth of wireless networks has made efficient use of the radio spectrum which is divided into a set of disjoint channels. These channels can be used simultaneously by using an optimal channel allocation scheme. The main limitation with such wireless systems is the number of available channels. Frequency reuse and channel assignment techniques are used to increase the system capacity. In order to avoid interference with other channels, each channel is given a frequency, a time slot, a spreading code or a combination of any of these. Two non-borrowing FCA (fixed channel assignment) schemes, non-prioritized scheme (NPS) and reserved channel scheme (RCS), are compared. In NPS, all the channels in a cell are available for both initial and handoff calls; in RCS, some channels are reserved for handoff calls and the remaining channels can be utilized for both initial and handoff calls. The formulae for computing blocking probabilities for initial and handoff calls are derived using steady state balance equations defined by a Markov chain model. From simulation results, graphs are plotted of blocking probabilities versus total number of channels. These show that the blocking probability is a decreasing function of the number of channels.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129660910","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 : 2004-06-11DOI: 10.1109/INCC.2004.1366578
T. Salim, J. Devlin, J. Whittington
Timing resolution plays a significant role in generating digital phased array beams. We present a latch method for FPGA implementation of digital beamforming (DBF) for an ionospheric radar. The radar requires a constant phasing vector to steer the beam over a specified region of the ionosphere. Sixteen digital beams are derived from the vector with beam resolution of approximately three degrees. The phasing weights can be employed either in the time domain or in the frequency domain. Comparison of phase delay and time delay methods is presented for broadband frequencies of the radar. Performance of the proposed DBF system is presented, including speed limitations.
{"title":"FPGA implementation of a phased array DBF using a latch method","authors":"T. Salim, J. Devlin, J. Whittington","doi":"10.1109/INCC.2004.1366578","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366578","url":null,"abstract":"Timing resolution plays a significant role in generating digital phased array beams. We present a latch method for FPGA implementation of digital beamforming (DBF) for an ionospheric radar. The radar requires a constant phasing vector to steer the beam over a specified region of the ionosphere. Sixteen digital beams are derived from the vector with beam resolution of approximately three degrees. The phasing weights can be employed either in the time domain or in the frequency domain. Comparison of phase delay and time delay methods is presented for broadband frequencies of the radar. Performance of the proposed DBF system is presented, including speed limitations.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124508958","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 : 2004-06-11DOI: 10.1109/INCC.2004.1366588
M. Zafrullah, M. Mirza, M. Waris, M.K. Islam
Optical sources still require an exhaustive and regressive research approach to measure the key parameters leading towards the ultimate robust refining of spectral properties. The scalability in such measurements when the parametric margins have a close comparative difference produces a vital clarity in simulative results. The effect of polarization mode dispersion (PMD) remains a leading consideration in the practical development of a fair square communication system. A white light interferometric set up has been successfully used to characterize optical sources in connection with the effects encountered due to PMD which causes deteriorating setbacks to high speed fiber optic networks. A precise optical test set-up has been developed in the lab to provide an exact picture of the state of polarization through a certain fiber length. The set-up is used to measure PMD for single mode and hi-bi specialty fibers. Rather valuable application results have been achieved for the different optical devices, which reflect the exact measuring levels and comparisons of the effective application in the fields of communication and the precision sensory tangibility of the optical fiber.
{"title":"Producing a scalable sensory precision worth ness of optical sources including PMD measures for high speed optical networks","authors":"M. Zafrullah, M. Mirza, M. Waris, M.K. Islam","doi":"10.1109/INCC.2004.1366588","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366588","url":null,"abstract":"Optical sources still require an exhaustive and regressive research approach to measure the key parameters leading towards the ultimate robust refining of spectral properties. The scalability in such measurements when the parametric margins have a close comparative difference produces a vital clarity in simulative results. The effect of polarization mode dispersion (PMD) remains a leading consideration in the practical development of a fair square communication system. A white light interferometric set up has been successfully used to characterize optical sources in connection with the effects encountered due to PMD which causes deteriorating setbacks to high speed fiber optic networks. A precise optical test set-up has been developed in the lab to provide an exact picture of the state of polarization through a certain fiber length. The set-up is used to measure PMD for single mode and hi-bi specialty fibers. Rather valuable application results have been achieved for the different optical devices, which reflect the exact measuring levels and comparisons of the effective application in the fields of communication and the precision sensory tangibility of the optical fiber.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127681751","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 : 2004-06-11DOI: 10.1109/INCC.2004.1366590
Weidong Wu, M.K. Islam
A photonic router that uses variable-length optical gates has been developed and experimentally demonstrated at a data transmission speed of 10 Gbit/s, but it is difficult to update the routing table. We present a fast update scheme in the photonic router. Our scheme is driven by the hierarchy of prefixes in the routing table. On applying the scheme to a set of real route update traces obtained from the Internet core, we find that they can produce no more than 100 movements for 10,000 inserting operations. Further, when compared to an existing algorithm, in the average case, our algorithm shows a 90% reduction of movement overheads.
{"title":"Efficient update scheme in photonic router","authors":"Weidong Wu, M.K. Islam","doi":"10.1109/INCC.2004.1366590","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366590","url":null,"abstract":"A photonic router that uses variable-length optical gates has been developed and experimentally demonstrated at a data transmission speed of 10 Gbit/s, but it is difficult to update the routing table. We present a fast update scheme in the photonic router. Our scheme is driven by the hierarchy of prefixes in the routing table. On applying the scheme to a set of real route update traces obtained from the Internet core, we find that they can produce no more than 100 movements for 10,000 inserting operations. Further, when compared to an existing algorithm, in the average case, our algorithm shows a 90% reduction of movement overheads.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133751685","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 : 2004-06-11DOI: 10.1109/INCC.2004.1366562
J. Alvi
Summary form only given. The paper discusses the issues carriers have been facing in the access and metropolitan networks (the areas where most capital spending is still happening), and how these networks are evolving using next generation technologies and what factors are most important to them. It also discusses the technologies that are being deployed by carriers in emerging markets and how some of them may be applicable to Pakistan.
{"title":"Convergence in telecommunications: a forward look","authors":"J. Alvi","doi":"10.1109/INCC.2004.1366562","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366562","url":null,"abstract":"Summary form only given. The paper discusses the issues carriers have been facing in the access and metropolitan networks (the areas where most capital spending is still happening), and how these networks are evolving using next generation technologies and what factors are most important to them. It also discusses the technologies that are being deployed by carriers in emerging markets and how some of them may be applicable to Pakistan.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123370174","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
扫码关注我们
求助内容：
应助结果提醒方式：