Searching for communication networks : 8 results found | RSS Feed for this search

6.263J Data Communication Networks (MIT) 6.263J Data Communication Networks (MIT)

Description

6.263J / 16.37J focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control. 6.263J / 16.37J focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control.Subjects

data communication networks | data communication networks | architecture | architecture | network performance | network performance | network operation | network operation | next generation data networks | next generation data networks | network algorithms | network algorithms | mathematics | mathematics | probability theory | probability theory | layered network architecture | layered network architecture | Link Layer protocols | Link Layer protocols | high-speed packet switching | high-speed packet switching | queueing theory | queueing theory | Local Area Networks | Local Area Networks | Wide Area Networks | Wide Area Networks | 6.263 | 6.263 | 16.37 | 16.37License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata14.15J Networks (MIT) 14.15J Networks (MIT)

Description

Networks are ubiquitous in our modern society. The World Wide Web that links us to and enables information flows with the rest of the world is the most visible example. It is, however, only one of many networks within which we are situated. Our social life is organized around networks of friends and colleagues. These networks determine our information, influence our opinions, and shape our political attitudes. They also link us, often through important but weak ties, to everybody else in the United States and in the world. Economic and financial markets also look much more like networks than anonymous marketplaces. Firms interact with the same suppliers and customers and use Web-like supply chains. Financial linkages, both among banks and between consumers, companies and banks, also form a Networks are ubiquitous in our modern society. The World Wide Web that links us to and enables information flows with the rest of the world is the most visible example. It is, however, only one of many networks within which we are situated. Our social life is organized around networks of friends and colleagues. These networks determine our information, influence our opinions, and shape our political attitudes. They also link us, often through important but weak ties, to everybody else in the United States and in the world. Economic and financial markets also look much more like networks than anonymous marketplaces. Firms interact with the same suppliers and customers and use Web-like supply chains. Financial linkages, both among banks and between consumers, companies and banks, also form aSubjects

networks | networks | crowds | crowds | markets | markets | highly connected world | highly connected world | social networks | social networks | economic networks | economic networks | power networks | power networks | communication networks | communication networks | game theory | game theory | graph theory | graph theory | branching processes | branching processes | random graph models | random graph models | rich get richer phenomena | rich get richer phenomena | power laws | power laws | small worlds | small worlds | Erd?s-Renyi graphs | Erd?s-Renyi graphs | degree distributions | degree distributions | phase transitions | phase transitions | connectedness | connectedness | and giant component | and giant component | link analysis | link analysis | web search | web search | navigation | navigation | decentralized search | decentralized search | preferential attachment | preferential attachment | epidemics | epidemics | diffusion through networks | diffusion through networks | SIR | SIR | (susceptible | (susceptible | infected | infected | removed) | removed) | SIS | SIS | susceptible) | susceptible) | strategies | strategies | payoffs | payoffs | normal forms | normal forms | Nash equilibrium | Nash equilibrium | traffic networks | traffic networks | negative externalities | negative externalities | Braess' paradox | Braess' paradox | potential games | potential games | myopic behavior | myopic behavior | fictitious play | fictitious play | repeated games | repeated games | prisoner's dilemma | prisoner's dilemma | cooperation | cooperation | perfect information | perfect information | imperfect information | imperfect information | positive externalities | positive externalities | strategic complements | strategic complements | path dependence | path dependence | diffusion of innovation | diffusion of innovation | contagion pheonomena | contagion pheonomena | Bayes's rule | Bayes's rule | Bayesian Nash equilibrium | Bayesian Nash equilibrium | first price auctions | first price auctions | second price auctions | second price auctions | social learning | social learning | Bayesian learning | Bayesian learning | copying | copying | herding | herding | herd behavior | herd behavior | informational cascades | informational cascades | decisions | decisions | social choice | social choice | Condorcet jury theorem | Condorcet jury theorem | political economy | political economyLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.263J Data Communication Networks (MIT)

Description

6.263J / 16.37J focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control.Subjects

