NEW SCHEDULING ALGORITHMS FOR DIFFERENTIATED SERVICES NETWORK

Overview
Cite Work

ABSTRACT

One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time constraints. In this paper, we study the problem of providing real-time service to either hard or soft real-time messages in conjunction with a normal transmission service to variable-length messages without time constraints in Wavelength-Division-Multiplexing (WDM) optical networks. We propose an adaptive scheduling algorithm to schedule and manage message transmissions in single-hop passive-star coupler based WDM optical networks. We have analyzed the complexity of the algorithm to show its feasibility. In addition, we have conducted extensive discrete-event simulations to evaluate the performance of the proposed algorithm. This study suggests that when scheduling message transmission in WDM networks, a differentiated service should be designed to benefit the transmission of both real-time and non-real-time messages so that the overall performance of the network could be improved.

TABLE OF CONTENT

TITLE PAGE

CERTIFICATION

APPROVAL

DEDICATION

ACKNOWLEDGEMENT

ABSTRACT

TABLE OF CONTENT

CHAPTER ONE

1.0 INTRODUCTION

1.1 STATEMENT OF PROBLEM

1.2 PURPOSE OF STUDY

1.3 AIMS AND OBJECTIVES

1.4 SCOPE/DELIMITATIONS

1.5 LIMITATIONS/CONSTRAINTS

1.6 DEFINITION OF TERMS

CHAPTER TWO

2.0 LITERATURE REVIEW

CHAPTER THREE

3.0 METHODS FOR FACT FINDING AND DETAILED DISCUSSIONS OF THE SYSTEM

3.1 METHODOLOGIES FOR FACT-FINDING

3.2 DISCUSSIONS

CHAPTER FOUR

4.0 FUTURES, IMPLICATIONS AND CHALLENGES OF THE SYSTEM

4.1 FUTURES

4.2 IMPLICATIONS

4.3 CHALLENGES

CHAPTER FIVE

5.0 RECOMMENDATIONS, SUMMARY AND CONCLUSION

5.1 RECOMMENDATION

5.2 SUMMARY

5.3 CONCLUSION

5.4 REFERENCES

Read Download

NEW SCHEDULING ALGORITHMS FOR DIFFERENTIATED SERVICES NETWORK

Related Works