<?xml version="1.0" encoding="UTF-8"?>
	<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/">
		<channel rdf:about="http://www.opticsinfobase.org/RSSFeeds/JOCN_feed.xml">
			<title>Journal of Optical Communications and Networking</title>
			<link>http://jocn.osa.org</link>
			<description>Journal of Optical Communications and Networking</description>
			<pubDate>Tue, 15 May 2012 00:00:00 EST</pubDate>
			<image>
				<url>http://metadata.osa.org/rss/infobase/images/jocn.gif</url>
				<title>Journal of Optical Communications and Networking</title>
				<link>http://jocn.osa.org</link>
			</image>
			<items>	
			<rdf:Seq><rdf:li resource="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-468" /><rdf:li resource="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-480" /><rdf:li resource="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-457" /><rdf:li resource="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-449" /><rdf:li resource="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-436" /></rdf:Seq>
			</items>
			<dc:publisher>Optical Society of America</dc:publisher>
			<dc:rights>&#169; 2012 Optical Society of America</dc:rights>
			<dc:date>2012-05-16</dc:date>
		</channel>
		<item rdf:about="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-468">
			<title>Fitting Scheduling Timing&#x2013;Elastic Weighted Granting (FST&#x2013;EWG): An EPON DBA Algorithm</title> 
			<link>http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-468</link> 
			<description>Chuan-Ching Sue, Wei-Nung Sung&lt;br/&gt;Online scheduling algorithms incur no idle time problem but with less bandwidth efficiency, while offline scheduling algorithms focus on bandwidth efficiency but with idle time overhead. Although a just-in-time (JIT) scheduling algorithm for multi-channel Ethernet passive optical networks (EPONs) ... [J. Opt. Commun. Netw. 4, 468-479 (2012)]</description>
			<pubDate>Tue, 15 May 2012 00:00:00 EST</pubDate>
			<dc:title>Fitting Scheduling Timing&#x2013;Elastic Weighted Granting (FST&#x2013;EWG): An EPON DBA Algorithm</dc:title>
			<dc:creator>Chuan-Ching Sue Wei-Nung Sung</dc:creator>
			<dc:description>Online scheduling algorithms incur no idle time problem but with less bandwidth efficiency, while offline scheduling algorithms focus on bandwidth efficiency but with idle time overhead. Although a just-in-time (JIT) scheduling algorithm for multi-channel Ethernet passive optical networks (EPONs) ...</dc:description>
			<dc:publisher>Optical Society of America</dc:publisher>
			<dc:date>2012-06-01</dc:date>
			<dc:language>EN</dc:language>
			<dc:identifier>doi:10.1364/JOCN.4.000468</dc:identifier>
			<dc:source>Journal of Optical Communications and Networking, Vol. 4, Issue 6, pp. 468-479</dc:source>
			<dc:rights>&#169; 2012 OSA</dc:rights>
			
		</item>
		<item rdf:about="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-480">
			<title>Priority Based Routing and Wavelength Assignment With Traffic Grooming for Optical Networks</title> 
			<link>http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-480</link> 
			<description>Bijoy Chand Chatterjee, Nityananda Sarma, Partha Pritim Sahu&lt;br/&gt;One of the challenging issues in optical networks is call blocking and it increases with the number of connection requests due to the limited number of wavelength channels in each fiber link. In this paper, we propose a priority based routing and wavelength assignment scheme with incorporation of a ... [J. Opt. Commun. Netw. 4, 480-489 (2012)]</description>
			<pubDate>Tue, 15 May 2012 00:00:00 EST</pubDate>
			<dc:title>Priority Based Routing and Wavelength Assignment With Traffic Grooming for Optical Networks</dc:title>
			<dc:creator>Bijoy ChChatterjee</dc:creator>
			<dc:creator>Nityananda Sarma</dc:creator>
			<dc:creator>Partha Pritim Sahu</dc:creator>
			<dc:description>One of the challenging issues in optical networks is call blocking and it increases with the number of connection requests due to the limited number of wavelength channels in each fiber link. In this paper, we propose a priority based routing and wavelength assignment scheme with incorporation of a ...</dc:description>
			<dc:publisher>Optical Society of America</dc:publisher>
			<dc:date>2012-06-01</dc:date>
			<dc:language>EN</dc:language>
			<dc:identifier>doi:10.1364/JOCN.4.000480</dc:identifier>
			<dc:source>Journal of Optical Communications and Networking, Vol. 4, Issue 6, pp. 480-489</dc:source>
			<dc:rights>&#169; 2012 OSA</dc:rights>
			
		</item>
		<item rdf:about="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-457">
			<title>Survivable Path Computation in PCE-Based Multi-domain Networks</title> 
			<link>http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-457</link> 
			<description>Qiong Zhang, Mohammad M. Hasan, Xi Wang, Paparao Palacharla, Motoyoshi Sekiya&lt;br/&gt;We propose an optimal scheme for finding end-to-end shortest disjoint paths with a given sequence of domains in path computation element-based multi-domain networks. We compute the shortest path over multiple domains in the forward direction and compute the disjoint path in the backward direction. ... [J. Opt. Commun. Netw. 4, 457-467 (2012)]</description>
			<pubDate>Mon, 14 May 2012 00:00:00 EST</pubDate>
			<dc:title>Survivable Path Computation in PCE-Based Multi-domain Networks</dc:title>
			<dc:creator>Qiong Zhang</dc:creator>
			<dc:creator>Mohammad M. Hasan</dc:creator>
			<dc:creator>Xi Wang</dc:creator>
			<dc:creator>Paparao Palacharla</dc:creator>
			<dc:creator>Motoyoshi Sekiya</dc:creator>
			<dc:description>We propose an optimal scheme for finding end-to-end shortest disjoint paths with a given sequence of domains in path computation element-based multi-domain networks. We compute the shortest path over multiple domains in the forward direction and compute the disjoint path in the backward direction. ...</dc:description>
			<dc:publisher>Optical Society of America</dc:publisher>
			<dc:date>2012-06-01</dc:date>
			<dc:language>EN</dc:language>
			<dc:identifier>doi:10.1364/JOCN.4.000457</dc:identifier>
			<dc:source>Journal of Optical Communications and Networking, Vol. 4, Issue 6, pp. 457-467</dc:source>
			<dc:rights>&#169; 2012 OSA</dc:rights>
			
		</item>
		<item rdf:about="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-449">
			<title>Design of Energy-Saving Algorithms for Hybrid Fiber Coaxial Networks Based on the DOCSIS 3.0 Standard</title> 
			<link>http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-449</link> 
			<description>Zuqing Zhu&lt;br/&gt;We propose energy-saving algorithms to improve the energy efficiency of hybrid fiber coaxial (HFC) networks that support DOCSIS (Data Over Cable Service Interface Specification) 3.0 standard. The algorithms incorporate a traffic-aware approach and modify the operation statuses of the two primary ... [J. Opt. Commun. Netw. 4, 449-456 (2012)]</description>
			<pubDate>Thu, 10 May 2012 00:00:00 EST</pubDate>
			<dc:title>Design of Energy-Saving Algorithms for Hybrid Fiber Coaxial Networks Based on the DOCSIS 3.0 Standard</dc:title>
			<dc:creator>Zuqing Zhu</dc:creator>
			<dc:description>We propose energy-saving algorithms to improve the energy efficiency of hybrid fiber coaxial (HFC) networks that support DOCSIS (Data Over Cable Service Interface Specification) 3.0 standard. The algorithms incorporate a traffic-aware approach and modify the operation statuses of the two primary ...</dc:description>
			<dc:publisher>Optical Society of America</dc:publisher>
			<dc:date>2012-06-01</dc:date>
			<dc:language>EN</dc:language>
			<dc:identifier>doi:10.1364/JOCN.4.000449</dc:identifier>
			<dc:source>Journal of Optical Communications and Networking, Vol. 4, Issue 6, pp. 449-456</dc:source>
			<dc:rights>&#169; 2012 OSA</dc:rights>
			
		</item>
		<item rdf:about="http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-436">
			<title>A Dynamic Path-Computation Algorithm for a GMPLS-Enabled Multi-layer Network</title> 
			<link>http://www.opticsinfobase.org/abstract.cfm?URI=jocn-4-6-436</link> 
			<description>Anica Bukva, Ramon Casellas, Ricardo Mart&#x0ED;nez, Ra&#x0FC;l Mu&#x0F1;oz&lt;br/&gt;In this paper, we propose a path-computation algorithm for a dynamic virtual network topology (VNT) configuration. We focus on a multi-layer network formed by a connection-oriented Ethernet over a wavelength-switched optical network under the framework of a unified generalized multi-protocol ... [J. Opt. Commun. Netw. 4, 436-448 (2012)]</description>
			<pubDate>Tue, 08 May 2012 00:00:00 EST</pubDate>
			<dc:title>A Dynamic Path-Computation Algorithm for a GMPLS-Enabled Multi-layer Network</dc:title>
			<dc:creator>Anica Bukva</dc:creator>
			<dc:creator>Ramon Casellas</dc:creator>
			<dc:creator>Ricardo Mart&#x0ED;nez</dc:creator>
			<dc:creator>Ra&#x0FC;l Mu&#x0F1;oz</dc:creator>
			<dc:description>In this paper, we propose a path-computation algorithm for a dynamic virtual network topology (VNT) configuration. We focus on a multi-layer network formed by a connection-oriented Ethernet over a wavelength-switched optical network under the framework of a unified generalized multi-protocol ...</dc:description>
			<dc:publisher>Optical Society of America</dc:publisher>
			<dc:date>2012-06-01</dc:date>
			<dc:language>EN</dc:language>
			<dc:identifier>doi:10.1364/JOCN.4.000436</dc:identifier>
			<dc:source>Journal of Optical Communications and Networking, Vol. 4, Issue 6, pp. 436-448</dc:source>
			<dc:rights>&#169; 2012 OSA</dc:rights>
			
		</item>
	</rdf:RDF>

