<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>Lipaul0623's Blog</title>
	<atom:link href="http://lipaul0623.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://lipaul0623.wordpress.com</link>
	<description>Just another WordPress.com weblog</description>
	<lastBuildDate>Fri, 16 Oct 2009 07:44:29 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='lipaul0623.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Lipaul0623's Blog</title>
		<link>http://lipaul0623.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://lipaul0623.wordpress.com/osd.xml" title="Lipaul0623&#039;s Blog" />
	<atom:link rel='hub' href='http://lipaul0623.wordpress.com/?pushpress=hub'/>
		<item>
		<title>Celerra Basic</title>
		<link>http://lipaul0623.wordpress.com/2009/10/16/celerra-basic/</link>
		<comments>http://lipaul0623.wordpress.com/2009/10/16/celerra-basic/#comments</comments>
		<pubDate>Fri, 16 Oct 2009 07:44:29 +0000</pubDate>
		<dc:creator>lipaul0623</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://lipaul0623.wordpress.com/?p=31</guid>
		<description><![CDATA[The Celerra File Server cabinet contains a cluster of up to 14 independent Data Movers that Channels between operate as autonomous dedicated file servers, establishing highly efficient channels between the Data and the Network data and the network. Data Movers enable concurrent access to file systems by heterogeneous network clients using multiple network technologies (including [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=lipaul0623.wordpress.com&amp;blog=5256441&amp;post=31&amp;subd=lipaul0623&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p>The Celerra File Server cabinet contains a cluster of up to 14 independent Data Movers that<br />
Channels between operate as autonomous dedicated file servers, establishing highly efficient channels between the<br />
Data and the Network data and the network. Data Movers enable concurrent access to file systems by heterogeneous<br />
network clients using multiple network technologies (including Ethernet, Gigabit Ethernet, FDDI,<br />
and ATM). Celerra supports industry-standard Network File System (NFS), Common Internet File<br />
Systems (CIFS), FTP, and WebNFS protocols.</p>
<p><strong>Celerra File Server Hardware</strong></p>
<p>The hardware architecture of Celerra File Server (Figure 3) includes four backplanes, each with the<br />
capacity of four hardware slots. The lower left slot is reserved for the Control Station. A second<br />
(e.g., redundant) Control Station can use the lower right slot to support non-disruptive Control<br />
Station failover. (Data Mover failover does not require redundant Control Stations.) The remaining<br />
14 hardware slots are for Data Movers, each composed of an Intel®-based motherboard, PCI bus,<br />
network cards, SCSI cards, and/or fibre connections. The minimum configuration provides two Data<br />
Movers. Data Movers can be added to increase capacity and performance as environments grow.</p>
<p><strong>Cluster Processing </strong></p>
<p>A group of independent systems working together as a single system (e.g., cluster) appears to<br />
and Data Movers system managers as a single high-performance, highly available server. Cluster configurations<br />
ensure availability and scalability in business-critical computing applications.</p>
<p>Clustering assumes many forms in delivering scalability and high performance. Adding another<br />
server, for example, provides additional processing power to handle more complex, or a greater<br />
number of, requests from clients. Clustered servers assume the workload of a failed server without<br />
impacting client or network performance.</p>
<p>The fine granularity and the autonomous nature of the servers in the Celerra cluster — the Data<br />
Movers — provide superior fault isolation and containment. Their unique design isolates and<br />
limits the impact of failures to individual Data Movers, allows for seamless Data Mover failover<br />
and replacement, and permits near-linear scaling of performance by achieving parallelism across<br />
Data Movers. Data Movers mount and export file systems and respond to client requests for data<br />
access. In addition, the diskless Data Movers and Control Stations maintain a database of all information<br />
pertaining to their configurations, the file systems mounted by them, and file locks on the<br />
highly reliable and available Symmetrix storage systems.</p>
<p><strong>Celerra DART </strong></p>
<p>The Data Movers run Data Access in Real Time (DART), an optimized, embedded operating<br />
Operating System Software system designed exclusively for high-performance network file access with multi-protocol support.<br />
This realtime, multi-threaded operating system ensures highly optimized network file access, as<br />
illustrated in Figure 4.</p>
<p>DART separates control and data paths, enables high throughput rates, maintains responsiveness<br />
to user requests and enhances data availability. Its intelligent scheduling algorithms maintain<br />
sustained throughput under increasing loads and avoid throughput degradation, even under<br />
overload conditions.<br />
DART’s transaction-based file system, UxFS, maintains a log of all the file system metadata<br />
changes. In the event of a failure and reboot, only the log needs recovery through a short, constantduration<br />
operation, independent of the number of file systems and the amount of storage involved,<br />
eliminating the need to use fscheck in the majority of cases.<br />
Note: Celerra’s metadata logging typically handles reboot recovery in minutes. General-purpose<br />
computers without metadata logging can require hours for rebooting and file system checking.<br />
Write gathering, a DART optimization feature, contributes to Celerra’s superior write performance.<br />
Additional write performance improvements include the non-volatile Symmetrix system,<br />
which uses batteries to protect cache from power loss and prevent corruption. As required by NFS,<br />
Symmetrix provides synchronous data writes (and asynchronous destaging) to disk before<br />
acknowledging writes to clients.</p>
<p><strong>System Administration</strong></p>
<p>The Control Station performs Celerra’s system configuration and administrative functions and<br />
and Ease of Use offers three types of management interface:<br />
• Local management using a UNIX-like command line interface.<br />
• Remote management using a Web-based graphical user interface (GUI).<br />
• Over the network by using either SNMP MIB II management or Telnet.</p>
<p><strong>Celerra File Server Benefits</strong></p>
<p>As a high-capacity network attached storage system, Celerra File Server delivers availability, scalability, and high-performance file services.</p>
<p><strong>Availability</strong></p>
<p>The high-availability architecture of Celerra delivers simple, robust failover with minimal<br />
performance impact. A Data Mover failure prompts a cluster software response and the transfer of<br />
tasks from the failed server to one of the standby servers in the cluster.</p>
<p>The Celerra File Server ensures high data availability and virtually non-stop file access by combining<br />
Celerra File Server technology with EMC’s powerful Symmetrix Enterprise Storage system.</p>
<p>Redundant power supplies, redundant fans, environmental control, single-system management<br />
umbrella (e.g., setup, configuration, installation, and administration from a single, optionally<br />
redundant point of control), and reduced footprint packaging give Celerra’s Data Movers<br />
extensive reliability and availability. Specifically, Celerra creates high-availability through<br />
redundancy, failover, information protection with TimeFinder/FS for mirroring, remote<br />
diagnostics and maintenance, and disaster recovery.</p>
<p>Celerra’s flexible failover configurations include a full set of critical components:</p>
<p>• Redundant data paths within the Symmetrix<br />
• Redundant connection paths between the Symmetrix and the Data Movers (Fibre Channel and<br />
SCSI)<br />
• Standby Data Movers (customer configurable)<br />
• Redundant Control Stations (optional)<br />
• At least two internal network paths on each Data Mover and Control Station<br />
• Load-sharing power supplies (n + 1)<br />
• On-board battery backup<br />
• Dual AC power lines</p>
<p><strong>Redundancy</strong></p>
<p>Celerra File Server ensures continuous data availability by creating multiple data access paths<br />
throughout the system, from the disk drives to the network. In addition, the Celerra cabinet<br />
provides redundancy of all critical components, ensuring high availability of data on the network.<br />
Dual data paths throughout the file server eliminate single points of failure, protect data, and<br />
promote data availability. Celerra offers:</p>
<p>• Redundant Network Interface Cards (NICs) per Data Mover that provide multiple access paths to<br />
the network and maintain high availability in the event of a network card failure.<br />
• Dual connections between the Data Movers and the Control Station that handle internal communications.<br />
• The Celerra Fibre Channel driver uses the dual-port Emulex adapter to support 256 devices per<br />
controller port. EMC has tested and qualified this driver with Connectrix and Brocade switches.<br />
• Dual SCSI connections between Symmetrix and each Data Mover that support load-balancing.<br />
• Ethernet Trunking helps Celerra maintain high availability because other ports assume the load if<br />
one port fails. Ethernet Trunking combines up to four Ethernet ports into a single logical device.<br />
Trunking-capable switches handle statistical load balancing by connecting different clients to<br />
different ports. Ethernet Trunking provides higher aggregate throughput for a single IP address and<br />
avoids any increase in single-client throughput (subject to limitations on the overall aggregate<br />
throughput per Data Mover).</p>
<p>• Standby Data Movers ensure virtually uninterrupted access to data through automatic and quick<br />
failover support in the event of a Data Mover failure.<br />
• Independent Data Mover/Control Station Architecture makes Data Mover operations independent<br />
of the Control Station (except during configuration or failover). Control Station failure impacts<br />
only installation and management features in single Control Station configurations and does not<br />
impact users’ continued access to data.<br />
• Online file system duplication allows creation of multiple file system copies for other business uses.<br />
• Advanced Volume Management offers hyper volumes, meta volumes, slicing, and striping.<br />
• Dual internal Ethernet provides control and management with redundant load-sharing power supplies,<br />
battery backup, environmental controls, Auto-Call remote maintenance parameter<br />
monitoring, and redundant critical components.<br />
• Warranty includes one year for hardware, 90-day warranty for software with 7-day-a-week,<br />
24-hour coverage.</p>
<p>• Backup and proactive maintenance with full system battery backup and support for multiple<br />
backup options, including the EMC Data Manager (EDM™) for network-based backup, and the<br />
industry-standard Network Data Management Protocol (NDMP) for local backup.</p>
<p>The Data Mover failover capability (configurable from manual to completely automatic) allows a<br />
hot spare Data Mover to transparently take over from a failing Data Mover. This cost-effective<br />
failover capability enhances data availability while maintaining performance and ease<br />
of management. Failover typically occurs in 20 seconds to four minutes, depending on<br />
implementation factors.</p>
<p>To achieve this level of availability, two redundant internal networks connect the Control Station<br />
and all the Data Movers in the Celerra cabinet. The Control Station continuously monitors the<br />
health and status of the Data Movers. When the Control Station detects a failure, it powers down<br />
the failed Data Mover and notifies the spare. The diskless Data Movers can see all Symmetrix<br />
disks, allowing the spare Data Mover to assume control of the failed Data Mover’s files and<br />
configuration information.</p>
<p>The standby Data Mover assumes the IP and MAC addresses, the interface host names, and all<br />
information about the configuration and file systems of the failed Data Mover. Client service<br />
continues. The standby Data Mover transparently resumes NFS services to clients, with no<br />
requirement to unmount and remount the file system (Figure 5).</p>
<p>• Once configured, failover operates automatically and requires no intervention.<br />
• Failover appears transparent to NFS clients but not to CIFS clients*.<br />
• The standby Data Mover is already booted; there is no need to wait for boot time.<br />
• Failover does not degrade system throughput.</p>
<p>A single standby Data Mover can act as standby for any number of primary Data Movers when it<br />
connects to the same network as the primary Data Movers. Primary Data Movers located on<br />
different networks, however, require configuration of multiple standbys.</p>
<p><strong>TimeFinder/FS</strong></p>
<p>TimeFinder/FS, an implementation of EMC’s leading information protection software<br />
TimeFinder™, creates a point-in-time copy or a dynamic mirror of a file system. Integrated into the<br />
Celerra Control Station, the TimeFinder/FS option allows users to create file system copies (with<br />
only a brief suspension of access to the original file system). These copies permit independent<br />
non-disruptive file backups, “live copy” test beds for new applications, and mirror copies of files<br />
for redundancy and business continuity, as well as:</p>
<p>• Backup and restore of older versions of a specific file, directory, or complete file system.<br />
• Mirroring and continuous updates of an active file system.</p>
<p>Note: File system copies require that the configuration of the Symmetrix system attached to the<br />
Celerra File Server include business continuance volumes (BCVs). A BCV, which attaches to a<br />
standard volume on which a file system resides, provides the foundation for the file system copy.<br />
File systems can share BCVs, although the BCV remains dedicated to a volume.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/lipaul0623.wordpress.com/31/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/lipaul0623.wordpress.com/31/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/lipaul0623.wordpress.com/31/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/lipaul0623.wordpress.com/31/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/lipaul0623.wordpress.com/31/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/lipaul0623.wordpress.com/31/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/lipaul0623.wordpress.com/31/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/lipaul0623.wordpress.com/31/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/lipaul0623.wordpress.com/31/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/lipaul0623.wordpress.com/31/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/lipaul0623.wordpress.com/31/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/lipaul0623.wordpress.com/31/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/lipaul0623.wordpress.com/31/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/lipaul0623.wordpress.com/31/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=lipaul0623.wordpress.com&amp;blog=5256441&amp;post=31&amp;subd=lipaul0623&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://lipaul0623.wordpress.com/2009/10/16/celerra-basic/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/96fd7794aa846f6754bb1824f08186cb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">lipaul0623</media:title>
		</media:content>
	</item>
		<item>
		<title>MAC &amp; Hash</title>
		<link>http://lipaul0623.wordpress.com/2009/02/25/mac-hash/</link>
		<comments>http://lipaul0623.wordpress.com/2009/02/25/mac-hash/#comments</comments>
		<pubDate>Wed, 25 Feb 2009 03:15:28 +0000</pubDate>
		<dc:creator>lipaul0623</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[MAC Hash]]></category>

		<guid isPermaLink="false">http://lipaul0623.wordpress.com/?p=28</guid>
		<description><![CDATA[determine automatically if incoming ciphertext decrypts to intelligible plaintext It may be difficult to determine automatically if incoming ciphertext decrypts to intelligible plaintext. If the plaintext is, say, a binary object file or digitized X-rays, determination of properly formed and therefore authentic plaintext may be difficult. Thus, an opponent could achieve a certain level of [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=lipaul0623.wordpress.com&amp;blog=5256441&amp;post=28&amp;subd=lipaul0623&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p class="docText"><strong>determine <span class="docEmphasis">automatically</span> if incoming ciphertext  decrypts to intelligible plaintext</strong></p>
<p class="docText">It may be difficult to determine <span class="docEmphasis">automatically</span> if incoming ciphertext decrypts to  intelligible plaintext. If the plaintext is, say, a binary object file or  digitized X-rays, determination of properly formed and therefore authentic  plaintext may be difficult. Thus, an opponent could achieve a certain level of  disruption simply by issuing messages with random content purporting to come  from a legitimate user.</p>
<p class="docText">One solution to this problem is to force the plaintext to have  some structure that is easily recognized but that cannot be replicated without  recourse to the encryption function. We could, for example, append an  error-detecting code, also known as a frame check sequence (FCS) or checksum, to  each message before encryption, as illustrated in <a class="docLink" href="#ch11fig02">Figure 11.2a</a>. A prepares a plaintext message <span class="docEmphasis">M</span> and then provides this as input to a function F that  produces an FCS. The FCS is appended to <span class="docEmphasis">M</span> and the  entire block is then encrypted. At the destination, B decrypts the incoming  block and treats the results as a message with an appended FCS. B applies the  same function F to attempt to reproduce the FCS. If the calculated FCS is equal  to the incoming FCS, then the message is considered authentic. It is unlikely  that any random sequence of bits would exhibit the desired relationship.</p>
<p class="docText">Note that the order in which the FCS and encryption functions are performed is  critical. The sequence illustrated in <a class="docLink" href="#ch11fig02">Figure  11.2a</a> is referred to in [<a class="docLink" href="app04lev1sec1.html#biblio01_070">DIFF79</a>] as internal error control,  which the authors contrast with external error control (<a class="docLink" href="#ch11fig02">Figure 11.2b</a>). With internal error control, authentication  is provided because an opponent would have difficulty generating ciphertext  that, when decrypted, would have valid error control bits. If instead the FCS is  the outer code, an opponent can construct messages with valid error-control  codes. Although the opponent cannot know what the decrypted plaintext will be,  he or she can still hope to create confusion and disrupt operations.</p>
<p class="docText">
<h4 class="docSection2Title">Message Authentication Code</h4>
<p class="docText">An alternative authentication technique involves the use of a  secret key to generate a small fixed-size block of data, known as a <span class="docEmphRoman"><a name="ch11term5"></a>cryptographic checksum</span> or MAC  that is appended to the message. This technique assumes that two communicating  parties, say A and B, share a common secret key <span class="docEmphasis">K</span>. When A has a message to send to B, it calculates the  MAC as a function of the message and the key:MAC = C(<span class="docEmphasis">K</span>, <span class="docEmphasis">M</span>), where</p>
<table border="0" cellspacing="0" cellpadding="5" rules="none">
<col width="20"></col>
<col width="200"></col>
<thead></thead>
<tbody>
<tr>
<td class="docTableCell" align="right" valign="top">
<p class="docText"><span class="docEmphasis">M</span></p>
</td>
<td class="docTableCell" align="left" valign="top">
<p class="docText">= input message</p>
</td>
</tr>
<tr>
<td class="docTableCell" align="right" valign="top">
<p class="docText"><span class="docEmphasis">C</span></p>
</td>
<td class="docTableCell" align="left" valign="top">
<p class="docText">= MAC function</p>
</td>
</tr>
<tr>
<td class="docTableCell" align="right" valign="top">
<p class="docText"><span class="docEmphasis">K</span></p>
</td>
<td class="docTableCell" align="left" valign="top">
<p class="docText">= shared secret key</p>
</td>
</tr>
<tr>
<td class="docTableCell" align="right" valign="top">
<p class="docText">MAC</p>
</td>
<td class="docTableCell" align="left" valign="top">
<p class="docText">= message authentication  code</p>
</td>
</tr>
</tbody>
</table>
<p class="docText">The message plus MAC are transmitted to the intended recipient.  The recipient performs the same calculation on the received message, using the  same secret key, to generate a new MAC. The received MAC is compared to the  calculated MAC (<a class="docLink" href="#ch11fig04">Figure 11.4a</a>). If we  assume that only the receiver and the sender know the identity of the secret  key, and if the received MAC matches the calculated MAC, then</p>
<div style="font-weight:bold;">
<ol class="docList" type="1">
<li>
<div style="font-weight:normal;">
<p class="docList">The receiver is assured that the message has not been altered.  If an attacker alters the message but does not alter the MAC, then the  receiver&#8217;s calculation of the MAC will differ from the received MAC. Because the  attacker is assumed not to <a name="iddle1179"></a><a name="iddle2090"></a>know the  secret key, the attacker cannot alter the MAC to correspond to the alterations  in the message.</p>
</div>
</li>
<li>
<div style="font-weight:normal;">
<p class="docList">The receiver is assured that the message is from the alleged  sender. Because no one else knows the secret key, no one else could prepare a  message with a proper MAC.</p>
</div>
</li>
<li>
<div style="font-weight:normal;">
<p class="docList">If the message includes a sequence number (such as is used with  HDLC, X.25, and TCP), then the receiver can be assured of the proper sequence  because an attacker cannot successfully alter the sequence number.</p>
</div>
</li>
</ol>
<h4 class="docSection2Title">Requirements for MACs</h4>
<p class="docText">When an entire message is encrypted for confidentiality, using  either symmetric or asymmetric encryption, the security of the scheme generally  depends on the bit length of the key. Barring some weakness in the algorithm,  the opponent must resort to a brute-force attack using all possible keys. On  average, such an attack will require 2<sup>(<span class="docEmphasis">k-1</span>)</sup> attempts for a <span class="docEmphasis">k</span>-bit key. In particular, for a ciphertext-only attack,  the opponent, given ciphertext <span class="docEmphasis">C</span>, would perform  <span class="docEmphasis">P</span><sub><span class="docEmphasis">i</span></sub> =  D(<span class="docEmphasis">K</span><sub><span class="docEmphasis">i</span></sub>,  <span class="docEmphasis">C</span>) for all possible key values <span class="docEmphasis">K</span><sub><span class="docEmphasis">i</span></sub> until a  <span class="docEmphasis">P</span><sub><span class="docEmphasis">i</span></sub> was  produced that matched the form of acceptable plaintext.</p>
<p class="docText">
</div>
<div style="font-weight:bold;">Hash Function</div>
<div style="font-weight:bold;">A variation on the message authentication code is the <span class="docEmphRoman"><a name="ch11term12"></a>one-way hash function</span>. As with  the message authentication code, a hash function accepts a variable-size message  <span class="docEmphasis">M</span> as input and produces a fixed-size output,  referred to as a <a name="ch11term6"></a>hash code H(<span class="docEmphasis">M</span>). Unlike a MAC, a hash code does not use a key but is  a function only of the input message. The hash code is also referred to as a  <a name="ch11term11"></a><a class="docLink" href="app03.html#gloss01_045">message  digest</a> or <span class="docEmphStrong">hash value</span>. The hash code is  a function of all the bits of the message and provides an error-detection  capability: A change to any bit or bits in the message results in a change to  the hash code.</div>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/lipaul0623.wordpress.com/28/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/lipaul0623.wordpress.com/28/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/lipaul0623.wordpress.com/28/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/lipaul0623.wordpress.com/28/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/lipaul0623.wordpress.com/28/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/lipaul0623.wordpress.com/28/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/lipaul0623.wordpress.com/28/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/lipaul0623.wordpress.com/28/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/lipaul0623.wordpress.com/28/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/lipaul0623.wordpress.com/28/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/lipaul0623.wordpress.com/28/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/lipaul0623.wordpress.com/28/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/lipaul0623.wordpress.com/28/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/lipaul0623.wordpress.com/28/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=lipaul0623.wordpress.com&amp;blog=5256441&amp;post=28&amp;subd=lipaul0623&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://lipaul0623.wordpress.com/2009/02/25/mac-hash/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/96fd7794aa846f6754bb1824f08186cb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">lipaul0623</media:title>
		</media:content>
	</item>
	</channel>
</rss>