data communication networks | architecture | network performance | network operation | next generation data networks | network algorithms | mathematics | probability theory | layered network architecture | Link Layer protocols | high-speed packet switching | queueing theory | Local Area Networks | Wide Area Networks | 6.263 | 16.37License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allportuguesecourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.263J Data Communication Networks (MIT)

Description

6.263J / 16.37J focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control.Subjects

data communication networks | architecture | network performance | network operation | next generation data networks | network algorithms | mathematics | probability theory | layered network architecture | Link Layer protocols | high-speed packet switching | queueing theory | Local Area Networks | Wide Area Networks | 6.263 | 16.37License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allsimplifiedchinesecourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.263J Data Communication Networks (MIT)

Description

6.263J / 16.37J focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control.Subjects

data communication networks | architecture | network performance | network operation | next generation data networks | network algorithms | mathematics | probability theory | layered network architecture | Link Layer protocols | high-speed packet switching | queueing theory | Local Area Networks | Wide Area Networks | 6.263 | 16.37License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allspanishcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This resource shows two maps, the first being the United Kingdom and the other showing Europe and a part of Asia. Telephone icons are positioned on both maps.Subjects

maps | telephones | telecommunications | communication networks | united kingdom | europe | india | BUSINESS / MANAGEMENT / OFFICE STUDIES | Business and Administrative studies | Employability | Design and delivery of programmes | UK EL06 = SCQF 6 | Advanced courses | NICAT 3 | CQFW 3 | Advanced | A/AS Level | NVQ 3 | Higher | SVQ 3 | UK EL07 = SCQF 7 | Higher Certificate | NICAT 4 | CQFW 4 | NVQ 4 | Advanced Higher | SVQ 4 | HN Certificate | UK EL08 = SCQF 8 | Higher Diploma | NICAT 5 | CQFW 5 | HN Diploma | Diploma in HE | UK EL09 = SCQF 9 | Ordinary degree | NICAT 6 | CQFW 6 | NVQ 5 | SVQ 5 | Ordinary degree | Graduate certific | administrative studies | N000 | ALicense

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

Networks are ubiquitous in our modern society. The World Wide Web that links us to and enables information flows with the rest of the world is the most visible example. It is, however, only one of many networks within which we are situated. Our social life is organized around networks of friends and colleagues. These networks determine our information, influence our opinions, and shape our political attitudes. They also link us, often through important but weak ties, to everybody else in the United States and in the world. Economic and financial markets also look much more like networks than anonymous marketplaces. Firms interact with the same suppliers and customers and use Web-like supply chains. Financial linkages, both among banks and between consumers, companies and banks, also form aSubjects

networks | crowds | markets | highly connected world | social networks | economic networks | power networks | communication networks | game theory | graph theory | branching processes | random graph models | rich get richer phenomena | power laws | small worlds | Erd?s-Renyi graphs | degree distributions | phase transitions | connectedness | and giant component | link analysis | web search | navigation | decentralized search | preferential attachment | epidemics | diffusion through networks | SIR | (susceptible | infected | removed) | SIS | susceptible) | strategies | payoffs | normal forms | Nash equilibrium | traffic networks | negative externalities | Braess' paradox | potential games | myopic behavior | fictitious play | repeated games | prisoner's dilemma | cooperation | perfect information | imperfect information | positive externalities | strategic complements | path dependence | diffusion of innovation | contagion pheonomena | Bayes's rule | Bayesian Nash equilibrium | first price auctions | second price auctions | social learning | Bayesian learning | copying | herding | herd behavior | informational cascades | decisions | social choice | Condorcet jury theorem | political economyLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.263J Data Communication Networks (MIT)

Description

6.263J / 16.37J focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control.Subjects

data communication networks | architecture | network performance | network operation | next generation data networks | network algorithms | mathematics | probability theory | layered network architecture | Link Layer protocols | high-speed packet switching | queueing theory | Local Area Networks | Wide Area Networks | 6.263 | 16.37License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata